To access the full text documents, please follow this link:

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
Lingüística computacional

Show full item record

Related documents

Other documents of the same author

Giesl, Jürgen; Mesnard, Frédéric; Rubio Gimeno, Alberto; Thiemann, René; Waldmann, Johannes
Blanqui, Frédéric; Jouannaud, Jean Pierre; Rubio Gimeno, Alberto
Jouannaud, Jean Pierre; Rubio Gimeno, Alberto
Rubio Gimeno, Alberto
Jouannaud, J P; Rubio Gimeno, Alberto