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.
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
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
Coquand, T., & Huet, G. (1988) · Information and Computation · doi:10.1016/0890-5401(88)90005-3 · Cited by 1,082
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 985
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
Proceedings of the 30th IEEE symposium on Foundations of computer science
Galil, Z., & Blum, E. K. (1994) · Cited by 677
The next 700 programming languages
Landin, P. J. (1966) · Communications of the ACM · doi:10.1145/365230.365257 · Cited by 578
Ideas and Results in Proof Theory
(1971) · Studies in Logic and the Foundations of Mathematics · doi:10.1016/s0049-237x(08)70849-8 · Cited by 567
Constructive mathematics and computer programming
Martin-Lof, P. (1984) · Philosophical Transactions of the Royal Society of London. Series A, Mathematical and Physical Sciences · doi:10.1098/rsta.1984.0073 · Cited by 499
Girard, J.-Y. (1971) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)70843-7 · Cited by 452
Putting theories together to make specifications
Burstall, R. M., & Goguen, J. A. (1977) · International Joint Conference on Artificial Intelligence · Cited by 420
(1981) · Lecture Notes in Computer Science · doi:10.1007/bfb0035014 · Cited by 296
MacQueen, D. (1984) · Proceedings of the 1984 ACM Symposium on LISP and functional programming - LFP '84 · doi:10.1145/800055.802036 · Cited by 269
Intuitionistic propositional logic is polynomial-space complete
Statman, R. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90006-9 · Cited by 230
Polymorphic type inference and containment
Mitchell, J. C. (1988) · Information and Computation · doi:10.1016/0890-5401(88)90009-0 · Cited by 192
Self-citationLeivant, D. M. (1983) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/567067.567077 · Cited by 182
Polymorphism is not set-theoretic
Reynolds, J. C. (1984) · Lecture Notes in Computer Science · doi:10.1007/3-540-13346-1_7 · Cited by 165
Abstract types have existential types
Mitchell, J. C., & Plotkin, G. D. (1985) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/318593.318606 · Cited by 159
Self-citationUsing dependent types to express modular structure
MacQueen, D. B. (1986) · Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '86 · doi:10.1145/512644.512670 · Cited by 159
Mitchell, J. C., & Harper, R. W. (1988) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/73560.73563 · Cited by 113
Self-citationAn investigation of a programming language with a polymorphic type structure.
McCracken, N. J. (1979) · Cited by 84
Shaw, M. (1981) · Springer eBooks · doi:10.1007/978-1-4612-5979-4 · Cited by 77
The typechecking of programs with implicit type structure
McCracken, N. (1984) · Lecture Notes in Computer Science · doi:10.1007/3-540-13346-1_15 · Cited by 53
Second-order logical relations
Mitchell, J. C., & Meyer, A. R. (1985) · Lecture notes in computer science · doi:10.1007/3-540-15648-8_18 · Cited by 46
Self-citation
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
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.