Implementing nominal unification
| Venue: | In 3rd Int. Workshop on Term Graph Rewriting (TERMGRAPH’06), Vienna, Electronic |
| Citations: | 6 - 2 self |
BibTeX
@INPROCEEDINGS{Calvès_implementingnominal,
author = {Christophe Calvès and Maribel Fernández},
title = {Implementing nominal unification},
booktitle = {In 3rd Int. Workshop on Term Graph Rewriting (TERMGRAPH’06), Vienna, Electronic},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Nominal matching and unification underly the dynamics of nominal rewriting. Urban, Pitts and Gabbay gave a nominal unification algorithm which finds the most general solution to a nominal matching or unification problem, if one exists. Later the algorithm was extended by Fernández and Gabbay to deal with name generation and locality. In this paper we describe first a direct implementation of the nominal unification algorithm, including the extensions, in Maude. This implementation is not efficient (it is exponential in time), but we will show that we can obtain a feasible implementation by using termgraphs.
Citations
| 30 | α-prolog: A logic programming language with names, binding and αequivalence - CHENEY, URBAN |
| 15 | Unification of higher-order patterns in linear time and space - QIAN - 1996 |
| 12 | Nominal rewriting with name generation: abstraction vs. locality - FERNÁNDEZ, GABBAY |
| 12 | Nominal Rewriting Systems - Fernández, Gabbay, et al. - 2004 |
| 8 | Numbering matters: First-order canonical forms for second-order recursive types - Gauthier, Pottier - 2004 |
| 6 | Relating Nominal and Higher-Order Pattern Unification - Cheney - 2005 |
| 2 | Private communication - Cheney - 2006 |
