Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 424

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Refinement types for ML

Open access
Freeman, Tim, Pfenning, Frank · 1991 · Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation - PLDI '91

Abstract

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/113445.113468

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 4 references

Cited by

See all 424

Metadata

Authors
Freeman, T., & Pfenning, F.
Venue
Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation - PLDI '91
Publisher
ACM Press
Published
1991
Volume
26
Issue
6
Pages
268-277
ISSN
1531-7102 (ISSN-L)
OpenAlex
W191500592
Cited by
424
References
4
FWCI
5.15
Type
conference paper
Language
en
Open access
bronze

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Refinement types for ML. https://app.cochat.ai/papers/10.1145/113445.113468
The paper
Freeman, T., & Pfenning, F. (1991). Refinement types for ML. Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation - PLDI '91. https://doi.org/10.1145/113445.113468

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.