A recursive path ordering for higher-order terms in η-long β-normal form
From MaRDI portal
Publication:5055855
DOI10.1007/3-540-61464-8_46zbMATH Open1503.68119OpenAlexW1963631461MaRDI QIDQ5055855FDOQ5055855
Authors: Jean-Pierre Jouannaud, Albert Rubio
Publication date: 9 December 2022
Published in: Rewriting Techniques and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61464-8_46
Recommendations
Cites Work
Cited In (9)
- The Computability Path Ordering: The End of a Quest
- Normal higher-order termination
- Rewrite orderings for higher-order terms in \(\eta\)-long \(\beta\)-normal form and the recursive path ordering
- The embedding path order for \(\lambda\)-free higher-order terms
- A Simplified Application of Howard’s Vector Notation System to Termination Proofs for Typed Lambda-Calculus Systems
- A termination ordering for higher order rewrite systems
- Higher-Order Orderings for Normal Rewriting
- A Lambda-Free Higher-Order Recursive Path Order
- Cutting a proof into bite-sized chunks: incrementally proving termination in higher-order term rewriting (invited talk)
Uses Software
This page was built for publication: A recursive path ordering for higher-order terms in η-long β-normal form
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055855)