Computability Closure: Ten Years Later - Computer Science > Logic in Computer ScienceReportar como inadecuado




Computability Closure: Ten Years Later - Computer Science > Logic in Computer Science - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: The notion of computability closure has been introduced for proving thetermination of higher-order rewriting with first-order matching by Jean-PierreJouannaud and Mitsuhiro Okada in a 1997 draft which later served as a basis forthe author-s PhD. In this paper, we show how this notion can also be used fordealing with beta-normalized rewriting with matching modulo beta-eta onpatterns \`a la Miller, rewriting with matching modulo some equational theory,and higher-order data types types with constructors having functionalrecursive arguments. Finally, we show how the computability closure can easilybe turned into a reduction ordering which, in the higher-order case, containsJean-Pierre Jouannaud and Albert Rubio-s higher-order recursive path orderingand, in the first-order case, is equal to the usual first-order recursive pathordering.



Autor: Frédéric Blanqui INRIA Lorraine - LORIA

Fuente: https://arxiv.org/



DESCARGAR PDF




Documentos relacionados