Proceedings of the ACM on Programming Languages· 2026Q1
Implementing Set-Theoretic Types
- 1citations
- Q1SCImago
- 2026year
Short summary
A new modular representation and optimized algorithms for set-theoretic types enable efficient implementation, overcoming previous adoption barriers.
AI-generated from the title and abstract; the full text is not read.
Key points
- Introduces a modular representation for set-theoretic types.
- Revises and optimizes algorithms for subtyping and tallying.
- Addresses implementation complexity hindering adoption.
- Compares the new approach with the historical CDuce implementation.
AI-generated from the title and abstract; the full text is not read.
Abstract
Set-theoretic types provide a rich type algebra that supports unrestricted unions, intersections, and negations, together with a decidable type constraint-solving algorithm known as tallying. These types are particularly well suited for typing dynamic languages, where functions often exhibit both generic and overloaded behavior. However, the complexity of their implementation has hindered their widespread adoption. In this paper, we introduce a modular representation for set-theoretic types and revisit the algorithms for subtyping and tallying. We compare our approach with the historical CDuce implementation and evaluate the performance impact of some optimizations and design choices.
The authors' abstract, as published at the source. Proceedings of the ACM on Programming Languages, 2026 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Artificial Intelligence
Artificial IntelligenceComputer Science