A recursive path ordering for higher-order terms in η-long β-normal form
From MaRDI portal
Publication:5055855
Recommendations
Cites work
- scientific article; zbMATH DE number 2185672 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- A termination ordering for higher order rewrite systems
- Higher-order unification, polymorphism, and subsorts
- Orderings for term-rewriting systems
- Termination of combined (rewrite and λ-calculus) systems
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 termination ordering for higher order rewrite systems
- A Simplified Application of Howard’s Vector Notation System to Termination Proofs for Typed Lambda-Calculus 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)
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)