Skip to main content

Conclusions

  • Chapter
A Science of Operations

Part of the book series: History of Computing ((HC))

  • 2215 Accesses

Abstract

The overarching theme of this book has been the story of how computational agency has, over a period of several centuries, migrated from humans to machines. This migration brought with it the need to find a new kind of language, one which was adequate to express computational processes in such a way that they could be carried out mechanically. To begin with, mathematical logic only formalized the language of imperative statements and proof, however, and it was not until the mid-1930s that completely formal notations for the expression of algorithms and computational processes were developed. These particular notations turned out not to be ideally suited for use with the technology of automatic computation that was emerging in the same period, however, and several decades were to pass before developments converged on a stable set of basic concepts and ideas. It is a central proposal of this book that this convergence was the achievement of the Algol research programme, the tradition of work that was inspired by the Algol 60 language proposals and culminated in the widespread adoption of the ideas about programming notation associated with the term ‘structured programming’.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 139.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 179.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 179.99
Price excludes VAT (USA)
  • Durable hardcover 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

Notes

  1. 1.

    Lakatos (1970), p. 132.

  2. 2.

    Pickering (1995).

  3. 3.

    Lakatos (1970), p. 135.

  4. 4.

    McCarthy (1961, 1962).

  5. 5.

    Wilkes et al. (1951).

  6. 6.

    Stroustrup (1994).

  7. 7.

    Gillies (1992).

  8. 8.

    See Hoare (1982) or Shaw (1990), for example.

  9. 9.

    Turing (1949), Elgot (1954), Hamblin (1957).

  10. 10.

    Jones (2003).

  11. 11.

    See De Millo et al. (1979) and Fetzer (1988), for example.

  12. 12.

    See Arden (1980) and Mahoney (1997).

  13. 13.

    Edwards (1996).

  14. 14.

    Butterfield (1931).

  15. 15.

    See (Edgerton 2006) for discussion of this distinction.

  16. 16.

    Rosen (1964).

  17. 17.

    Rosen (1972).

  18. 18.

    Wexelblat (1981).

  19. 19.

    Gillies and Zheng (2001).

References

  • Arden, B.W. (ed.): What Can be Automated? The Computer Science and Engineering Research Study (COSERS). MIT Press, Cambridge (1980)

    Google Scholar 

  • Butterfield, H.: The Whig Interpretation of History. Bell, London (1931)

    Google Scholar 

  • De Millo, R.A., Lipton, R.J., Perlis, A.J.: Social processes and proofs of theorems and programs. Commun. ACM 22(5), 271–280 (1979)

    Article  Google Scholar 

  • Edgerton, D.: The Shock of the Old: Technology and Global History Since 1900. Profile Books, London (2006)

    Google Scholar 

  • Edwards, P.N.: The Closed World: Computers and the Politics of Discourse in Cold War America. MIT Press, Cambridge (1996)

    Google Scholar 

  • Elgot, C.C.: On single vs. triple address computing machines. J. Assoc. Comput. Mach. 1(3), 119–123 (1954)

    Article  Google Scholar 

  • Fetzer, J.H.: Program verification: the very idea. Commun. ACM 31(9), 1048–1063 (1988)

    Article  Google Scholar 

  • Gillies, D. (ed.): Revolutions in Mathematics. Oxford University Press, London (1992)

    MATH  Google Scholar 

  • Gillies, D., Zheng, Y.: Dynamic interactions with the philosophy of mathematics. Theoria 16(3), 437–459 (2001)

    MathSciNet  MATH  Google Scholar 

  • Hamblin, C.L.: Computer languages. Aust. J. Sci. 20(5), 135–139 (1957)

    MathSciNet  Google Scholar 

  • Hoare, C.A.R.: Programming is an engineering profession. Technical Report PRG-27, Programming Research Group, Oxford University (1982)

    Google Scholar 

  • Jones, C.B.: The early search for tractable ways of reasoning about programs. IEEE Ann. Hist. Comput. 25(2), 26–49 (2003)

    Article  MathSciNet  Google Scholar 

  • Lakatos, I.: Falsification and the methodology of scientific research programmes. In: Lakatos, I., Musgrave, A. (eds.) Criticism and the Growth of Knowledge, pp. 91–196. Cambridge University Press, Cambridge (1970)

    Google Scholar 

  • Mahoney, M.S.: Computer science: the search for a mathematical theory. In: Krige, J., Pestre, D. (eds.) Science in the Twentieth Century, pp. 617–634. Harwood Academic, Reading (1997)

    Google Scholar 

  • McCarthy, J.: A basis for a mathematical theory of computation, preliminary report. In: Proceedings of the Western Joint Computer Conference, pp. 225–238 (1961)

    Google Scholar 

  • McCarthy, J.: Towards a mathematical science of computation (1962). In: Popplewell, C.M. (ed.) Information Processing 1962: Proceedings of IFIP Congress, vol. 62, pp. 21–28. North-Holland, Amsterdam (1963)

    Google Scholar 

  • Pickering, A.: The Mangle of Practice: Time, Agency and Science. University of Chicago Press, Chicago (1995)

    Book  MATH  Google Scholar 

  • Rosen, S.: Programming systems and languages: a historical survey. In: Proceedings of the 1964 Spring Joint Computer Conference. AFIPS Conference Proceedings, vol. 25, pp. 1–15. Spartan Books, Inc., Cleaver-Hume Press, Baltimore, London (1964)

    Google Scholar 

  • Rosen, S.: Programming systems and languages 1965–1975. Commun. ACM 15(7), 591–600 (1972)

    Article  Google Scholar 

  • Shaw, M.: Prospects for an engineering discipline of software. IEEE Softw. 7(6), 15–24 (1990)

    Article  Google Scholar 

  • Stroustrup, B.: The Design and Evolution of C++. Addison-Wesley, Reading (1994)

    Google Scholar 

  • Turing, A.M.: Checking a large routine (1949). In: Report of a Conference on High Speed Automatic Calculating Machines, 22–25 June 1949, pp. 70–72. University Mathematical Laboratory, Cambridge (1950)

    Google Scholar 

  • Wexelblat, R.L. (ed.): History of Programming Languages. Academic Press, San Diego (1981). From the ACM SIGPLAN History of Programming Languages Conference, 1–3 June 1978

    MATH  Google Scholar 

  • Wilkes, M.V., Wheeler, D.J., Gill, S.: The Preparation of Programs for an Electronic Digital Computer. Addison-Wesley, Reading (1951)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mark Priestley .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag London Limited

About this chapter

Cite this chapter

Priestley, M. (2011). Conclusions. In: A Science of Operations. History of Computing. Springer, London. https://doi.org/10.1007/978-1-84882-555-0_12

Download citation

  • DOI: https://doi.org/10.1007/978-1-84882-555-0_12

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-84882-554-3

  • Online ISBN: 978-1-84882-555-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics