A class of confluent term rewriting systems and unification

DOI10.1007/BF00248250zbMath0642.68032OpenAlexW2092386169MaRDI QIDQ1101209

P. A. Subrahmanyam, Jia-Huai You

Publication date: 1986

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00248250

zbMATH Keywords

term rewriting systemsnarrowingequational theoriesE-unification

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Related Items (4)

A class of confluent term rewriting systems and unification ⋮ Unification modulo an equality theory for equational logic programming ⋮ Enumerating outer narrowing derivations for constructor-based term rewriting systems ⋮ Basic narrowing revisited

Uses Software

• NARROWER

Cites Work

• A class of confluent term rewriting systems and unification
• Complete Sets of Reductions for Some Equational Theories
• Programming with Equations
• A Machine-Oriented Logic Based on the Resolution Principle
• Equality, types, modules, and (why not?) generics for logic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A class of confluent term rewriting systems and unification