Termination by absence of infinite chains of dependency pairs

DOI10.1007/3-540-61064-2_38OpenAlexW1524014168MaRDI QIDQ5878910

Thomas Arts

Publication date: 23 February 2023

Published in: Trees in Algebra and Programming — CAAP '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61064-2_38

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (5)

Termination of constructor systems ⋮ Size-based termination of higher-order rewriting ⋮ Termination of term rewriting using dependency pairs ⋮ Unnamed Item ⋮ Formalization of the computational theory of a Turing complete functional language model

Cites Work

• Termination of rewriting
• Unification theory
• Termination of term rewriting: Interpretation and type elimination
• Foundations of equational logic programming
• The integration of functions into logic programming: From theory to practice
• Automatic termination proofs with transformation orderings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Termination by absence of infinite chains of dependency pairs