Arrow Research search
Back to I&C

I&C 1987

Type theories, normal forms, and D∞-lambda-models

Journal Article journal-article Computer Science · Theoretical Computer Science

Abstract

A (non-standard) inverse-limit λ-model D∞ ∗ is constructed which has a non Hilbert-Post complete theory. Moreover, in D∞ ∗, a simple semantic characterization of normalizable terms is given. These results are proved using the properties of a generalized type assignment system which yields a filter model (Barendregt, Coppo, and Dezani-Ciancaglini, 1983, J. Symbolic. Logic, 48, 931–940; Coppo, Dezani-Ciancaglini, Honsell, and Longo, 1983, pp. 241–262, “Logic Colloquium '82, ” North-Holland, Amsterdam), isomorphic to D∞ ∗. The type assignment system is also proved complete with respect to an interpretation of types (in the term model of β-equality) based only on normalization properties. As an application a class of maximal monoids of normalizable terms is characterized.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
Information and Computation
Archive span
1987-2026
Indexed papers
3021
Paper id
807231895490820776
v2026.09.13