Type inference for rank-2 intersection types using set unification

DOI10.1007/978-3-031-17715-6_29MaRDI QIDQ6109501zbMATH OpenOpenAlexFDO

Authors 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 typesset unificationtype inference

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A filter lambda model and the completeness of type assignment
• A Machine-Oriented Logic Based on the Resolution Principle
• An extension of basic functionality theory for -calculus
• Elaborating intersection and union types
• Example-directed synthesis: a type-theoretic interpretation
• From polyvariant flow information to intersection and union types
• Functionality in Combinatory Logic
• scientific article; zbMATH DE number 5852776 (Why is no real title available?)
• scientific article; zbMATH DE number 4051569 (Why is no real title available?)
• scientific article; zbMATH DE number 3700185 (Why is no real title available?)
• scientific article; zbMATH DE number 42059 (Why is no real title available?)
• scientific article; zbMATH DE number 512770 (Why is no real title available?)
• scientific article; zbMATH DE number 1042221 (Why is no real title available?)
• scientific article; zbMATH DE number 1956517 (Why is no real title available?)
• scientific article; zbMATH DE number 1479641 (Why is no real title available?)
• scientific article; zbMATH DE number 6932679 (Why is no real title available?)
• Linearization of the lambda-calculus and its relation with intersection type systems
• Non-idempotent intersection types for the lambda-calculus
• On type inference in the intersection type discipline
• Principal type scheme and unification for intersection type discipline
• Principal types and unification for simple intersection type systems
• Principality and type inference for intersection types using expansion variables
• Set unification
• The algebraic intersection type unification problem
• Tight typings and split bounds, fully developed
• Type Inference for Rank 2 Gradual Intersection Types
• Types and programing languages
• {log}: A language for programming in logic with finite sets

Cited in

(2)

• scientific article; zbMATH DE number 1512611 (Why is no real title available?)
• Type Inference for Rank 2 Gradual Intersection Types

This page was built for publication: Type inference for rank-2 intersection types using set unification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6109501)