Sciweavers

CSL
2008
Springer
13 years 6 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 ...
Frédéric Blanqui, Jean-Pierre Jouann...