Mostra el registre d'ítem simple
Higher-order recursive path orderings
dc.contributor.author | Jouannaud, J P |
dc.contributor.author | Rubio Gimeno, Alberto |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-10-27T13:26:10Z |
dc.date.available | 2016-10-27T13:26:10Z |
dc.date.issued | 1998-12 |
dc.identifier.citation | Jouannaud, J., Rubio, A. "Higher-order recursive path orderings". 1998. |
dc.identifier.uri | http://hdl.handle.net/2117/91168 |
dc.description.abstract | This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by adapting the recursive path ordering definition to higher-order simply-typed lambda-terms. The main result is that this ordering is well-founded, compatible with beta-reductions, and with polymorphic typing. We also restrict the ordering so as to obtain a new ordering operating on higher-order terms in eta-long beta-normal form. Both orderings are powerful enough to allow for complex examples, including the polymorphic version of Gödel's recursor for simple inductive types. |
dc.format.extent | 24 p. |
dc.language.iso | eng |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Programació |
dc.subject.other | Higher order rewriting |
dc.subject.other | Typed lambda calculus |
dc.subject.other | Gödel polymorphic recursor |
dc.subject.other | Termination orderings |
dc.title | Higher-order recursive path orderings |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 1893883 |
dc.description.version | Postprint (published version) |
local.citation.author | Jouannaud, J.; Rubio, A. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]