Abstract
Loopholes and dynamic checking are expedient solutions to making type systems flexible and should be eschewed by language designers who are not in too much of a hurry. I have tried to show that careful design of primitives can make present type systems more viable and that some progress is being made towards improving type systems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliography
Dahl, O.J., and Hoare, C.A.R., Hierarchical Program Structure, in Structured Programming, Dahl, Dijkstra, Hoare (eds.), Academic Press, 1972.
Morris, J.H., Protection in Programming Languages, Comm ACM, 16 (1), January 1973.
Morris, J.H., Types Are Not Sets, Proc. ACM Symposium on Principles of Programming Languages, Boston, 1973, pp 120–124.
Reynolds, J.C., Towards a Theory of Type Structure, Proceedings of Colloque sur la Programmation, (this volume), Paris, 1974.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1974 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morris, J.H. (1974). Towards more flexible type systems. In: Robinet, B. (eds) Programming Symposium. Lecture Notes in Computer Science, vol 19. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-06859-7_146
Download citation
DOI: https://doi.org/10.1007/3-540-06859-7_146
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-06859-4
Online ISBN: 978-3-540-37819-8
eBook Packages: Springer Book Archive