Skip to main content
Article thumbnail
Location of Repository

The computability path ordering: the end of a quest

By Frédéric Blanqui, Jean-pierre Jouannaud and Albert Rubio

Abstract

Abstract. 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.

Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.311.1680
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://arxiv.org/pdf/0806.2517... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.