Skip to main content
SpringerLink
Log in

John McCarthy (1927–2011)

  • Published:
Formal Aspects of Computing

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Backus JW, Bauer FL, Green J, Katz C, McCarthy J, Naur P, Perlis AJ, Rutishauser H, Samelson K, Vauquois B, Wegstein JH, van Wijngaarden A, Woodger M (1963) Revised report on the algorithmic language Algol 60. Commun ACM 6(1): 1–17

    Article  Google Scholar 

  2. Luckham DC, Park DMR, Paterson MS (1970) On formalised computer programs. J Comput Sys Sci 4: 220–249

    Article  MathSciNet  MATH  Google Scholar 

  3. Manna Z (1968) Termination of Algorithms. PhD thesis, Carnegie-Mellon University

  4. McCarthy J (1959) Programs with common sense. Mechanization of thought processes, vol. I. Her Majesty’s Stationery office, London

    Google Scholar 

  5. McCarthy J (1960) Recursive functions of symbolic expressions and their computation by machine, part I. Commun ACM 3(4): 184–195

    Article  MathSciNet  MATH  Google Scholar 

  6. McCarthy J (1962) Computer programs for checking mathematical proofs. In: Proceedings of Symposia in pure mathematics, vol 5. American Mathematical Society, New York, pp 219–227

  7. McCarthy J (1963) A basis for a mathematical theory for computation. In: Braffort P, Hirschberg D (eds) Computer programming and formal systems. North-Holland Publishing Company, pp 33–70 (A slightly extended and corrected version of a talk given at the May 1961 Western Joint Computer Conference)

  8. McCarthy J (1963) Towards a mathematical science of computation. In: Popplewell CM (ed) Information processing’62. North-Holland Publishing Company, New York, pp 21–28

    Google Scholar 

  9. McCarthy J (1965) A proof-checker for predicate calculus. Stanford Artificial Intelligence Project Memo 27. Computer Science Department, Stanford University

  10. McCarthy J (1966) A formal description of a subset of ALGOL. In: [Ste66], pp 1–12

  11. Manna Z, McCarthy J (1969) Properties of programs and partial function logic. In: Meltzer B, Michie D (eds) Machine intelligence, vol 5. Edinburgh University Press, Edinburgh, pp 27–37

    Google Scholar 

  12. McCarthy J, Painter J (1966) Correctness of a compiler for arithmetic expressions. Technical Report CS38. Computer Science Department, Stanford University (see also (1967) Mathematical Aspects of Computer Science. In: Proceedings of Symposia in applied mathematics, vol 19. American Mathematical Society, New York, pp 33–41).

  13. Paterson MS (1967) Equivalence problems in a model of computation. PhD thesis, University of Cambridge

  14. Steel TB (1966) Formal language description languages for computer programming. North-Holland Publishing Company, New York

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Newcastle upon Tyne, UK

    Cliff B. Jones

Authors
  1. Cliff B. Jones
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Cliff B. Jones.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jones, C.B. John McCarthy (1927–2011). Form Asp Comp 24, 305–306 (2012). https://doi.org/10.1007/s00165-012-0226-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00165-012-0226-7

Keywords

Search

Navigation