An universal termination condition for solving goals in equational languages

DOI10.1007/3-540-54317-1_110OpenAlexW170571015MaRDI QIDQ5881302

U. Modigliani, Gianni Aguzzi, Maria Cecilia Verri

Publication date: 9 March 2023

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

Full work available at URL: https://doi.org/10.1007/3-540-54317-1_110

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42)

Cites Work

• Orderings for term-rewriting systems
• Simplifying conditional term rewriting systems: Unification, termination and confluence
• Extended unification algorithms for the integration of functional programming into logic programming
• An Efficient Unification Algorithm
• A Machine-Oriented Logic Based on the Resolution Principle
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An universal termination condition for solving goals in equational languages