Refinement types for ML
Tim Freeman, Frank Pfenning · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · 1991
T$'e describe a refinement of ML's type system allowing the specification of recursively defined subtypes of user-defined datatypes.The resulting system of rejirzemeni f,ypes preserves desirable properties of ML such as decidability of type inference, while at the same time allowing more errors to be detected at compile-time.The type system combines abstract interpretation with ideas from the intersection type discipline, but remains closely tied to ML in that refinement types are given only to programs which are already well-typed in ML.
Cited by 424 works. doi:10.1145/113445.113468 Open-access PDF
Authors
References
- Graph-Based Algorithms for Boolean Function Manipulation
- Symbolic model checking: 1020 States and beyond
- On understanding types, data abstraction, and polymorphism
- F-bounded polymorphism for object-oriented programming
- A simple applicative language: mini-ML
- A decision procedure for a class of set constraints
- Type reconstruction in the presence of polymorphic recursion
- Principal type scheme and unification for intersection type discipline