Nominal Matching and Alpha-Equivalence

Authors:
Christophe Calvès;Maribel Fernández
Affiliations:
Department of Computer Science, Strand, King's College London, London, UK WC2R 2LS;Department of Computer Science, Strand, King's College London, London, UK WC2R 2LS
Venue:
WoLLIC '08 Proceedings of the 15th international workshop on Logic, Language, Information and Computation
Year:
2008

Citing 5
Cited 2

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
Nominal Equational Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Nominal rewriting

Information and Computation

Resolving Inductive Definitions with Binders in Higher-Order Typed Functional Programming

ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
The first-order nominal link

LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation

Quantified Score

Hi-index	0.01

Visualization

Abstract

Nominal techniques were introduced to represent in a simple andnatural way systems that involve binders. The syntax includes anabstraction operator and a primitive notion of name swapping.Nominal matching is matching modulo α-equality, andhas applications in programming languages and theorem proving,amongst others. In this paper we describe efficient algorithms tocheck the validity of equations involving binders, and also tosolve matching problems modulo α-equivalence, usingthe nominal approach.