Higher-Order Orderings for Normal Rewriting
From MaRDI portal
Publication:3527310
DOI10.1007/11805618_29zbMath1151.68449OpenAlexW1519070851MaRDI QIDQ3527310
Jean-Pierre Jouannaud, Albert Rubio
Publication date: 25 September 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11805618_29
Related Items (4)
Coq formalization of the higher-order recursive path ordering ⋮ Normal Higher-Order Termination ⋮ Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ The Computability Path Ordering: The End of a Quest
Uses Software
This page was built for publication: Higher-Order Orderings for Normal Rewriting
