Type Inference for Rank 2 Gradual Intersection Types

DOI10.1007/978-3-030-47147-7_5zbMath1503.68035OpenAlexW3023266506MaRDI QIDQ5098736

Pedro Ângelo, Mário Florido

Publication date: 30 August 2022

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

Full work available at URL: https://doi.org/10.1007/978-3-030-47147-7_5

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (1)

Type inference for rank-2 intersection types using set unification

Uses Software

• ML
• Forsythe
• gradualizerDynamicSemantics

Cites Work

• An extension of basic functionality theory for \(\lambda\)-calculus
• A theory of type polymorphism in programming
• Intersection type assignment systems
• Principality and type inference for intersection types using expansion variables
• Principal Type Schemes for Gradual Programs
• Abstracting gradual typing
• The gradualizer: a methodology and algorithm for generating gradual type systems
• A filter lambda model and the completeness of type assignment
• Semantic subtyping
• Functional Characters of Solvable Terms
• The coherence of languages with intersection types
• Automatically generating the dynamic semantics of gradually typed languages
• A Machine-Oriented Logic Based on the Resolution Principle
• The Principal Type-Scheme of an Object in Combinatory Logic
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Type Inference for Rank 2 Gradual Intersection Types