Typing untyped \(\lambda\)-terms, or reducibility strikes again! (Q1295368)

From MaRDI portal
Revision as of 11:59, 18 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Typing untyped \(\lambda\)-terms, or reducibility strikes again!
scientific article

    Statements

    Typing untyped \(\lambda\)-terms, or reducibility strikes again! (English)
    0 references
    0 references
    15 February 2000
    0 references
    type assignment
    0 references
    lambda calculus
    0 references
    conjunctive types
    0 references
    normalizable terms
    0 references
    meta-theorems relating properties of \(\lambda\)-terms and their typability
    0 references
    reducibility
    0 references
    weak head-normal forms
    0 references
    realizability method
    0 references

    Identifiers