Dependency Pairs for Rewriting with Non-free Constructors

DOI10.1007/978-3-540-73595-3_32zbMATH Open1213.68346OpenAlexW1496056514MaRDI QIDQ3608787FDOQ3608787

Authors: 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

Recommendations

• Publication:2778873
• Rewriting Techniques and Applications
• Termination of term rewriting using dependency pairs
• Modular termination proofs for rewriting using dependency pairs
• Termination by absence of infinite chains of dependency pairs

Mathematics Subject Classification ID

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

Cited In (8)

• Higher order dependency pairs for algebraic functional systems
• Operational termination of conditional rewriting with built-in numbers and semantic data structures
• Enhancing dependency pair method using strong computability in simply-typed term rewriting
• Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures
• A static higher-order dependency pair framework
• Proving confluence in the confluence framework with confident
• Dynamic dependency pairs for algebraic functional systems
• Title not available (Why is that?)

Uses Software

• Maude
• Tyrolean
• AProVE

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608787)