Dependency Pairs for Rewriting with Non-free Constructors

DOI10.1007/978-3-540-73595-3_32zbMath1213.68346OpenAlexW1496056514MaRDI QIDQ3608787

Stephan Falke, Deepak Kapur

Publication date: 6 March 2009

Published in: Automated Deduction – CADE-21 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73595-3_32

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Grammars and rewriting systems (68Q42)

Related Items (2)

Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures ⋮ Operational Termination of Conditional Rewriting with Built-in Numbers and Semantic Data Structures

Uses Software

• Maude
• Tyrolean
• AProVE

This page was built for publication: Dependency Pairs for Rewriting with Non-free Constructors