Skip to main content
SpringerLink
Log in

Towards a theory of type structure

  • Semantique Formelle Formal Semantics
  • Conference paper
  • First Online:
Programming Symposium

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 19))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Van Wijngaarden, A., Mailloux, B. J., Peck, J. E. L., and Koster, C. H. A., Report on the Algorithmic Language ALGOL 68. MR 101 Mathematisch Centrum, Amsterdam, October 1969. Also Numerische Mathematik 14 (1969) 79–218.

    Google Scholar 

  2. Cheatham, T. E., Jr., Fischer, A., and Jorrand, P., On the Basis for ELF-An Extensible Language Facility. Proc. AFIPS 1968 Fall Joint Comput. Conf., Vol. 33 Pt. 2, MDI Publications, Wayne, Pa., pp. 937–948.

    Google Scholar 

  3. Reynolds, J. C., A Set-theoretic Approach to the Concept of Type. Working paper, NATO Conf. on Techniques in Software Engineering, Rome, October 1969.

    Google Scholar 

  4. Morris, J. H., "Protection in Programming Languages," Comm. ACM, 16 (1), January 1973.

    Google Scholar 

  5. Morris, J. H., Types are not Sets. Proc. ACM Symposium on Principle of Programming Languages, Boston 1973, pp. 120–124.

    Google Scholar 

  6. Fischer, A. E., and Fischer, M. J., Mode Modules as Representations of Domains. Proc. ACM Symposium on Principles of Programming Languages, Boston 1973, pp. 139–143.

    Google Scholar 

  7. Liskov, B., and Zilles, S., An Approach to Abstraction. Computation Structures Group Memo 88, Project MAC, MIT, September 1973.

    Google Scholar 

  8. Morris, J. H., Lambda-calculus Models of Programming Languages. MAC-TR-57, Project MAC, MIT, Cambridge, Mass., December 1968.

    Google Scholar 

  9. Scott, D., "Outline of a Mathematical Theory of Computation," Proc. Fourth Annual Princeton Conf. on Information Sciences and Systems (1970), pp. 169–176. Also, Tech. Monograph PRG-2, Programming Research Group, Oxford University Computing Laboratory, November 1970.

    Google Scholar 

  10. — "Continuous Lattices," Proc. 1971 Dalhousie Conf., Springer Lecture Note Series, Springer-Verlag, Heidelberg. Also, Tech. Monograph PRG-7, Programming Research Group, Oxford University Computing Laboratory, August 1971.

    Google Scholar 

  11. —. "Mathematical Concepts in Programming Language Semantics," AFIPS Conference Proc., Vol. 40, AFIPS Press, Montvale, New Jersey (1972), pp. 225–234.

    Google Scholar 

  12. —. "Data Types as Lattices", Notes, Amsterdam, June 1972.

    Google Scholar 

  13. MacLane, S., Categories for the Working Mathematician, Springer-Verlag, New York 1971.

    Google Scholar 

  14. Morris, F. L., Correctness of Translations of Programming Languages — An Algebraic Approach, Stanford Computer Science Department Report STAN-CS-72-303, August 1972.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Syracuse University, 13210, Syracuse, New York, USA

    John C. Reynolds

Authors
  1. John C. Reynolds
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Robinet

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reynolds, J.C. (1974). Towards a theory of type structure. 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_148

Download citation

  • DOI: https://doi.org/10.1007/3-540-06859-7_148

  • 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

Publish with us

Policies and ethics

Search

Navigation