Higher-Order and Symbolic Computation

, Volume 19, Issue 2, pp 169–195

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


DOI: 10.1007/s10990-006-8745-7

Cite this article as:
Norrish, M. Higher-Order Symb Comput (2006) 19: 169. doi:10.1007/s10990-006-8745-7


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.

Copyright information

© Springer Science + Business Media, LLC 2006

Authors and Affiliations

  1. 1.Canberra Research Laboratory, National ICT Australia, Research School of Information Science and EngineeringAustralian National UniversityAustralia