Data types as objects
In this paper we present a new approach to the semantics of data types, in which the types themselves are incorporated as elements in the domain of data objects. The approach allows types to have subtypes, allows genuinely polymorphic functions, and gives a precise semantics for recursive type definitions (including definitions with parameters). In addition, the approach yields simple and straight forward methods for proving type properties of recursive definitions. These methods include a new fixedpoint rule which permits case analysis.
- 1.R. Milner, L. Morris and M. Newey, "A logic for computable functions with reflexive and polymorphic types", proceedings of the Symposium on Proving and Improving Programs, Arc et Senans 1975, pp371–394.Google Scholar
- 2.A. Church, "A formulation of the simple theory of types", Journal of Symbolic Logic, v5 (1940), pp56–68.Google Scholar
- 3.Yeung, PhD thesis, Queen Mary College, London, 1976.Google Scholar
- 4.Dana Scott, "Data types as lattices", SIAM Journal on Computing, v5 (1976), pp522–587.Google Scholar