A logical analysis of modules in logic programming
Journal of Logic Programming
Meta-programming in logic programming
Handbook of theoretical computer science (vol. B)
Extending Horn clause logic with implication goals
Theoretical Computer Science
A calculus for the construction of modular Prolog programs
Journal of Logic Programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
Meta-logic for program composition: semantics issues
Meta-logics and logic programming
Composing logic programs by meta-programming in Go¨del
Meta-logics and logic programming
Meta-programming with theory systems
Meta-logics and logic programming
Towards declarative GIS analysis
GIS '96 Proceedings of the 4th ACM international workshop on Advances in geographic information systems
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Applying restriction constraints to deductive databases
Annals of Mathematics and Artificial Intelligence
MedMaker: A Mediation System Based on Declarative Specifications
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Algebraic Properties of Idempotent Substitutions
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
A Refinement of Import/Export Declarations in Modular Logic Programming and its Semantics
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
The Constraint Operator of MedLan: Its Efficient Implementation and Use
Proceedings of the IFIP TC11 Working Group 11.5, Second Working Conference on Integrity and Internal Control in Information Systems: Bridging Business Requirements and Research Results
A parameterised module system for constructing typed logic programs
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 2
Hi-index | 0.00 |
We present a logic-based programming language that features meta-level composition operations over programs. Object programs are parameterised named collections of definite clauses which may contain formulae of the form Ain Pexp, where A is a standard atomic formula and Pexp is a program expression obtained by applying composition operations over named object programs. The semantics of the language is presented in two different equivalent styles. An operational, top-down semantics is given by means of inference rules, while a denotational, bottom-up semantics is given via an immediate consequence operator associated with program expressions. A meta-programming implementation of the language is also presented by transforming the operational inference rules into meta-level axioms. Several programming examples are discussed to illustrate the expressive power of the language.