Towards more flexible type systems

  • James H. MorrisJr.
Semantique Formelle Formal Semantics
Part of the Lecture Notes in Computer Science book series (LNCS, volume 19)


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.


Type System Language Designer Class Element Sparse Array Recursive Type 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Dahl, O.J., and Hoare, C.A.R., Hierarchical Program Structure, in Structured Programming, Dahl, Dijkstra, Hoare (eds.), Academic Press, 1972.Google Scholar
  2. [2]
    Morris, J.H., Protection in Programming Languages, Comm ACM, 16 (1), January 1973.Google Scholar
  3. [3]
    Morris, J.H., Types Are Not Sets, Proc. ACM Symposium on Principles of Programming Languages, Boston, 1973, pp 120–124.Google Scholar
  4. [4]
    Reynolds, J.C., Towards a Theory of Type Structure, Proceedings of Colloque sur la Programmation, (this volume), Paris, 1974.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1974

Authors and Affiliations

  • James H. MorrisJr.
    • 1
  1. 1.Xerox Palo Alto Research CenterUSA

Personalised recommendations