Mostra el registre d'ítem simple
Path orderings, quasi-orderings and termination of term rewriting systems
dc.contributor.author | Borralleras Andreu, Cristina |
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-03-02T12:22:57Z |
dc.date.available | 2016-03-02T12:22:57Z |
dc.date.issued | 1997-10 |
dc.identifier.citation | Borralleras, C., Rubio, A. "Path orderings, quasi-orderings and termination of term rewriting systems". 1997. |
dc.identifier.uri | http://hdl.handle.net/2117/83697 |
dc.description.abstract | In this paper we present some original variations of the recursive path ordering. Additionally we define a restricted semantic path ordering which, in general, does not include the subterm relation, but is shown to be monotonic. By combining both kind of orderings we can prove (automatically) the termination of several (non-simply terminating) examples. |
dc.format.extent | 33 p. |
dc.language.iso | eng |
dc.relation.ispartofseries | LSI-97-42-R |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Programació |
dc.subject.other | Recursive path ordering |
dc.subject.other | Semantic path ordering |
dc.subject.other | Quasi orderings |
dc.title | Path orderings, quasi-orderings and termination of term rewriting systems |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 1893875 |
dc.description.version | Postprint (published version) |
local.citation.author | Borralleras, C.; Rubio, A. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]