Type reconstruction in finite rank fragments of the second-order \(\lambda\)-calculus

DOI10.1016/0890-5401(92)90020-GzbMath0753.68022OpenAlexW2074231109MaRDI QIDQ1193590

A. J. Kfoury, Jerzy Tiuryn

Publication date: 27 September 1992

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(92)90020-g

zbMATH Keywords

type inferencetypabilitypolymorphic \(\lambda\)-calculus

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of programming languages (68N15) General topics in the theory of software (68N01) Combinatory logic and lambda calculus (03B40)

Related Items

Higher-Ranked Annotation Polymorphic Dependency Analysis, Strong normalization from weak normalization in typed \(\lambda\)-calculi, Typability and type checking in System F are equivalent and undecidable

Uses Software

• ML
• mini-ML

Cites Work

• Polymorphic type inference and containment
• A theory of type polymorphism in programming
• A new type assignment for λ-terms
• The Expressiveness of Simple and Second-Order Type Structures
• Functional Characters of Solvable Terms
• An analysis of ML typability
• Type inference in polymorphic type discipline
• The Principal Type-Scheme of an Object in Combinatory Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item