Skip to main content

A calculus for the mathematical theory of computation

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

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

  • 2056 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

  1. Floyd, R.W., Assigning Meanings to Programs. Proceedings of a Symposium in Applied Mathematics, Vol. 19, pp. 19–32 (ed. Schwartz, J.T.) Providence, R.I., Amer. Math. Soc. 1967.

    Google Scholar 

  2. Good, D.I. and Ragland, L.C., NUCLEUS — A Language for Provable Programs, Proceedings of SIGPLAN Symposium on Computer Program Test Methods, Prentice Hall, 1972 (to appear)

    Google Scholar 

  3. Hoare, C.A.R., An Axiomatic Basis for Computer Programming. Comm. ACM, Vol. 12, No. 10, October 1969, pp. 576–580, 583.

    Google Scholar 

  4. Igarashi, S., Semantics of ALGOL-like Statements. AI Memo No. 129, Stanford University, 1970.

    Google Scholar 

  5. Igarashi, S,, London, R.L. and Luckham, D.C., Interactive Program Verification: A Logical System and its Implementation. AI Memo, Stanford University, 1972 (to appear)

    Google Scholar 

  6. Kaplan, D.M., A Formal Theory Concerning the Equivalence of Algorithms. AI Memo No. 59, Stanford University, 1968.

    Google Scholar 

  7. Landin, P.J., The Next 700 Programming Languages. Comm. ACM, Vol. 9, No. 3, March 1966, pp. 157–166.

    Google Scholar 

  8. McCarthy, J., A Basis for the Mathematical Theory of Computation. Computer Programming and Formal Systems, pp. 33–70, (eds. Braffort, P. and Hirschberg, D.) Amsterdam, North-Holland, 1963.

    Google Scholar 

  9. Manna, Z., The Correctness of Programs. JCSS Vol. 3, pp. 119–127, 1969.

    Google Scholar 

  10. Milner, R., Logic for Computable Functions; Description of a Machine Implementation. AI Memo No. 169, Stanford University, 1972.

    Google Scholar 

  11. Milner, R., Implementation and Applications of Scott's Logic for Computable Functions. Proc. ACM Conference on Proving Assertions about Programs, New Mexico, State University, pp. 1–6 1972.

    Google Scholar 

  12. Milner, R. and Weyrauch, R.W., Proving Compiler Correctness in a Mechanized Logic. Machine Intelligence 7, Edinburgh University Press, 1972 (to appear)

    Google Scholar 

  13. Scott, D.S., Continuous Lattices, Proc. 1971 Dalhousie Conference, Lecture Notes in Mathematics, Springer-Verlag, Heidelberg.

    Google Scholar 

  14. Scott, D.S. and Strachey, C., Towards a Mathematical Semantics for Computer Languages. Proc. Symposium on Computers and Automata, Microware Research Institute, Symposia Series, Vol. 21, Polytechnic Institute of Brooklyn, 1971.

    Google Scholar 

  15. Weyrauch, R.W. and Milner, R., Program Semantics and Correctness in a Mechanized Logic. Proc. USA-Japan Computer Conference, Tokyo, October 1972 (to appear)

    Google Scholar 

Download references

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

Milner, R. (1974). A calculus for the mathematical theory of computation. 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_21

Download citation

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

  • 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