Journal of Symbolic Logic

Minimal Forms in $\lambda$-Calculus Computations

Corrado Bohm and Silvio Micali

Full-text is available via JSTOR, for JSTOR subscribers. Go to this article in JSTOR.

Abstract

The notion of a minimal form is defined as an extension of the notion of a normal form in $\lambda-\beta$-calculus and its meaning is discussed in a computational environment. The features of the Knuth-Gross reduction strategy are used to prove that to possess a minimal form, for a generic term, is a semidecidable predicate.

Article information

Source
J. Symbolic Logic Volume 45, Issue 1 (1980), 165-171.

Dates
First available in Project Euclid: 6 July 2007

Permanent link to this document
http://projecteuclid.org/euclid.jsl/1183740519

Mathematical Reviews number (MathSciNet)
MR560234

Zentralblatt MATH identifier
0451.03002

JSTOR
links.jstor.org

Citation

Bohm, Corrado; Micali, Silvio. Minimal Forms in $\lambda$-Calculus Computations. J. Symbolic Logic 45 (1980), no. 1, 165--171. http://projecteuclid.org/euclid.jsl/1183740519.


Export citation