Enumerating outer narrowing derivations for constructor-based term rewriting systems

DOI10.1016/S0747-7171(89)80015-XzbMath0678.68099OpenAlexW1986964021MaRDI QIDQ1124376

Jia-Huai You

Publication date: 1989

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0747-7171(89)80015-x

zbMATH Keywords

matching problemequational theoriesNarrowingequational logic programs

Mathematics Subject Classification ID

Related Items (4)

Completeness results for basic narrowing ⋮ A Debugging Scheme for Functional Logic Programs1 1This work has been partially supported by CICYT under grant TIC2001-2705-C03-01, by Acción Integrada Hispano-Italiana HI2000-0161, Acción Integrada Hispano-Alemana HA2001-0059 and by Generalitat Valenciana under grant GV01-424. ⋮ Lazy narrowing: Strong completeness and eager variable elimination (extended abstract) ⋮ Lazy narrowing: strong completeness and eager variable elimination

Cites Work

• A class of confluent term rewriting systems and unification
• Computing in systems described by equations
• Basic narrowing revisited
• Computing with rewrite systems
• Extended unification algorithms for the integration of functional programming into logic programming
• An Efficient Unification Algorithm
• Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity
• Equality, types, modules, and (why not?) generics for logic programming
• 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: Enumerating outer narrowing derivations for constructor-based term rewriting systems