Fully abstract compositional semantics for an algebra of logic programs
- 1 October 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 149 (2) , 201-229
- https://doi.org/10.1016/0304-3975(95)00012-l
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Modular logic programmingACM Transactions on Programming Languages and Systems, 1994
- Reasoning about Termination of Pure Prolog ProgramsInformation and Computation, 1993
- Compositional model-theoretic semantics for logic programsNew Generation Computing, 1992
- Declarative modeling of the operational behavior of logic languagesTheoretical Computer Science, 1989
- Enumeration operators and modular logic programmingThe Journal of Logic Programming, 1987
- On the efficiency of subsumption algorithmsJournal of the ACM, 1985
- Closures and fairness in the semantics of programming logicTheoretical Computer Science, 1984
- LCF considered as a programming languageTheoretical Computer Science, 1977
- Fully abstract models of typed λ-calculiTheoretical Computer Science, 1977
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976