Type inference for rank-2 intersection types using set unification

DOI10.1007/978-3-031-17715-6_29OpenAlexW4312379647MaRDI QIDQ6109501

Pedro Ângelo, Mário Florido

Publication date: 28 July 2023

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

Full work available at URL: https://doi.org/10.1007/978-3-031-17715-6_29

zbMATH Keywords

intersection typestype inferenceset unification

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Principal type scheme and unification for intersection type discipline
• An extension of basic functionality theory for \(\lambda\)-calculus
• Principality and type inference for intersection types using expansion variables
• Principal types and unification for simple intersection type systems
• From Polyvariant flow information to intersection and union types
• Example-directed synthesis: a type-theoretic interpretation
• {log}: A language for programming in logic with finite sets
• A filter lambda model and the completeness of type assignment
• Set unification
• Non-idempotent intersection types for the Lambda-Calculus
• Functionality in Combinatory Logic
• Type Inference for Rank 2 Gradual Intersection Types
• Tight typings and split bounds, fully developed
• Elaborating intersection and union types
• A Machine-Oriented Logic Based on the Resolution Principle
• Linearization of the lambda-calculus and its relation with intersection type systems