Skip to main content

Initialisation with a final value, an exercise in program transformation

  • Contributed Lectures
  • Conference paper
  • First Online:
Mathematics of Program Construction (MPC 1989)

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

Included in the following conference series:

  • 154 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. J. de Bakker: Mathematical theory of program correctness. Prentice-Hall International, 1980.

    Google Scholar 

  2. W.H. Hesselink: An algebraic calculus of commands (WHH 13). Tech. Rep. CS 8808, Groningen University 1988.

    Google Scholar 

  3. W.H. Hesselink: Command algebras, recursion and program transformation (WHH 36). Tech. Rep. CS 8812, Groningen University 1988.

    Google Scholar 

  4. W.H. Hesselink: Command algebras with unbounded choice (WHH 47). Draft, 1989.

    Google Scholar 

  5. Z. Manna: Mathematical theory of computation. McGraw-Hill Book Company 1974.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

J. L. A. van de Snepscheut

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hesselink, W.H. (1989). Initialisation with a final value, an exercise in program transformation. In: van de Snepscheut, J.L.A. (eds) Mathematics of Program Construction. MPC 1989. Lecture Notes in Computer Science, vol 375. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51305-1_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-51305-1_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46191-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics