Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T08:11:04.866Z Has data issue: false hasContentIssue false

A lambda calculus with naive substitution

Published online by Cambridge University Press:  09 April 2009

John Staples
Affiliation:
Department of Mathematics and Computer Science Queensland Institute of TechnologyG.P.O. Box 2434 Brisbane 4001, Australia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

An alternative approach is proposed to the basic definitions of the lassical lambda calculus. A proof is sketched of the equivalence of the approach with the classical case. The new formulation simplifies some aspects of the syntactic theory of the lambda calculus. In particular it provides a justification for omitting in syntactic theory discussion of changes of bound variable.

Information

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1979