HORPO with Computability Closure: A Reconstruction

DOI10.1007/978-3-540-75560-9_12zbMath1137.03307arXiv0708.3582OpenAlexW1896024878MaRDI QIDQ3498461

Jean-Pierre Jouannaud, Frédéric Blanqui, Albert Rubio

Publication date: 15 May 2008

Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0708.3582

Mathematics Subject Classification ID

Logic in computer science (03B70) Combinatory logic and lambda calculus (03B40)

Related Items (3)

Coq formalization of the higher-order recursive path ordering ⋮ Uncurrying for termination and complexity ⋮ The Computability Path Ordering: The End of a Quest

Cites Work

• Polymorphic higher-order recursive path orderings
• Termination of rewriting in the Calculus of Constructions
• Higher-Order Termination: From Kruskal to Computability

This page was built for publication: HORPO with Computability Closure: A Reconstruction