Semi-unification

DOI10.1016/0304-3975(91)90189-9zbMath0732.68063OpenAlexW2914435326MaRDI QIDQ808713

Deepak Kapur, Jonathan Stillman, Paliath Narendran, David R. Musser

Publication date: 1991

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(91)90189-9

zbMATH Keywords

rewrite ruleterm-rewriting systemnon-termination

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Grammars and rewriting systems (68Q42)

Related Items (2)

The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors ⋮ Loop detection in term rewriting using the eliminating unfoldings

Uses Software

• RRL

Cites Work

• Orderings for term-rewriting systems
• About the Paterson-Wegman linear unification algorithm
• Linear unification
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Semi-unification