From PROLOG++ to PROLOG+CG: A CG Object-Oriented Logic Programming Language

2000 ◽  
pp. 540-554 ◽  
Author(s):  
Adil Kabbaj ◽  
Martin Janta-Polczynski
Keyword(s):  
Logic Programming ◽  
Programming Language ◽  
Object Oriented ◽  
Logic Programming Language

Adding Prolog Rules and OOPs Inheritance to Legacy Databases

1991 ◽  
Author(s):  
Art Goldschmidt ◽  
Dipayan Gangopadhyay
Keyword(s):  
Logic Programming ◽  
Programming Language ◽  
Object Oriented ◽  
Database System ◽  
Storage Management ◽  
Complex Objects ◽  
Rule Based ◽  
System Product ◽  
Viable Approach ◽  
Trigger Mechanisms

Abstract We present a viable approach to add rules capability or object orientation to legacy databases. Using a combination of language compilation, run-time trigger mechanisms and inter-language call facility, we integrate an object-oriented logic programming language, called OOLP, with an existing CIM Database System Product, IBM’s CIM CDF. The result is a system that provides storage management of complex objects, rule-based validation, object oriented knowledge modelling and declarative query capability.

scholarly journals From Interpreter to Logic Engine by Defunctionalization

2003 ◽  
Vol 10 (25) ◽  
Author(s):  
Dariusz Biernacki ◽  
Olivier Danvy
Keyword(s):  
Logic Programming ◽  
Programming Language ◽  
Operational Semantics ◽  
Lambda Calculus ◽  
Transition System ◽  
Abstract Machine ◽  
Logic Programming Language ◽  
Delimited Continuations ◽  
Simple Logic ◽  
Control Operators

Starting from a continuation-based interpreter for a simple logic programming language, propositional Prolog with cut, we derive the corresponding logic engine in the form of an abstract machine. The derivation originates in previous work (our article at PPDP 2003) where it was applied to the lambda-calculus. The key transformation here is Reynolds's defunctionalization that transforms a tail-recursive, continuation-passing interpreter into a transition system, i.e., an abstract machine. Similar denotational and operational semantics were studied by de Bruin and de Vink in previous work (their article at TAPSOFT 1989), and we compare their study with our derivation. Additionally, we present a direct-style interpreter of propositional Prolog expressed with control operators for delimited continuations.<br /><br />Superseded by BRICS-RS-04-5.

Sign in / Sign up

Export Citation Format

Share Document