[go: up one dir, main page]

Skip to main content

Retrospective and Prospective for Unifying Theories of Programming

  • Conference paper
Unifying Theories of Programming (UTP 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4010))

Included in the following conference series:

Abstract

This paper presents a personal account of developments leading to Unifying Theories of Programming, and some opinions about the direction the work should take in the future. It also speculates on consequences the work will have for all of computer science.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Back, R.-J.R., von Wright, J.: Refinement Calculus: a Systematic Introduction. Springer, Heidelberg (1998)

    MATH  Google Scholar 

  2. Caspi, P., Halbwachs, N., Pilaud, D., Plaice, J.A.: LUSTRE: a declarative language for programming synchronous systems. In: 14th ACM Symposium on Principles of Programming Languages, pp. 178–189 (1987)

    Google Scholar 

  3. Dijkstra, E.W.: A Discipline of Programming. Prentice-Hall, Englewood Cliffs (1976)

    MATH  Google Scholar 

  4. Hayes, I.J.: Reasoning about real-time repetitions, terminating and nonterminating. Science of Computer Programming 43(2-3), 161–192 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Hehner, E.C.R., Gravell, A.M.: Refinement semantics and loop rules. In: Woodcock, J.C.P., Davies, J., Wing, J.M. (eds.) FM 1999. LNCS, vol. 1709, pp. 1497–1510. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. Hehner, E.C.R.: A Practical Theory of Programming, 1st edn. Springer, Heidelberg (1993), www.cs.utoronto.ca/~hehner/aPToP

    MATH  Google Scholar 

  7. Hehner, E.C.R.: Probabilistic predicative programming. In: Kozen, D. (ed.) MPC 2004. LNCS, vol. 3125, pp. 169–185. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  8. Hehner, E.C.R.: Termination is timing. In: van de Snepscheut, J.L.A. (ed.) MPC 1989. LNCS, vol. 375, pp. 36–47. Springer, Heidelberg (1989)

    Google Scholar 

  9. Hehner, E.C.R.: Real-time programming. Information Processing Letters 30, 51–56 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  10. Hehner, E.C.R., Malton, A.J.: Termination conventions and comparative semantics. Acta Informatica 25, 1–14 (1988)

    Article  MathSciNet  MATH  Google Scholar 

  11. Hehner, E.C.R.: Predicative programming. Communications ACM 27(2), 134–151 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hehner, E.C.R.: The Logic of Programming. In: Hoare, C.A.R. (ed.). International Series in Computer Science. Prentice-Hall, Englewood Cliffs (1984)

    Google Scholar 

  13. Hehner, E.C.R., Hoare, C.A.R.: A more complete model of communicating processes. Theoretical Computer Science 26, 105–120 (1983); Also as University of Toronto Technical Report CSRG-134 (September 1981)

    Article  MathSciNet  MATH  Google Scholar 

  14. Hehner, E.C.R.: Do considered od: a contribution to the programming calculus. Acta Informatica 11, 287–304 (1979)

    Article  MATH  Google Scholar 

  15. Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice-Hall, Englewood Cliffs (1998)

    Google Scholar 

  16. Hoare, C.A.R.: An axiomatic basis for computer programming. Communications ACM 12(10), 576–580, 583 (1969)

    Article  MATH  Google Scholar 

  17. Hoare, C.A.R.: A proof of correctness of data representations. Acta Informatica 1(4), 271–282 (1972)

    Article  MATH  Google Scholar 

  18. Morgan, C.C., McIver, A.K., Seidel, K., Sanders, J.W.: Probabilistic predicate transformers. ACM Transactions on Programming Languages and Systems 18(3), 325–353 (1996)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hehner, E. (2006). Retrospective and Prospective for Unifying Theories of Programming. In: Dunne, S., Stoddart, B. (eds) Unifying Theories of Programming. UTP 2006. Lecture Notes in Computer Science, vol 4010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11768173_1

Download citation

  • DOI: https://doi.org/10.1007/11768173_1

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-34752-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics