{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T15:04:45Z","timestamp":1780585485974,"version":"3.54.1"},"reference-count":102,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T00:00:00Z","timestamp":1780531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2026,6,30]]},"abstract":"<jats:p>In 1980 Tony Hoare received the ACM Turing Award \u201cfor his fundamental contributions to the definition and design of programming languages\u201d. This article examines the achievements that led to this award.<\/jats:p>","DOI":"10.1145\/3816707","type":"journal-article","created":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T11:03:48Z","timestamp":1779102228000},"page":"1-20","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Tony Hoare: his path to the ACM Turing Award"],"prefix":"10.1145","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1332-4229","authenticated-orcid":false,"given":"Krzysztof R.","family":"Apt","sequence":"first","affiliation":[{"name":"Centrum voor Wiskunde en Informatica","place":["Amsterdam, Netherlands"]},{"name":"MIMUW, University of Warsaw","place":["Amsterdam, Netherlands"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,4]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-745-5"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/357103.357110"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/3544585"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-4376-0"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-019-00501-3"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/72551.72552"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/357094.357101"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/828.833"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","unstructured":"Mikkel Bundgaard and Robin Milner. 2010. Unfolding CSP. In Reflections on the Work of C. A. R. Hoare A. W. Roscoe Clifford B. Jones and Kenneth R. Wood (Eds.). Springer 213\u2013228. DOI:10.1007\/978-1-84882-912-1_10","DOI":"10.1007\/978-1-84882-912-1_10"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/3701729"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/322108.322121"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1137\/0207005"},{"key":"e_1_3_2_14_2","volume-title":"Introduction to Algorithms (4th ed.)","author":"Cormen Thomas H.","year":"2012","unstructured":"Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2012. Introduction to Algorithms (4th ed.). MIT. Retrieved from http:\/\/mitpress.mit.edu\/books\/introduction-algorithms"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.5555\/1243380"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.5555\/539769"},{"key":"e_1_3_2_17_2","unstructured":"Edsger W. Dijkstra. 1965. Cooperating Sequential Processes. (1965). Retrieved April 19 2026 from http:\/\/www.cs.utexas.edu\/users\/EWD\/ewd01xx\/EWD123.PDF. Published as [18]."},{"key":"e_1_3_2_18_2","unstructured":"Edsger W. Dijkstra. 1965. An Experiment with the \u201cRecord Class\u201d as Suggested by C.A.R. Hoare. (1965). Retrieved April 19 2026 from http:\/\/www.cs.utexas.edu\/users\/EWD\/ewd01xx\/EWD132.PDF. Circulated privately."},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3472-0_2"},{"key":"e_1_3_2_20_2","unstructured":"Edsger W. Dijkstra. 1970. Notes on Structured Programming. (April1970). Retrieved April 19 2026 from http:\/\/www.cs.utexas.edu\/users\/EWD\/ewd02xx\/EWD249.PDF. Circulated privately."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289519"},{"key":"e_1_3_2_22_2","unstructured":"Edsger W. Dijkstra. 1971. A Short Introduction to the Art of Programming. (Aug.1971). Retrieved April 19 2026 from http:\/\/www.cs.utexas.edu\/users\/EWD\/ewd03xx\/EWD316.PDF. Circulated privately."},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1145\/360933.360975"},{"key":"e_1_3_2_24_2","unstructured":"Edsger W. Dijkstra. 1975. A Synthesis Emerging? (Aug.1975). Retrieved April 19 2026 from http:\/\/www.cs.utexas.edu\/users\/EWD\/ewd05xx\/EWD508.PDF. Published as [26]."},{"key":"e_1_3_2_25_2","unstructured":"Edsger W. Dijkstra. 1975. Variations on a theme: An open letter to C.A.R. Hoare. (July1975). Retrieved April 19 2026 from http:\/\/www.cs.utexas.edu\/users\/EWD\/ewd05xx\/EWD501.PDF. Published as [27]."},{"key":"e_1_3_2_26_2","volume-title":"A Discipline of Programming","author":"Dijkstra Edsger W.","year":"1976","unstructured":"Edsger W. Dijkstra. 1976. A Discipline of Programming. Prentice-Hall. Retrieved from https:\/\/www.worldcat.org\/oclc\/01958445"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5695-3_26"},{"key":"e_1_3_2_28_2","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/978-1-4612-5695-3","volume-title":"Proceedings of the Selected Writings on Computing: A Personal Perspective","author":"Dijkstra Edsger W.","year":"1982","unstructured":"Edsger W. Dijkstra. 1982. Variations on a theme: An open letter to C.A.R. Hoare. In Proceedings of the Selected Writings on Computing: A Personal Perspective. Springer-Verlag, 132\u2013140. Retrieved from https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4612-5695-3_23"},{"key":"e_1_3_2_29_2","unstructured":"Edsger W. Dijkstra. 1988. A New Science From Birth to Maturity. (Oct.1988). Retrieved April 19 2026 from http:\/\/www.cs.utexas.edu\/users\/EWD\/ewd10xx\/EWD1024.PDF"},{"key":"e_1_3_2_30_2","unstructured":"Edsger W. Dijkstra. 1999. Computing Science: Achievements and Challenges. (1999). Retrieved April 19 2026 from http:\/\/www.cs.utexas.edu\/users\/EWD\/ewd12xx\/EWD1284.PDF. Published as [30]."},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/335527.335528"},{"key":"e_1_3_2_32_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00204-0"},{"key":"e_1_3_2_33_2","unstructured":"Edsger W. Dijkstra. n.d.. Mijn laatste verslag van een bijeenkomst van W.G.2.1. (n.d.). Retrieved April 19 2026 from http:\/\/www.cs.utexas.edu\/users\/EWD\/ewd02xx\/EWD252.PDF. Circulated privately."},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37036-6_8"},{"key":"e_1_3_2_35_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2006.10.002"},{"key":"e_1_3_2_36_2","doi-asserted-by":"publisher","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"e_1_3_2_37_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/14.4.391"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1145\/1787234.1787249"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/357084.357087"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288684"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1145\/361454.361473"},{"key":"e_1_3_2_42_2","volume-title":"Operating Systems Principles","author":"Hansen Per Brinch","year":"1973","unstructured":"Per Brinch Hansen. 1973. Operating Systems Principles. Prentice-Hall, Englewood Cliffs, N.J. Retrieved from https:\/\/dl.acm.org\/doi\/10.5555\/540365"},{"key":"e_1_3_2_43_2","doi-asserted-by":"publisher","DOI":"10.1145\/154766.155361"},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3472-0"},{"key":"e_1_3_2_45_2","unstructured":"Per Brinch Hansen. 2004. A Programmer\u2019s Story: The Life of a Computer Pioneer. (2004). Retrieved April 19 2026 from http:\/\/brinch-hansen.net\/"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.70673"},{"issue":"7","key":"e_1_3_2_47_2","first-page":"321","article-title":"Algorithm 63, partition; algorithm 64, quicksort; algorithm 65, find","volume":"4","author":"Hoare C. A. R.","year":"1961","unstructured":"C. A. R. Hoare. 1961. Algorithm 63, partition; algorithm 64, quicksort; algorithm 65, find. Communications of the ACM 4, 7 (1961), 321\u2013322. Retrieved from https:\/\/dl.acm.org\/doi\/epdf\/10.1145\/366622.366642","journal-title":"Communications of the ACM"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/5.1.10"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.5555\/1061032.1061041"},{"key":"e_1_3_2_50_2","first-page":"291","volume-title":"Proceedings of the Programming Languages","author":"Hoare C. A. R.","year":"1968","unstructured":"C. A. R. Hoare. 1968. Record handling. In Proceedings of the Programming Languages. F. Genuys (Ed.), Academic Press, 291\u2013347. Retrieved from https:\/\/ora.ox.ac.uk\/objects\/uuid%3Ad759ca7a-6fe4-4362-ab5f-34a78958e55c"},{"key":"e_1_3_2_51_2","doi-asserted-by":"publisher","DOI":"10.1145\/363235.363259"},{"key":"e_1_3_2_52_2","doi-asserted-by":"publisher","DOI":"10.1145\/362452.362489"},{"key":"e_1_3_2_53_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/15.4.321"},{"key":"e_1_3_2_54_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289507"},{"key":"e_1_3_2_55_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3472-0_6"},{"key":"e_1_3_2_56_2","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/16.3.209"},{"key":"e_1_3_2_57_2","doi-asserted-by":"publisher","DOI":"10.1145\/355620.361161"},{"key":"e_1_3_2_58_2","doi-asserted-by":"publisher","DOI":"10.1016\/0096-0551(75)90014-4"},{"key":"e_1_3_2_59_2","doi-asserted-by":"publisher","DOI":"10.1145\/359576.359585"},{"key":"e_1_3_2_60_2","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358561"},{"key":"e_1_3_2_61_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264034"},{"key":"e_1_3_2_62_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289504"},{"key":"e_1_3_2_63_2","unstructured":"C. A. R. Hoare. 1968. The Axiomatic Method. (1968). Retrieved April 19 2026 from https:\/\/www.cs.ox.ac.uk\/files\/6079\/H68%20-%20Axiomatic.pdf"},{"key":"e_1_3_2_64_2","doi-asserted-by":"publisher","DOI":"10.1145\/3729293"},{"key":"e_1_3_2_65_2","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.AOFA.2024.9"},{"key":"e_1_3_2_66_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477355.3477372"},{"key":"e_1_3_2_67_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477355.3477358"},{"key":"e_1_3_2_68_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477355"},{"key":"e_1_3_2_69_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-912-1_1"},{"key":"e_1_3_2_70_2","volume-title":"A Program Verifier","author":"King J. C.","year":"1969","unstructured":"J. C. King. 1969. A Program Verifier. Ph. D. Dissertation. Carnegie-Mellon University. Retrieved from https:\/\/books.google.nl\/books?id=kJWszAEACAAJ"},{"key":"e_1_3_2_71_2","volume-title":"The Art of Computer Programming, Volume III: Sorting and Searching","author":"Knuth Donald E.","year":"1973","unstructured":"Donald E. Knuth. 1973. The Art of Computer Programming, Volume III: Sorting and Searching. Addison-Wesley. Retrieved from https:\/\/dblp.org\/rec\/books\/aw\/Knuth73.bib"},{"key":"e_1_3_2_72_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1977.229904"},{"key":"e_1_3_2_73_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289266"},{"key":"e_1_3_2_74_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00260921"},{"key":"e_1_3_2_75_2","doi-asserted-by":"publisher","DOI":"10.1145\/948176.948183"},{"key":"e_1_3_2_76_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477355.3477368"},{"key":"e_1_3_2_77_2","doi-asserted-by":"publisher","DOI":"10.5555\/261119"},{"key":"e_1_3_2_78_2","doi-asserted-by":"publisher","DOI":"10.1145\/322123.322134"},{"key":"e_1_3_2_79_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-08921-7_57"},{"key":"e_1_3_2_80_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3"},{"key":"e_1_3_2_81_2","doi-asserted-by":"publisher","DOI":"10.1109\/MAHC.1984.10017"},{"key":"e_1_3_2_82_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01966091"},{"key":"e_1_3_2_83_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00268134"},{"key":"e_1_3_2_84_2","doi-asserted-by":"publisher","DOI":"10.1145\/360051.360224"},{"key":"e_1_3_2_85_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-912-1"},{"key":"e_1_3_2_86_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288656"},{"key":"e_1_3_2_87_2","unstructured":"D. S. Scott and J. W. de Bakker. 1969. A Theory of Programs. Retrieved April 19 2026 from https:\/\/eudml.org\/doc\/92628. Notes of an IBM Vienna Seminar."},{"key":"e_1_3_2_88_2","volume-title":"Quicksort","author":"Sedgewick Robert","year":"1975","unstructured":"Robert Sedgewick. 1975. Quicksort. Ph. D. Dissertation. Stanford University, USA. Retrieved from https:\/\/searchworks.stanford.edu\/view\/870273"},{"key":"e_1_3_2_89_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289467"},{"key":"e_1_3_2_90_2","doi-asserted-by":"publisher","DOI":"10.1137\/0206018"},{"key":"e_1_3_2_91_2","doi-asserted-by":"publisher","DOI":"10.1145\/359619.359631"},{"key":"e_1_3_2_92_2","volume-title":"Algorithms (4th ed.)","author":"Sedgewick Robert","year":"2016","unstructured":"Robert Sedgewick and Kevin Wayne. 2016. Algorithms (4th ed.). Addison-Wesley."},{"key":"e_1_3_2_93_2","doi-asserted-by":"publisher","DOI":"10.1145\/1467247.1467261"},{"key":"e_1_3_2_94_2","volume-title":"The Art of Prolog: Advanced Programming Techniques","author":"Sterling Leon","year":"1986","unstructured":"Leon Sterling and Ehud Shapiro. 1986. The Art of Prolog: Advanced Programming Techniques. The MIT Press. Retrieved from https:\/\/mitpress.mit.edu\/9780262193382\/the-art-of-prolog\/"},{"key":"e_1_3_2_95_2","volume-title":"Haskell - The Craft of Functional Programming (3rd. ed.)","author":"Thompson Simon J.","year":"2011","unstructured":"Simon J. Thompson. 2011. Haskell - The Craft of Functional Programming (3rd. ed.). Addison-Wesley. Retrieved from https:\/\/dblp.org\/rec\/books\/daglib\/0033100.bib"},{"key":"e_1_3_2_96_2","first-page":"67","article-title":"On checking a large routine","author":"Turing Dr. A.","year":"1949","unstructured":"Dr. A. Turing. 1949. On checking a large routine. Report of a Conference on High Speed Automatic Calculating Machines (1949), 67\u201369. Retrieved from https:\/\/turingarchive.kings.cam.ac.uk\/checking-large-routine. Univ. Math. Laboratory, Cambridge.","journal-title":"Report of a Conference on High Speed Automatic Calculating Machines"},{"key":"e_1_3_2_97_2","doi-asserted-by":"publisher","DOI":"10.1145\/362575.362577"},{"key":"e_1_3_2_98_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264291"},{"key":"e_1_3_2_99_2","volume-title":"Systematic Programming: An Introduction","author":"Wirth Niklaus","year":"1973","unstructured":"Niklaus Wirth. 1973. Systematic Programming: An Introduction. Prentice-Hall, Englewood Cliffs, N.J. Retrieved from https:\/\/search.worldcat.org\/title\/223094"},{"key":"e_1_3_2_100_2","volume-title":"Algorithms + Data Structures = Programs","author":"Wirth Niklaus","year":"1976","unstructured":"Niklaus Wirth. 1976. Algorithms + Data Structures = Programs. Prentice-Hall, Englewood Cliffs, N.J. Retrieved from https:\/\/search.worldcat.org\/title\/2005288"},{"key":"e_1_3_2_101_2","unstructured":"Niklaus Wirth. 1976. Typed letter to C.A.R. Hoare. (1976). Retrieved from https:\/\/www.cs.ox.ac.uk\/files\/6155\/Wirth76%20-%20Cooperating.pdf."},{"key":"e_1_3_2_102_2","doi-asserted-by":"publisher","DOI":"10.1145\/3447525"},{"key":"e_1_3_2_103_2","doi-asserted-by":"publisher","DOI":"10.1145\/365696.365702"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3816707","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T14:07:34Z","timestamp":1780582054000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3816707"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,4]]},"references-count":102,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,6,30]]}},"alternative-id":["10.1145\/3816707"],"URL":"https:\/\/doi.org\/10.1145\/3816707","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,4]]},"assertion":[{"value":"2026-04-20","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-05-13","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-06-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}