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

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

Abstract types have existential type

Open access
Mitchell, John C., Plotkin, Gordon D.·1988·ACM Transactions on Programming Languages and Systems
DOI 10.1145/44501.45065
Open this paper in CoChat — free account

Abstract

Abstract data type declarations appear in typed programming languages like Ada, Alphard, CLU and ML. This form of declaration binds a list of identifiers to a type with associated operations, a composite “value” we call a data algebra . We use a second-order typed lambda calculus SOL to show how data algebras may be given types, passed as parameters, and returned as results of function calls. In the process, we discuss the semantics of abstract data type declarations and review a connection between typed programming languages and constructive logic.

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/44501.45065

Cites

1 of 1 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 1 references

Cited by

See all 429

Metadata

Authors
Mitchell, J. C., & Plotkin, G. D.
Venue
ACM Transactions on Programming Languages and Systems
Publisher
Association for Computing Machinery (ACM)
Published
1988-07
Volume
10
Issue
3
Pages
470-502
ISSN
  • 0164-0925 (ISSN-L)
  • 1558-4593
DOI
10.1145/44501.45065
OpenAlex
W2104204098
Cited by
429
References
1
Type
conference abstract
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: Abstract types have existential type. https://app.cochat.ai/papers/10.1145/44501.45065
The paper
Mitchell, J. C., & Plotkin, G. D. (1988). Abstract types have existential type. ACM Transactions on Programming Languages and Systems. https://doi.org/10.1145/44501.45065

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.