Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/24004
Título:
|
Nominal completion for rewrite systems with binders
|
Autor/a:
|
Fernández, Maribel; Rubio Gimeno, Alberto
|
Otros autores:
|
Universitat Politècnica de Catalunya. Departament de Ciències de la Computació; Universitat Politècnica de Catalunya. LOGPROG - Lògica i Programació |
Abstract:
|
We design a completion procedure for nominal rewriting systems, based on a generalisation of the recursive path ordering to take into account alpha equivalence. Nominal rewriting generalises first-order rewriting by providing support for the specification of binding operators. Completion of rewriting systems with binders is a notably difficult problem; the completion procedure presented in this paper is the first to deal with binders in rewrite rules. |
Abstract:
|
Peer Reviewed |
Materia(s):
|
-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica -Computational linguistics -Rewriting systems (Computer science) -Nominal syntax -Rewriting -Orderings -Completion -Lingüística computacional |
Derechos:
|
|
Tipo de documento:
|
Artículo - Versión publicada Objeto de conferencia |
Editor:
|
Springer
|
Compartir:
|
|
Mostrar el registro completo del ítem