Proving termination of (conditional) rewrite systems. A semantic approach

DOI10.1007/BF01209624zbMath0790.68054OpenAlexW2911610589MaRDI QIDQ1323317

Johan Lewi, Eddy Bevers

Publication date: 10 May 1994

Published in: Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

terminationterm rewritingsemantic informationconditional rewrite systemscontextual orderingsemantic ordering

Mathematics Subject Classification ID

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

Related Items (2)

Termination of constructor systems ⋮ Termination of term rewriting using dependency pairs

Uses Software

• REVE

Cites Work

• Termination of rewriting systems by polynomial interpretations and its implementation
• Orderings for term-rewriting systems
• On the recursive decomposition ordering with lexicographical status and other related orderings
• Conditional rewrite rules
• Termination of rewriting
• Simplifying conditional term rewriting systems: Unification, termination and confluence
• Conditional rewrite rules: Confluence and termination
• A note on simplification orderings
• Rewriting techniques and applications. 3rd international conference, RTA-89, Chapel Hill, NC, USA, April 3--5, 1989. Proceedings
• Proving Properties of Programs by Structural Induction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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: Proving termination of (conditional) rewrite systems. A semantic approach