Skip to main content
Springer Nature Link
Log in

The algebraic theory of recursive program schemes

  • Submitted Abstract
  • Conference paper
  • First Online:
Category Theory Applied to Computation and Control

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

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. de Bakker, J. W., "Recursive procedures," Math. Cent. Tracts 24, Amsterdam, 1971.

    Google Scholar 

  2. de Roever, W.P., "Operational and mathematical semantics for recursive polyadic program schemes," Proceedings, Symposium on Mathematical Foundations of Computer Science, Computing Research Centre, Slovak Academy of Sciences, Bratislava, Czechoslovakia, 1973.

    Google Scholar 

  3. Goguen, J., Thatcher, J., Wagner, E., and Wright, J., "A junction between computer science and category theory," I,II Basic definitions and examples; III,IV Algebraic theories and structures; V Initial factorizations and dummy variables. IBM Research Reports: I Part 1, RC-4526, September 1973; others to appear.

    Google Scholar 

  4. Landin, P. J., "The mechanical evaluation of expressions," Comput. J. 6 (1964) 308–320.

    Google Scholar 

  5. Lawvere, F. W., "Functorial semantics for algebraic theories," Proceedings, Nat'l Acad. Sci. 50 (1963) 869–872.

    Article  MathSciNet  Google Scholar 

  6. Mac Lane, S., Category Theory for the Working Mathematician, Springer-Verlag, 1971.

    Google Scholar 

  7. Nivat, M., "Languages algebriques sur le magma libre et semantigue des schemas de programme," in Automata, Languages and Programming (M. Nivat, ed.) North Holland (1972) 293–308).

    Google Scholar 

  8. Scott, D., "The lattice of flow diagrams," Oxford University Computing Laboratory Technical Monograph PRG-3, 1970.

    Google Scholar 

  9. Scott, D. and Strachey, C., "Towards a mathematical semantics for computer languages," Proceedings, Symposium on Computers and Automata, Polytechnic Institute of Brooklyn 21, 1971.

    Google Scholar 

  10. van Wijngaardsn, A. (ed.) "Report on the algorithmic language ALGOL 68." Math. Cent. Report MR 101, Amsterdam, 1969.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Machine Intelligence, Edinburgh University, Edinburgh, Scotland

    R. M. Burstall

  2. Mathematical Sciences Department, IBM T. J. Watson Research Center, Yorktown Heights, New York

    J. W. Thatcher

Authors
  1. R. M. Burstall
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. W. Thatcher
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ernest Gene Manes

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Burstall, R.M., Thatcher, J.W. (1975). The algebraic theory of recursive program schemes. In: Manes, E.G. (eds) Category Theory Applied to Computation and Control. Lecture Notes in Computer Science, vol 25. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07142-3_71

Download citation

  • DOI: https://doi.org/10.1007/3-540-07142-3_71

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07142-6

  • Online ISBN: 978-3-540-37426-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics