Type theories, normal forms, and \(D_{\infty}\)-lambda-models (Q1102936): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Mario Coppo / rank
Normal rank
 
Property / author
 
Property / author: Maddalena Zacchi / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Q593640 / rank
Normal rank
 
Property / author
 
Property / author: Mario Coppo / rank
 
Normal rank
Property / author
 
Property / author: Maddalena Zacchi / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Cristian Masalagiu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0890-5401(87)90042-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1979206410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221960 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A filter lambda model and the completeness of type assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: The lambda calculus. Its syntax and semantics. Rev. ed. / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\lambda\)-calculus and computer science theory. Proceedings of the symposium held in Rome, March 25-27, 1975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new type assignment for λ-terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198724 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional Characters of Solvable Terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3036694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatory logic. With two sections by William Craig. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3043110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3345747 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lambda‐Calculus Models and Extensionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The completeness theorem for typing lambda-terms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: What is a model of the lambda calculus? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4163188 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5649639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Types as Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3959414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinators, \(\lambda\)-terms and proof theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intensional interpretations of functionals of finite type I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus / rank
 
Normal rank

Latest revision as of 16:19, 18 June 2024

scientific article
Language Label Description Also known as
English
Type theories, normal forms, and \(D_{\infty}\)-lambda-models
scientific article

    Statements

    Type theories, normal forms, and \(D_{\infty}\)-lambda-models (English)
    0 references
    0 references
    0 references
    1987
    0 references
    The study of a special filter model for the \(\lambda\)-calculus (in the sense of H. Barendregt), denoted \({\mathcal F}^*\), is the main objective of this paper. The type assignement system, on which the definition of \({\mathcal F}^*\) is based, is the classical Curry's type assignement to which \(\omega\) (the universal type), the operator \(\Lambda\) (intersection) - for type formation, and an ``inclusion'' relation on types are added. Much more, the initial set of atomic types is a two- element set. It is proved that \({\mathcal F}^*\) is isomorphic with an inverse limit space \(D^*_{\infty}\) constructed from a (three point) lattice with a nonstandard initial projection, which is not (Hilbert- Post) complete. A nice characterization (the first purely semantic one?) for a term to be normalizable is also given.
    0 references
    normalizable term
    0 references
    filter model
    0 references
    \(\lambda \)-calculus
    0 references
    type assignement
    0 references

    Identifiers