The complexity of type inference for higher-order typed lambda calculi (Q4764610): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sequential nature of unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear unification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of type polymorphism in programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3862379 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Principal Type-Scheme of an Object in Combinatory Logic / 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: On the Computational Complexity of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The typed lambda-calculus is not elementary recursive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic and programming languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of a theorem of Statman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantifier elimination and parametric polymorphism in programming languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: The next 700 programming languages / rank
 
Normal rank

Revision as of 12:16, 23 May 2024

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