Lazy narrowing: strong completeness and eager variable elimination (extended abstract)
From MaRDI portal
Publication:5096745
DOI10.1007/3-540-59293-8_209zbMATH Open1496.68167OpenAlexW1570994654MaRDI QIDQ5096745FDOQ5096745
Authors: Satoshi Okui, Aart Middeldorp, 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
Recommendations
Cites Work
- Proving termination with multiset orderings
- An Efficient Unification Algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
- Completeness results for basic narrowing
- Title not available (Why is that?)
- Foundations of equational logic programming
- The integration of functions into logic programming: From theory to practice
- A proof theory for general unification
- Enumerating outer narrowing derivations for constructor-based term rewriting systems
- Complete sets of transformations for general E-unification
- Title not available (Why is that?)
- Improving transformation systems for general E-unification
- Lazy narrowing: strong completeness and eager variable elimination
- A refined version of general \(E\)-unification
Cited In (3)
This page was built for publication: Lazy narrowing: strong completeness and eager variable elimination (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096745)
