Mechanising λ-calculus using a classical first order theory of terms with permutations

Authors:
Michael Norrish
Affiliations:
Canberra Research Laboratory, National ICT Australia, Research School of Information Science and Engineering, Australian National University, Australia
Venue:
Higher-Order and Symbolic Computation
Year:
2006

Citing 11
Cited 8

Some Lambda Calculus and Type Theory Formalized

Journal of Automated Reasoning
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
Combining Higher Order Abstract Syntax with Tactical Theorem Proving and (Co)Induction

TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Nominal logic, a first order theory of names and binding

Information and Computation - TACS 2001
Mechanising Hankin and Barendregt using the Gordon-Melham axioms

MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Defining functions on equivalence classes

ACM Transactions on Computational Logic (TOCL)
Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics

TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
Alpha-structural recursion and induction

TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics
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

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
Nominal Techniques in Isabelle/HOL

Journal of Automated Reasoning
Barendregt's Variable Convention in Rule Inductions

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
On the Role of Names in Reasoning about λ-tree Syntax Specifications

Electronic Notes in Theoretical Computer Science (ENTCS)
Proof pearl: de Bruijn terms really do work

TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Mechanised computability theory

ITP'11 Proceedings of the Second international conference on Interactive theorem proving
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes the mechanisation in HOL of some basic 驴-calculus theory. The proofs are taken from standard sources (books by Hankin and Barendregt), and cover: equational theory, reduction theory, residuals, finiteness of developments, and the standardisation theorem. The issues in mechanising pen-and-paper proofs are discussed; in particular, those difficulties arising from the sources' use of the Barendregt Variable Convention.