The computability path ordering: the end of a quest

Simple item page
dc.creatorBlanqui, Frédéric
dc.creatorJouannaud, Jean-Pierre
dc.creatorRubio, Albert
dc.date2008-06-16
dc.date.accessioned2026-07-07T12:19:31Z
dc.date.available2026-07-07T12:19:31Z
dc.descriptionIn this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for which we provide an improved definition, the Computability Path Ordering. This new definition appears indeed to capture the essence of computability arguments à la Tait and Girard, therefore explaining the name of the improved ordering.
dc.descriptionDans CSL'08 (2008)
dc.identifierhttps://arxiv.org/abs/0806.2517
dc.identifierhttp://arxiv.org/abs/0806.2517
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/212783
dc.subjectLogic in Computer Science
dc.titleThe computability path ordering: the end of a quest
dc.typetext

Files

Collections

arXiv