Mechanising Hankin and Barendregt using the Gordon-Melham axioms

Authors:
Michael Norrish
Affiliations:
National ICT Australia
Venue:
MERLIN '03 Proceedings of the 2003 ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding
Year:
2003

Citing 5
Cited 3

Some Lambda Calculus and Type Theory Formalized

Journal of Automated Reasoning
Nominal Logic: A First Order Theory of Names and Binding

TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
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
TPHOLs 2000: Supplemental Proceedings

TPHOLs 2000: Supplemental Proceedings

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

Higher-Order and Symbolic Computation
Reasoning about Object-based Calculi in (Co)Inductive Type Theory and the Theory of Contexts

Journal of Automated Reasoning
Mechanized metatheory for the masses: the PoplMark challenge

TPHOLs'05 Proceedings of the 18th international conference on Theorem Proving in Higher Order Logics

Quantified Score

Hi-index	0.00

Visualization

Abstract

I describe the mechanisation in HOL of some basic λ-calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from Chapters 2 and 3 of Hankin [5] (equational theory and reduction theory), followed by most of Chapter 11 of Barendregt [2] (residuals, finiteness of developments, and the standardisation theorem). I discuss the ease of use of the Gordon-Melham axioms, as well as the mechanical support I implemented to make some basic tasks more straightforward.