Type Inference Verified: Algorithm W in Isabelle/HOL
Journal of Automated Reasoning
Nominal logic, a first order theory of names and binding
Information and Computation - TACS 2001
Scrap your nameplate: (functional pearl)
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Toward a general theory of names: binding and scope
Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Towards a mechanized metatheory of standard ML
Proceedings of the 34th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The design and implementation of typed scheme
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Mechanizing the Metatheory of LF
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Ott: Effective tool support for the working semanticist
Journal of Functional Programming
External and internal syntax of the λ-calculus
Journal of Symbolic Computation
Quotients revisited for Isabelle/HOL
Proceedings of the 2011 ACM Symposium on Applied Computing
A design structure for higher order quotients
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Nominal techniques in Isabelle/HOL
CADE' 20 Proceedings of the 20th international conference on Automated Deduction
ΠΣ: dependent types without the sugar
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
A new foundation for nominal isabelle
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Recursion principles for syntax with bindings and substitution
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Reasoning about constants in nominal isabelle or how to formalize the second fixed point theorem
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
Mechanizing the metatheory of mini-XQuery
CPP'11 Proceedings of the First international conference on Certified Programs and Proofs
A locally nameless representation for a natural semantics for lazy evaluation
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
Generalised name abstraction for nominal sets
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
Nominal Isabelle is a definitional extension of the Isabelle/HOL theorem prover. It provides a proving infrastructure for reasoning about programming language calculi involving named bound variables (as opposed to de-Bruijn indices). In this paper we present an extension of Nominal Isabelle for dealing with general bindings, that means term-constructors where multiple variables are bound at once. Such general bindings are ubiquitous in programming language research and only very poorly supported with single binders, such as lambdaabstractions. Our extension includes new definitions of a-equivalence and establishes automatically the reasoning infrastructure for a-equated terms. We also prove strong induction principles that have the usual variable convention already built in.