Abstract types have existential type
@article{Mitchell1988AbstractTH, title={Abstract types have existential type}, author={J. Mitchell and G. Plotkin}, journal={ACM Trans. Program. Lang. Syst.}, year={1988}, volume={10}, pages={470-502} }
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… CONTINUE READING
Figures and Topics from this paper
Figures
368 Citations
References
SHOWING 1-7 OF 7 REFERENCES
A Kernel Language for Abstract Data Types and Modules
- Computer Science
- Semantics of Data Types
- 1984
- 130
- Highly Influential
Towards a theory of type structure
- Physics, Computer Science
- Symposium on Programming
- 1974
- 1,000
- Highly Influential
- PDF
Constructive mathematics and computer programming. Paper presented at The 6th International Congress for Logic, Methodology and Philosophy of Science
- Preprint, Univ. of Stockholm, Dept. of Mathematics, Stockholm,
- 1979
Interpretation fonctionelle et elimination des coupures dans l'aritmetique d'ordre superieur
- Computer Science
- 1972
- 744
- Highly Influential
- PDF
An informal introduction to specification using CLEAR
- In The Correctness Problem in Computer Science,
- 1981