The first-order nominal link

Authors:
Christophe Calvès;Maribel Fernández
Affiliations:
King's College London, Department of Informatics, Strand, London;King's College London, Department of Informatics, Strand, London
Venue:
LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Year:
2010

Citing 11
Cited 0

Linear unification

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
FreshML: programming with binders made simple

ICFP '03 Proceedings of the eighth ACM SIGPLAN international conference on Functional programming
Nominal logic, a first order theory of names and binding

Information and Computation - TACS 2001
Nominal unification

Theoretical Computer Science
The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)

The Implementation of Functional Programming Languages (Prentice-Hall International Series in Computer Science)
Nominal Equational Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Nominal rewriting

Information and Computation
A polynomial nominal unification algorithm

Theoretical Computer Science
Nominal Matching and Alpha-Equivalence

WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Nominal Unification from a Higher-Order Perspective

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Nominal (Universal) Algebra

Journal of Logic and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a morphism from nominal syntax, which supports binding, to standard (first-order) syntax.We use this morphism to extend Paterson and Wegman's linear first-order unification algorithm in order to deal with terms modulo alpha-equivalence. The nominal unification algorithm obtained is quadratic in time.