Type inference in polymorphic type discipline

DOI10.1007/3-540-54415-1_39zbMath1493.68086OpenAlexW1548645459MaRDI QIDQ5096210

Paola Giannini, Simonetta Ronchi della Rocca

Publication date: 16 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-54415-1_39

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)

Related Items

Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca, Type reconstruction in finite rank fragments of the second-order \(\lambda\)-calculus, Typability and type checking in System F are equivalent and undecidable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The lambda calculus. Its syntax and semantics. Rev. ed.
• Principal type scheme and unification for intersection type discipline
• Polymorphic type inference and containment
• A type inference algorithm for a stratified polymorphic type discipline
• On the logic of unification
• A Machine-Oriented Logic Based on the Resolution Principle
• The Principal Type-Scheme of an Object in Combinatory Logic
• Modified basic functionality in combinatory logic