PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Proofs and types
A Formalization of the Strong Normalization Proof for System F in LEGO
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Higher-Order Abstract Syntax in Coq
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
A Mechanisation of Name-Carrying Syntax up to Alpha-Conversion
HUG '93 Proceedings of the 6th International Workshop on Higher Order Logic Theorem Proving and its Applications
Five Axioms of Alpha-Conversion
TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
A Full Formalisation of pi-Calculus Theory in the Calculus of Constructions
TPHOLs '97 Proceedings of the 10th International Conference on Theorem Proving in Higher Order Logics
The machine-assisted proof of programming language properties
The machine-assisted proof of programming language properties
Nominal logic, a first order theory of names and binding
Information and Computation - TACS 2001
Theoretical Computer Science
Defining functions on equivalence classes
ACM Transactions on Computational Logic (TOCL)
Isabelle/HOL: a proof assistant for higher-order logic
Isabelle/HOL: a proof assistant for higher-order logic
Mechanized metatheory for the masses: the PoplMark challenge
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Scrap your nameplate: (functional pearl)
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
A formal treatment of the barendregt variable convention in rule inductions
Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
ACM SIGACT News
Alpha-structural recursion and induction
Journal of the ACM (JACM)
Mechanising λ-calculus using a classical first order theory of terms with permutations
Higher-Order and Symbolic Computation
A Logic for Reasoning about Generic Judgments
Electronic Notes in Theoretical Computer Science (ENTCS)
A Head-to-Head Comparison of de Bruijn Indices and Names
Electronic Notes in Theoretical Computer Science (ENTCS)
Nominal Reasoning Techniques in Coq
Electronic Notes in Theoretical Computer Science (ENTCS)
Mechanical verification of refactorings
PEPM '08 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
The design and implementation of typed scheme
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Formalising in Nominal Isabelle Crary's Completeness Proof for Equivalence Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
Nominal Techniques in Isabelle/HOL
Journal of Automated Reasoning
ACM Transactions on Programming Languages and Systems (TOPLAS)
Parametric higher-order abstract syntax for mechanized semantics
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
Barendregt's Variable Convention in Rule Inductions
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Implementing Spi Calculus Using Nominal Techniques
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Revisiting Cut-Elimination: One Difficult Proof Is Really a Proof
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Mechanising a Proof of Craig's Interpolation Theorem for Intuitionistic Logic in Nominal Isabelle
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
The Abella Interactive Theorem Prover (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
A Compiled Implementation of Normalization by Evaluation
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Reasoning in Abella about Structural Operational Semantics Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Higher-order abstract syntax in classical higher-order logic
Proceedings of the Fourth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
Formal SOS-Proofs for the Lambda-Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Proof search specifications of bisimulation and modal logics for the π-calculus
ACM Transactions on Computational Logic (TOCL)
A verified compiler for an impure functional language
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Formalising the π-calculus using nominal logic
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
A mechanized model of the theory of objects
FMOODS'07 Proceedings of the 9th IFIP WG 6.1 international conference on Formal methods for open object-based distributed systems
Proof pearl: de Bruijn terms really do work
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Composing safely: a type system for aspects
SC'08 Proceedings of the 7th international conference on Software composition
Mechanizing the metatheory of LF
ACM Transactions on Computational Logic (TOCL)
General bindings and alpha-equivalence in nominal Isabelle
ESOP'11/ETAPS'11 Proceedings of the 20th European conference on Programming languages and systems: part of the joint European conferences on theory and practice of software
Recursion principles for syntax with bindings and substitution
Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Broadcast psi-calculi with an application to wireless protocols
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Structured induction proofs in isabelle/isar
MKM'06 Proceedings of the 5th international conference on Mathematical Knowledge Management
Journal of Automated Reasoning
A recursion combinator for nominal datatypes implemented in Isabelle/HOL
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Partial recursive functions in higher-order logic
IJCAR'06 Proceedings of the Third international joint conference on Automated Reasoning
Alpha-structural recursion and induction
TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Checking conservativity of overloaded definitions in higher-order logic
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
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
GMETA: a generic formal metatheory framework for first-order representations
ESOP'12 Proceedings of the 21st European conference on Programming Languages and Systems
Automatically generated infrastructure for de bruijn syntaxes
ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving
| Hi-index | 0.00 |
In this paper we define an inductive set that is bijective with the α-equated lambda-terms. Unlike de-Bruijn indices, however, our inductive definition includes names and reasoning about this definition is very similar to informal reasoning on paper. For this we provide a structural induction principle that requires to prove the lambda-case for fresh binders only. The main technical novelty of this work is that it is compatible with the axiom-of-choice (unlike earlier nominal logic work by Pitts et al); thus we were able to implement all results in Isabelle/HOL and use them to formalise the standard proofs for Church-Rosser and strong-normalisation.