Simplifying Algebraic Functional Systems

DOI10.1007/978-3-642-21493-6_13zbMath1339.68138OpenAlexW1666634947MaRDI QIDQ3014941

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

transformationsterminationhigher-order term rewritingCurrying\(\eta \)-expansionalgebraic functional systems

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (1)

Harnessing First Order Termination Provers Using Higher Order Dependency Pairs

Cites Work

• Confluence of curried term-rewriting systems
• Comparing curried and uncurried rewriting
• The Computability Path Ordering: The End of a Quest
• Higher Order Dependency Pairs for Algebraic Functional Systems
• Uncurrying for Termination

This page was built for publication: Simplifying Algebraic Functional Systems