Abstract
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.
Chapter PDF
Similar content being viewed by others
References
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.
A. Church, "A formulation of the simple theory of types", Journal of Symbolic Logic, v5 (1940), pp56–68.
Yeung, PhD thesis, Queen Mary College, London, 1976.
Dana Scott, "Data types as lattices", SIAM Journal on Computing, v5 (1976), pp522–587.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shamir, A., Wadge, W.W. (1977). Data types as objects. In: Salomaa, A., Steinby, M. (eds) Automata, Languages and Programming. ICALP 1977. Lecture Notes in Computer Science, vol 52. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08342-1_36
Download citation
DOI: https://doi.org/10.1007/3-540-08342-1_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08342-9
Online ISBN: 978-3-540-37305-6
eBook Packages: Springer Book Archive