Combinatory reduction systems: introduction and survey
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
Metamathematics, machines, and Go¨del's proof
Metamathematics, machines, and Go¨del's proof
A Metalanguage for Programming with Bound Names Modulo Renaming
MPC '00 Proceedings of the 5th International Conference on Mathematics of Program Construction
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
PPDP '04 Proceedings of the 6th ACM SIGPLAN international conference on Principles and practice of declarative programming
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
Static Name Control for FreshML
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
A polynomial nominal unification algorithm
Theoretical Computer Science
Electronic Notes in Theoretical Computer Science (ENTCS)
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Nominal completion for rewrite systems with binders
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
Nominal terms generalise first-order terms by including abstraction and name swapping constructs. @a-equivalence can be easily axiomatised using name swappings and a freshness relation, which makes the nominal approach well adapted to the specification of systems that involve binders. Nominal matching is matching modulo @a-equivalence and has applications in programming languages, rewriting, and theorem proving. In this paper, we describe efficient algorithms to check the validity of equations involving binders and to solve matching problems modulo @a-equivalence, using the nominal approach.