• DOI:10.1145/44501.45065
Corpus ID: 1222153

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}
}

J. Mitchell, G. Plotkin

Published 1988

Computer Science

ACM Trans. Program. Lang. Syst.

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

View on ACM

crypto.stanford.edu

Save to Library

Create Alert

Cite

Launch Research Feed