Higher order dependency pairs for algebraic functional systems

DOI10.4230/LIPICS.RTA.2011.203MaRDI QIDQ5389082zbMATH OpenOpenAlexFDO

Authors Cynthia Kop, Femke van Raamsdonk

Publication date 24 April 2012

Full work available at URL http://subs.emis.de/LIPIcs/frontdoor_7021.html

zbMATH Keywords

dynamic dependency pairshigher order rewritingtermination

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Dynamic dependency pairs for algebraic functional systems
• Simplifying algebraic functional systems
• A termination ordering for higher order rewrite systems
• Dependency Pairs for Rewriting with Non-free Constructors
• Frontiers of Combining Systems

Cited in

(7)

• Dynamic dependency pairs for algebraic functional systems
• Normal higher-order termination
• Simplifying algebraic functional systems
• Harnessing first order termination provers using higher order dependency pairs
• Uncurrying for termination and complexity
• Size-based termination of higher-order rewriting
• Refinement types as higher-order dependency pairs

This page was built for publication: Higher order dependency pairs for algebraic functional systems

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