HORPO with Computability Closure : A Reconstruction

This paper provides a new, decidable definition of the higher-order recursive path ordering in which type comparisons are made only when needed, therefore eliminating the need for the computability closure, and bound variables are handled explicitly, making it possible to handle recursors for arbitrary strictly positive inductive types.

• Type: Journal
• Year: 2007
• Where: CORR
• Authors: Frédéric Blanqui, Jean-Pierre Jouannaud, Albert Rubio
• Keywords: Computability Closure, CORR 2007, Decidable Definition, Education, Type Comparisons