A compositional semantic basis for the analysis of equational Horn programs
- 30 September 1996
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 165 (1) , 133-169
- https://doi.org/10.1016/0304-3975(96)00043-6
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Methodology for proving the termination of logic programsPublished by Springer Nature ,2005
- Incremental constraint satisfaction for equational logic programmingTheoretical Computer Science, 1995
- Analyses of unsatisfiability for equational logic programmingThe Journal of Logic Programming, 1995
- Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditionsThe Journal of Logic Programming, 1995
- The integration of functions into logic programming: From theory to practiceThe Journal of Logic Programming, 1994
- Termination of logic programs: the never-ending storyThe Journal of Logic Programming, 1994
- Completeness results for basic narrowingApplicable Algebra in Engineering, Communication and Computing, 1994
- Extending SLD resolution to equational horn clauses using E-unificationThe Journal of Logic Programming, 1989
- A theory of complete logic programs with equalityThe Journal of Logic Programming, 1984
- Denotational semantics: The scott-strachey approach to programming language theory: Joseph E. Stoy (The MIT Press, Cambridge, MA)Computer Languages, 1983