Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/24004

Nominal completion for rewrite systems with binders
Fernández, Maribel; Rubio Gimeno, Alberto
Universitat Politècnica de Catalunya. Departament de Ciències de la Computació; Universitat Politècnica de Catalunya. LOGPROG - Lògica i Programació
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.
Peer Reviewed
À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
info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/conferenceObject
Springer
         

Mostrar el registro completo del ítem

Documentos relacionados

Otros documentos del mismo autor/a

Larraz Hurtado, Daniel; Oliveras Llunell, Albert; Rodríguez Carbonell, Enric; Rubio Gimeno, Alberto
Larraz Hurtado, Daniel; Nimkar, Kaustubh; Oliveras Llunell, Albert; Rodríguez Carbonell, Enric; Rubio Gimeno, Alberto
Larraz Hurtado, Daniel; Oliveras Llunell, Albert; Rodríguez Carbonell, Enric; Rubio Gimeno, Alberto
Giesl, Jürgen; Mesnard, Frédéric; Rubio Gimeno, Alberto; Thiemann, René; Waldmann, Johannes
Blanqui, Frédéric; Jouannaud, Jean Pierre; Rubio Gimeno, Alberto