Simplifying algebraic functional systems

DOI10.1007/978-3-642-21493-6_13MaRDI QIDQ3014941zbMATH OpenOpenAlexFDO

Authors Cynthia Kop

Publication date 8 July 2011

Published in Algebraic Informatics (Search for Journal in Brave)

Full work available at URL https://research.vu.nl/ws/files/2941104/270479.pdf

zbMATH Keywords

\(\eta \)-expansionalgebraic functional systemsCurryinghigher-order term rewritingterminationtransformations

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Higher order dependency pairs for algebraic functional systems
• Dynamic dependency pairs for algebraic functional systems
• Polynomial interpretations for higher-order rewriting
• Processes, Terms and Cycles: Steps on the Road to Infinity
• A termination ordering for higher order rewrite systems

Cites work

• Comparing curried and uncurried rewriting
• Confluence of curried term-rewriting systems
• Higher order dependency pairs for algebraic functional systems
• The Computability Path Ordering: The End of a Quest
• Uncurrying for Termination

Cited in

(6)

• Dynamic dependency pairs for algebraic functional systems
• Harnessing first order termination provers using higher order dependency pairs
• A poly-algorithmic approach to simplifying elementary functions
• Higher order dependency pairs for algebraic functional systems
• Simplifications of Uniform Expressions Specified by Systems
• Wanda -- a higher-order termination tool (system description)

This page was built for publication: Simplifying algebraic functional systems

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