The computability path ordering
Tipus de documentArticle
Condicions d'accésAccés obert
Projecte de la Comissió Europea
This paper aims at carrying out termination proofs for simply typed higher-order calculi automatically by using ordering comparisons. To this end, we introduce the computability path ordering (CPO), a recursive relation on terms obtained by lifting a precedence on function symbols. A first version, core CPO, is essentially obtained from the higher-order recursive path ordering (HORPO) by eliminating type checks from some recursive calls and by incorporating the treatment of bound variables as in the com-putability closure. The well-foundedness proof shows that core CPO captures the essence of computability arguments ^#224, la Tait and Girard, therefore explaining its name. We further show that no further type check can be eliminated from its recursive calls without loosing well-foundedness, but for one for which we found no counterexample yet. Two extensions of core CPO are then introduced which allow one to consider: the first, higher-order inductive types; the second, a precedence in which some function symbols are smaller than application and abstraction.
CitacióBlanqui, F., Jouannaud, J., Rubio, A. The computability path ordering. "Logical methods in computer science", 26 Octubre 2015, vol. 11, núm. 4, Paper 3, p. 1-45.
Versió de l'editorhttp://www.lmcs-online.org/ojs/viewarticle.php?id=1575