An optimal narrowing strategy for general canonical systems

DOI10.1007/3-540-56393-8_39OpenAlexW1606787349MaRDI QIDQ5881212

Alexander Bockmayr, Stefan Krischer, Andreas Werner

Publication date: 9 March 2023

Published in: Conditional Term Rewriting Systems (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42)

Related Items (1)

On narrowing, refutation proofs and constraints

Cites Work

• Narrowing vs. SLD-resolution
• Foundations of equational logic programming
• Basic narrowing revisited
• Unification modulo an equality theory for equational logic programming
• Narrowing and unification in functional programming —An evaluation mechanism for absolute set abstraction
• Detecting redundant narrowing derivations by the LSE-SL reducibility test
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An optimal narrowing strategy for general canonical systems