Higher-Order Termination: From Kruskal to Computability

DOI10.1007/11916277_1zbMath1165.03343arXivcs/0609039OpenAlexW1884307414MaRDI QIDQ5387879

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

Publication date: 27 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/cs/0609039

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Grammars and rewriting systems (68Q42)

Related Items (3)

HORPO with Computability Closure: A Reconstruction ⋮ The Computability Path Ordering: The End of a Quest ⋮ Typing termination in a higher-order concurrent imperative language

This page was built for publication: Higher-Order Termination: From Kruskal to Computability