The computability path ordering: the end of a quest

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In 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.
Dans CSL'08 (2008)

Keywords

Logic in Computer Science

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/212783

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0806.2517
 http://arxiv.org/abs/0806.2517

Collections

arXiv