Refinement Types for ML

@inproceedings{Freeman1991RefinementTF,
  title={Refinement Types for ML},
  author={Timothy S. Freeman and Frank Pfenning},
  booktitle={PLDI},
  year={1991}
}
We describe a refinement of ML’s type system allowing the specification of recursively defined subtypes of user-defined datatypes. The resulting system of refinement types 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… CONTINUE READING
Highly Influential
This paper has highly influenced 28 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 347 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

347 Citations

0102030'94'99'05'11'17
Citations per Year
Semantic Scholar estimates that this publication has 347 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…