Nominal completion for rewrite systems with binders

Conference object English OPEN
Fernández, Maribel; Rubio Gimeno, Alberto;
(2012)
  • Publisher: Springer
  • Identifiers: doi: 10.1007/978-3-642-31585-5_21
  • Subject: Completion | :Informàtica::Informàtica teòrica [Àrees temàtiques de la UPC] | Computational linguistics | Lingüística computacional | Rewriting systems (Computer science) | Nominal syntax | Orderings | Rewriting
    acm: TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES | TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS
    arxiv: Computer Science::Programming Languages | Computer Science::Symbolic Computation | Computer Science::Logic in Computer Science

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 ope... View more
Share - Bookmark