A compositional semantic basis for the analysis of equational Horn programs
From MaRDI portal
Publication:671509
DOI10.1016/0304-3975(96)00043-6zbMath0872.68107OpenAlexW2144678770WikidataQ57978309 ScholiaQ57978309MaRDI QIDQ671509
Germán Vidal, Moreno Falaschi, María Alpuente
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(96)00043-6
Related Items (1)
Cites Work
- Unification theory
- Conclog: a methodological approach to concurrent logic programming
- Completeness results for basic narrowing
- Incremental constraint satisfaction for equational logic programming
- Foundations of equational logic programming
- Basic narrowing revisited
- A theory of complete logic programs with equality
- Extending SLD resolution to equational horn clauses using E-unification
- Termination of logic programs: the never-ending story
- The integration of functions into logic programming: From theory to practice
- Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions
- Analyses of unsatisfiability for equational logic programming
- Narrowing directed by a graph of terms
- An abstract concurrent machine for rewriting
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A compositional semantic basis for the analysis of equational Horn programs