The complexity of type inference for higher-order typed lambda calculi (Q4764610)

From MaRDI portal
Revision as of 17:35, 29 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article; zbMATH DE number 751115
Language Label Description Also known as
English
The complexity of type inference for higher-order typed lambda calculi
scientific article; zbMATH DE number 751115

    Statements

    The complexity of type inference for higher-order typed lambda calculi (English)
    0 references
    0 references
    0 references
    13 December 1995
    0 references
    complexity of type inference
    0 references
    decidability of type inference
    0 references
    second order polymorphic typed \(\lambda\)-calculus
    0 references
    lower bounds
    0 references
    higher-order extensions
    0 references
    encoding of Turing machines by types
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references