Nominal completion for rewrite systems with binders

Home | About RECERCAT | Contact

Català | Castellano

All of RECERCAT

By Communities &
Collections By Defense Date By Authors By Titles By Subject

This Collection

By Defense Date By Authors By Titles By Subject

Statistics

View Statistics All RECERCAT

My RECERCAT

Other repositories directory

RECERCAT Home > Universitat Politècnica de Catalunya > Documents de recerca > View document

To access the full text documents, please follow this link: http://hdl.handle.net/2117/24004

dc.contributor	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.contributor	Universitat Politècnica de Catalunya. LOGPROG - Lògica i Programació
dc.contributor.author	Fernández, Maribel
dc.contributor.author	Rubio Gimeno, Alberto
dc.date	2012
dc.identifier.citation	Fernández, M.; Rubio, A. Nominal completion for rewrite systems with binders. A: International Colloquium on Automata, Languages and Programming. "Automata, Languages, and Programming: 39th International Colloquium, ICALP 2012: Warwick, UK, July 9-13, 2012: proceedings, part II". Warwick: Springer, 2012, p. 201-213.
dc.identifier.citation	978-3-642-31585-5
dc.identifier.citation	10.1007/978-3-642-31585-5_21
dc.identifier.uri	http://hdl.handle.net/2117/24004
dc.language.iso	eng
dc.publisher	Springer
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject	Computational linguistics
dc.subject	Rewriting systems (Computer science)
dc.subject	Nominal syntax
dc.subject	Rewriting
dc.subject	Orderings
dc.subject	Completion
dc.subject	Lingüística computacional
dc.title	Nominal completion for rewrite systems with binders
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/conferenceObject
dc.description.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.
dc.description.abstract	Peer Reviewed

Show simple item record

All of RECERCAT

This Collection

Statistics

My RECERCAT

Related documents

Other documents of the same author