Skip to main content

A formal approximation theory of semantic data types

  • Conference paper
  • First Online:
International Symposium on Theoretical Programming

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

  • 1945 Accesses

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Birkhoff,G.: Lattice Theory,AMS Colloquim Fublication Volume XXV (1961)

    Google Scholar 

  • Cohen,P.J.: Set Theory and the Continuum Hypothesis, Benjamin(1966)

    Google Scholar 

  • Ito,T.: Some formal properties of a class of program schemata, IEEE Symposium on Switching and Automata Theory(1968)

    Google Scholar 

  • Ito,T.: A theory of formal microprograms,NATO Advanced Study Institute on Microprogramming(1971) (This is based on the author's unpublished memo of 1967 entitled "On certain representations of algorithms I,II")

    Google Scholar 

  • Ito,T.: Mathematical theory of programs and its applications, Journal of IEE in Japan,vol.91,no.8(1971) (in Japanese)

    Google Scholar 

  • McCarthy,J.: Toward a mathematical science of computation, Proc. IFIP'62(1963)

    Google Scholar 

  • Scott,D.: Outline of a mathematical theory of computation, Proc. Fourth Annual Princeton Conference on Information Sciences and Systems(1970)

    Google Scholar 

  • Scott,D.: The lattice of flow diagrams, Symposium on Semantics of Algorithmic Languages, Lecture notes in mathematics,vol.188, Springer-Verlag(1971)

    Google Scholar 

  • Scott,D. and C. Strachey: Towards a Mathematical Semantics of Computer Languages, Proc. of the Symposium on Computers and Automata, Microwave Research Institute Series Volume 21, Polytechnic Institute of Brooklyn(1972)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Andrei Ershov Valery A. Nepomniaschy

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ito, T. (1974). A formal approximation theory of semantic data types. In: Ershov, A., Nepomniaschy, V. (eds) International Symposium on Theoretical Programming. Lecture Notes in Computer Science, vol 5. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-06720-5_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-06720-5_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06720-7

  • Online ISBN: 978-3-540-38012-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics