Abstract
Nominal techniques were introduced to represent in a simple and natural way systems that involve binders. The syntax includes an abstraction operator and a primitive notion of name swapping. Nominal matching is matching modulo α-equality, and has applications in programming languages and theorem proving, amongst others. In this paper we describe efficient algorithms to check the validity of equations involving binders, and also to solve matching problems modulo α-equivalence, using the nominal approach.
This work has been partially funded by an EPSRC grant (EP/D501016/1 “CANS”).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baader, F., Snyder, W.: Unification Theory. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, ch. 8, vol. I, pp. 445–532. Elsevier Science, Amsterdam (2001)
Calvès, C., Fernández, M.: Implementing nominal unification. In: Proceedings of TERMGRAPH 2006, 3rd International Workshop on Term Graph Rewriting, ETAPS 2006, Vienna. Electronic Notes in Computer Science, Elsevier, Amsterdam (2006)
Cheney, J.: α-Prolog: an interpreter for a logic programming language based on nominal logic, http://homepages.inf.ed.ac.uk/jcheney/programs/aprolog/
Clouston, R.A., Pitts, A.M.: Nominal Equational Logic. In: Cardelli, L., Fiore, M., Winskel, G. (eds.) Computation, Meaning and Logic. Articles dedicated to Gordon Plotkin. Electronic Notes in Theoretical Computer Science, vol. 1496, Elsevier, Amsterdam (2007)
Fernández, M., Gabbay, M.J.: Nominal Rewriting. Information and Computation 205, 917–965 (2007)
Gabbay, M.J., Mathijssen, A.: Nominal Algebra. In: Proceedings of the 18th Nordic Workshop on Programming Theory (NWPT 2006) (2006)
Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax with variable binding. Formal Aspects of Computing 13, 341–363 (2001)
Newman, M.H.A.: On theories with a combinatorial definition of equivalence. Annals of Mathematics 43(2), 223–243 (1942)
OCAML, http://caml.inria.fr/
Pitts, A.M.: Nominal logic, a first order theory of names and binding. Information and Computation 186, 165–193 (2003)
Shinwell, M.R., Pitts, A.M., Gabbay, M.J.: FreshML: Programming with binders made simple. In: Eighth ACM SIGPLAN International Conference on Functional Programming (ICFP 2003), Sweden, pp. 263–274. ACM Press, New York (2003)
Urban, C., Pitts, A.M., Gabbay, M.J.: Nominal unification. Theoretical Computer Science 323, 473–497 (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Calvès, C., Fernández, M. (2008). Nominal Matching and Alpha-Equivalence. In: Hodges, W., de Queiroz, R. (eds) Logic, Language, Information and Computation. WoLLIC 2008. Lecture Notes in Computer Science(), vol 5110. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69937-8_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-69937-8_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69936-1
Online ISBN: 978-3-540-69937-8
eBook Packages: Computer ScienceComputer Science (R0)