Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
A logical analysis of modules in logic programming
Journal of Logic Programming
Handbook of theoretical computer science (vol. B)
Logic and objects
HILOG: a foundation for higher-order logic programming
Journal of Logic Programming
Compositional analysis of modular logic programs
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ACM Transactions on Programming Languages and Systems (TOPLAS)
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
A syntax directed compiler for ALGOL 60
Communications of the ACM
Logic for Problem Solving
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
| Hi-index | 0.00 |
Semantics of logic programs has been given by proof theory, model theory and by fixpoint of the immediate-consequence operator. If clausal logic is a programming language, then it should also have a compositional semantics. Compositional semantics for programming languages follows the abstract syntax of programs, composing the meaning of a unit by a mathematical operation on the meanings of its constituent units. The procedural interpretation of logic has only yielded an incomplete abstract syntax for logic programs. We complete it and use the result as basis of a compositional semantics. We present for comparison Tarski’s algebraization of first-order predicate logic, which is in substance the compositional semantics for his choice of syntax. We characterize our semantics by equivalence with the immediate-consequence operator.