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 accessAbstract
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.
Integrity signals
Registry
Cites
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.
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
Graph-Based Algorithms for Boolean Function Manipulation
Bryant (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676819 · Cited by 8,891
Symbolic model checking: 1020 States and beyond
Burch, J. R., Clarke, E. M., McMillan, K. L., Dill, D. L., & Hwang, L. J. (1992) · Information and Computation · doi:10.1016/0890-5401(92)90017-a · Cited by 2,703
On understanding types, data abstraction, and polymorphism
Cardelli, L., & Wegner, P. (1985) · ACM Computing Surveys · doi:10.1145/6041.6042 · Cited by 1,669
A simple applicative language: mini-ML
Clément, D., Despeyroux, T., Kahn, G., & Despeyroux, J. (1986) · ACM Conference on LISP and Functional Programming (LFP) · doi:10.1145/319838.319847 · Cited by 159
Cited by
Dependent types in practical programming
Xi, H., & Pfenning, F. (1999) · Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/292540.292560 · Cited by 575
Self-citationDependent types and multi-monadic effects in F*
Swamy, N., Hriţcu, C., Keller, C., Rastogi, A., Delignat-Lavaud, A., Forest, S., Bhargavan, K., Fournet, C., Strub, P.-Y., Kohlweiss, M., et al. (2016) · Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages · doi:10.1145/2837614.2837655 · Cited by 314
Eliminating array bound checking through dependent types
Xi, H., & Pfenning, F. (1998) · Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation · doi:10.1145/277650.277732 · Cited by 284
Self-citationFlanagan, C. (2006) · Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1111037.1111059 · Cited by 265
Smith, C., & Albarghouthi, A. (2016) · Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/2908080.2908102 · Cited by 76
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.