The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Abstract types have existential type
Open accessAbstract
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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Categories for the Working Mathematician
Lane, S. M. (1971) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-9839-7 · Cited by 8,817
The Lambda Calculus - Its Syntax and Semantics
(1984) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/c2009-0-14341-6 · Cited by 2,787
Grätzer, G. (1968) · Cited by 2,320
Implementing Mathematics with The Nuprl Proof Development System
Constable, R. L., Allen, S. F., Bromley, H. M., Cleaveland, W. R., Cremer, J. F., Harper, R. W., Howe, D. J., Knoblock, T. B., Mendler, N. P., Panangaden, P., et al. (1986) · Cited by 1,279
Coquand, T., & Huet, G. (1988) · Information and Computation · doi:10.1016/0890-5401(88)90005-3 · Cited by 1,082
To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus, and Formalism
Curry, H. B., Hindley, J. R., & Seldin, J. P. (1980) · Academic Press eBooks · Cited by 924
Towards a theory of type structure
Reynolds, J. C. (1974) · Lecture Notes in Computer Science · doi:10.1007/3-540-06859-7_148 · Cited by 815
Types, Abstraction and Parametric Polymorphism.
Reynolds, J. (1983) · IFIP Congress · Cited by 754
Herrlich, H. (1979) · Cited by 690
Cited by
How to make ad-hoc polymorphism less ad hoc
Wadler, P., & Blott, S. (1989) · Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89 · doi:10.1145/75277.75283 · Cited by 773
From system F to typed assembly language
Morrisett, G., Walker, D., Crary, K., & Glew, N. (1999) · ACM Transactions on Programming Languages and Systems · doi:10.1145/319301.319345 · Cited by 584
Computational interpretations of linear logic
Abramsky, S. (1993) · Theoretical Computer Science · doi:10.1016/0304-3975(93)90181-r · Cited by 409
Advanced Topics in Types and Programming Languages
(2004) · The MIT Press eBooks · doi:10.7551/mitpress/1104.001.0001 · Cited by 348
Separation logic and abstraction
Parkinson, M., & Bierman, G. (2005) · Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/1040305.1040326 · Cited by 309
Compiling polymorphism using intensional type analysis
Harper, R., & Morrisett, G. (1995) · Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '95 · doi:10.1145/199448.199475 · Cited by 295
A type-theoretic approach to higher-order modules with sharing
Harper, R., & Lillibridge, M. (1994) · Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94 · doi:10.1145/174675.176927 · Cited by 287
From system F to typed assembly language
Morrisett, G., Walker, D., Crary, K., & Glew, N. (1998) · Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '98 · doi:10.1145/268946.268954 · Cited by 282
A history of Haskell: being lazy with class
Hudak, P., Hughes, J., Peyton Jones, S., & Wadler, P. (2007) · Proceedings of the third ACM SIGPLAN conference on History of programming languages · doi:10.1145/1238844.1238856 · Cited by 261
Manifest types, modules, and separate compilation
Leroy, X. (1994) · Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '94 · doi:10.1145/174675.176926 · Cited by 257
Using parameterized signatures to express modular structure
Jones, M. P. (1996) · Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '96 · doi:10.1145/237721.237731 · Cited by 57
Metadata
- Authors
- Mitchell, J. C., & Plotkin, G. D.
- Venue
- ACM Transactions on Programming Languages and Systems
- Published
- 1988-07
- Volume
- 10
- Issue
- 3
- Pages
- 470-502
- ISSN
- 0164-0925 (ISSN-L)
- 1558-4593
- OpenAlex
- W2104204098
- Cited by
- 429
- References
- 29
- 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
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.