Lazy narrowing: Strong completeness and eager variable elimination (extended abstract)

DOI10.1007/3-540-59293-8_209zbMath1496.68167OpenAlexW1570994654MaRDI QIDQ5096745

Aart Middeldorp, Satoshi Okui, Tetsuo Ida

Publication date: 18 August 2022

Published in: TAPSOFT '95: Theory and Practice of Software Development (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59293-8_209

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Lazy narrowing: strong completeness and eager variable elimination
• Enumerating outer narrowing derivations for constructor-based term rewriting systems
• A proof theory for general unification
• Complete sets of transformations for general E-unification
• Completeness results for basic narrowing
• Foundations of equational logic programming
• Proving termination with multiset orderings
• An Efficient Unification Algorithm
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• The integration of functions into logic programming: From theory to practice
• Improving transformation systems for general E-unification
• A refined version of general E-unification
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lazy narrowing: Strong completeness and eager variable elimination (extended abstract)