Generalized and Formalized Uncurrying
From MaRDI portal
Publication:3172898
DOI10.1007/978-3-642-24364-6_17zbMath1348.68086MaRDI QIDQ3172898
René Thiemann, Christian Sternagel
Publication date: 7 October 2011
Published in: Frontiers of Combining Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24364-6_17
termination; term rewriting; interactive theorem proving; dependency pairs; uncurrying; formalization
68Q42: Grammars and rewriting systems
Related Items
Uses Software
Cites Work
- Mechanizing and improving dependency pairs
- Isabelle/HOL. A proof assistant for higher-order logic
- Comparing curried and uncurried rewriting
- Certification of Termination Proofs Using CeTA
- Signature Extensions Preserve Termination
- Term Rewriting and All That
- Frontiers of Combining Systems
- Uncurrying for Termination