Linear realizability and full completeness for typed lambda-calculi (Q556821)

From MaRDI portal
Revision as of 11:47, 10 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Linear realizability and full completeness for typed lambda-calculi
scientific article

    Statements

    Linear realizability and full completeness for typed lambda-calculi (English)
    0 references
    0 references
    0 references
    23 June 2005
    0 references
    Typed lambda-calculi
    0 references
    ML-polymorphic types
    0 references
    Linear logic
    0 references
    Hyperdoctrines
    0 references
    PER models
    0 references
    Geometry of Interaction
    0 references
    (Axiomatic) Full completeness
    0 references

    Identifiers