Sciweavers

Share
CSL
2008
Springer

The Computability Path Ordering: The End of a Quest

9 years 1 months ago
The Computability Path Ordering: The End of a Quest
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 `a la Tait and Girard, therefore explaining the name of the improved ordering.
Frédéric Blanqui, Jean-Pierre Jouann
Added 19 Oct 2010
Updated 19 Oct 2010
Type Conference
Year 2008
Where CSL
Authors Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio
Comments (0)
books