A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
Filters
Mechanising Hankin and Barendregt using the Gordon-Melham axioms
2003
Proceedings of the 2003 workshop on Mechanized reasoning about languages with variable binding - MERLIN '03
Preserved Fulltext
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 ...
The mechanisation features the use of the Gordon-Melham axioms for α-equivalent terms, and demonstrates those axioms' effectiveness and utility. ...
doi:10.1145/976571.976577
dblp:conf/icfp/Norrish03
fatcat:y4nugdgk5ff4tahj6homx7ti4u
Mechanising λ-calculus using a classical first order theory of terms with permutations
2006
Higher-Order and Symbolic Computation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
The issues in mechanising pen-and-paper proofs are discussed; in particular, those difficulties arising from the sources' use of the Barendregt Variable Convention. ...
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. ...
, both for discussions about standardisation and adequacy, and for the excellent working conditions at his recent "Binding Challenges" workshop. ...
doi:10.1007/s10990-006-8745-7
fatcat:u5jw53nhljcj5cd4tpkmmrclpu