Skip navigation
Skip navigation

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

Norrish, Michael


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 sta

CollectionsANU Research Publications
Date published: 2006
Type: Journal article
Source: Higher-Order and Symbolic Computation
DOI: 10.1007/s10990-006-8745-7


File Description SizeFormat Image
01_Norrish_Mechanising_lambda-calculus_2006.pdf293.3 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator