A formalised proof of the soundness and completeness of a simply typed lambda-calculus with explicit substitutions (Q1850959)

From MaRDI portal
Revision as of 11:29, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A formalised proof of the soundness and completeness of a simply typed lambda-calculus with explicit substitutions
scientific article

    Statements

    A formalised proof of the soundness and completeness of a simply typed lambda-calculus with explicit substitutions (English)
    0 references
    0 references
    15 December 2002
    0 references
    0 references
    formal methods
    0 references
    type theory
    0 references
    explicit substitutions
    0 references
    normalisation
    0 references
    0 references