Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

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

Simple item page
dc.contributor.authorNorrish, Michael
dc.date.accessioned2015-12-08T22:17:51Z
dc.date.issued2006
dc.date.updated2015-12-08T08:10:45Z
dc.description.abstractThis 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
dc.identifier.issn1388-3690
dc.identifier.urihttp://hdl.handle.net/1885/31081
dc.publisherSpringer
dc.sourceHigher-Order and Symbolic Computation
dc.subjectKeywords: Combinatorial mathematics; Computational complexity; Numerical methods; Theorem proving; ?-calculus theory; HOL; Standardisation theorem; Differentiation (calculus)
dc.titleMechanising lambda-calculus using a classical first order theory of terms with permutations
dc.typeJournal article
local.bibliographicCitation.issue2-3
local.bibliographicCitation.lastpage195
local.bibliographicCitation.startpage169
local.contributor.affiliationNorrish, Michael, College of Engineering and Computer Science, ANU
local.contributor.authoruidNorrish, Michael, u4087502
local.description.embargo2037-12-31
local.description.notesImported from ARIES
local.identifier.absfor080299 - Computation Theory and Mathematics not elsewhere classified
local.identifier.absfor080203 - Computational Logic and Formal Languages
local.identifier.ariespublicationu8803936xPUB79
local.identifier.citationvolume19
local.identifier.doi10.1007/s10990-006-8745-7
local.identifier.scopusID2-s2.0-33747268056
local.type.statusPublished Version

Downloads

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
01_Norrish_Mechanising_lambda-calculus_2006.pdf
Size:
293.3 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS