{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T16:02:46Z","timestamp":1710777766657},"reference-count":50,"publisher":"Oxford University Press (OUP)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Logic Computation"],"published-print":{"date-parts":[[2015,8]]},"DOI":"10.1093\/logcom\/exs071","type":"journal-article","created":{"date-parts":[[2013,2,28]],"date-time":"2013-02-28T15:49:39Z","timestamp":1362066579000},"page":"1091-1110","source":"Crossref","is-referenced-by-count":2,"title":["From mathematical logic to programming-language semantics: a discussion with Tony Hoare"],"prefix":"10.1093","volume":"25","author":[{"given":"Edgar G.","family":"Daylight","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2013,2,26]]},"reference":[{"key":"2015072400400128000_25.4.1091.1","unstructured":"Popplewell C. M. , editor. Proceedings of the International Symposium of Symbolic Languages in Data Processing. March 1962. Panel discussion: \u2018efficient processor construction\u2019."},{"key":"2015072400400128000_25.4.1091.2","doi-asserted-by":"publisher","DOI":"10.1145\/367236.367262"},{"key":"2015072400400128000_25.4.1091.3","unstructured":"Bauer F. L. Samelson K. Sequentielle formel\u00fcbersetzung. Elektronische Rechenanlagen 1959;1:176-182."},{"key":"2015072400400128000_25.4.1091.4","doi-asserted-by":"publisher","DOI":"10.1145\/366959.366968"},{"key":"2015072400400128000_25.4.1091.5","doi-asserted-by":"publisher","DOI":"10.1145\/355592.365646"},{"key":"2015072400400128000_25.4.1091.6","doi-asserted-by":"crossref","unstructured":"Bowen J. P. An interview with C.A.R. Hoare. Commun. ACM 2009;52:38-41.","DOI":"10.1145\/1467247.1467261"},{"key":"2015072400400128000_25.4.1091.7","doi-asserted-by":"publisher","DOI":"10.1145\/321992.321996"},{"key":"2015072400400128000_25.4.1091.8","unstructured":"Campbell-Kelly M. Aspray W. Computer: A History of the Information Machine. Basic Books; 1996."},{"key":"2015072400400128000_25.4.1091.9","unstructured":"Darlington J. Burstall R. M. 3rd International Conference on Artificial Intelligence. Stanford University; 1973. A system which automatically improves programs; p. 479-485."},{"key":"2015072400400128000_25.4.1091.10","unstructured":"Davis M. Computability and Unsolvability. McGraw-Hill; 1958."},{"key":"2015072400400128000_25.4.1091.11","unstructured":"Davis M. The Universal Computer: The Road from Leibniz to Turing. Norton; 2000."},{"key":"2015072400400128000_25.4.1091.12","doi-asserted-by":"crossref","unstructured":"Daylight E. G. Dijkstra's rallying cry for generalization: the advent of the recursive procedure, late 1950s \u2014 early 1960s. Computer J 2011. doi: 10.1093\/comjnl\/bxr002.","DOI":"10.1093\/comjnl\/bxr002"},{"key":"2015072400400128000_25.4.1091.13","unstructured":"Daylight E. G. Pluralism in Software Engineering: Turing Award Winner Peter Naur Explains. Lonely Scholar; 2011."},{"key":"2015072400400128000_25.4.1091.14","unstructured":"Daylight E. G. The Dawn of Software Engineering: from Turing to Dijkstra. Lonely Scholar; 2012."},{"key":"2015072400400128000_25.4.1091.15","unstructured":"Daylight E. G. Nanz S. , editors. The Future of Software Engineering: Panel discussions, 22\u201323 November 2010, ETH Zurich. Lonely Scholar Conversations; 2011. www.lonelyscholar.com ."},{"key":"2015072400400128000_25.4.1091.16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386232"},{"key":"2015072400400128000_25.4.1091.17","doi-asserted-by":"crossref","unstructured":"Dijkstra E. W. Go to statement considered harmful. Letters to the Editor, Commun. ACM 1968;11:147-148.","DOI":"10.1145\/362929.362947"},{"key":"2015072400400128000_25.4.1091.18","unstructured":"Drobi S. A Conversation with Sir. Tony Hoare. Conducted on June 25, 2009, Recorded at QCon, www.infoq.com\/interviews\/tony-hoare-qcon-interview ."},{"key":"2015072400400128000_25.4.1091.19","doi-asserted-by":"crossref","unstructured":"Floyd R. W. Proceedings of Symposia in Applied Mathematics. Vol. 19. American Mathematical Society; 1967. Assigning meanings to programs.","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"2015072400400128000_25.4.1091.20","unstructured":"Frana P. L. Oral history interview with Charles Antony Richard Hoare. OH 357, Conducted on 17 July 2002 in Cambridge, England. Copyright: Charles Babbage Institute, University of Minnesota, Minneapolis."},{"key":"2015072400400128000_25.4.1091.21","doi-asserted-by":"publisher","DOI":"10.1145\/363235.363259"},{"key":"2015072400400128000_25.4.1091.22","unstructured":"Hoare C. A. R. Technical Report STAN-CS-74-408. Stanford, California: Stanford University; January 1974. Hints for programming language design."},{"key":"2015072400400128000_25.4.1091.23","doi-asserted-by":"publisher","DOI":"10.1007\/BF00976239"},{"key":"2015072400400128000_25.4.1091.24","doi-asserted-by":"publisher","DOI":"10.1145\/358549.358561"},{"key":"2015072400400128000_25.4.1091.25","doi-asserted-by":"crossref","unstructured":"Hoare C. A. R. Programming: sorcery or science? IEEE Soft 1984;1:5-16.","DOI":"10.1109\/MS.1984.234042"},{"key":"2015072400400128000_25.4.1091.26","unstructured":"Hoare C. A. R. Mathematics of programming. BYTE 1986:115-149."},{"key":"2015072400400128000_25.4.1091.27","doi-asserted-by":"crossref","unstructured":"Hoare C. A. R. FME \u201896: Industrial Benefit and Advances in Formal Methods, Third International Symposium of Formal Methods Europe. Oxford: Springer; March 1996. How did software get so reliable without proof?; p. 1-17. Lecture Notes in Computer Science 1051, Co-Sponsored by IFIP WG 14.3.","DOI":"10.1007\/3-540-60973-3_77"},{"key":"2015072400400128000_25.4.1091.28","doi-asserted-by":"crossref","unstructured":"Hoare C. A. R. Retrospective: An axiomatic basis for computer programming. Commun. ACM 2009;52:30-32.","DOI":"10.1145\/1562764.1562779"},{"key":"2015072400400128000_25.4.1091.29","doi-asserted-by":"publisher","DOI":"10.1145\/356603.356606"},{"key":"2015072400400128000_25.4.1091.30","unstructured":"Kleene S. C. Introduction to Metamathematics. Van Nostrand; 1952."},{"key":"2015072400400128000_25.4.1091.31","doi-asserted-by":"crossref","unstructured":"Knuth D. E. The dangers of computer-science theory. Logic, Methodol. Philos: Sci. 1971;4:189-195.","DOI":"10.1016\/S0049-237X(09)70357-X"},{"key":"2015072400400128000_25.4.1091.32","doi-asserted-by":"publisher","DOI":"10.1145\/356635.356640"},{"key":"2015072400400128000_25.4.1091.33","doi-asserted-by":"publisher","DOI":"10.1016\/0950-5849(95)01046-7"},{"key":"2015072400400128000_25.4.1091.34","doi-asserted-by":"crossref","unstructured":"De Millo R. A. Lipton R. J. Perlis A. J. Social processes and proofs of theorems and programs. Commun. ACM 1972;22:271-280.","DOI":"10.1145\/359104.359106"},{"key":"2015072400400128000_25.4.1091.35","doi-asserted-by":"publisher","DOI":"10.1145\/361227.361229"},{"key":"2015072400400128000_25.4.1091.36","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934408"},{"key":"2015072400400128000_25.4.1091.37","doi-asserted-by":"crossref","unstructured":"Naur P. Intuition in software development. In: Ehrig H. Floyd C. Nivat M. Thatcher J. , editors. Formal Methods and Software Development, Vol. 2: Colloquium on Software Engineering, Vol. 186 of Lecture Notes in Computer Science. Springer; 1985. p. 60-79. ISBN 3-540-15199-0.","DOI":"10.1007\/3-540-15199-0_5"},{"key":"2015072400400128000_25.4.1091.38","unstructured":"Naur P. Informatics Curricula for the 1990s. Providence, Rhode Island; April 1990. Computing and the so-called foundations of the so-called sciences. IFIP Wokring Group 3.2 Workshop. Invited lecture."},{"key":"2015072400400128000_25.4.1091.39","unstructured":"Naur P. Computing: A Human Activity. ACM Press\/Addison-Wesley; 1992."},{"key":"2015072400400128000_25.4.1091.40","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/36.4.351"},{"key":"2015072400400128000_25.4.1091.41","unstructured":"Petzold C. The Annotated Turing: A Guided Tour through Alan Turing's Historic Paper on Computability and the Turing Machine. Wiley Publishing, Inc.; 2008."},{"key":"2015072400400128000_25.4.1091.42","unstructured":"Quine W. V. O. Mathematical Logic. Harvard University Press; 1955."},{"key":"2015072400400128000_25.4.1091.43","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/41.6.363"},{"key":"2015072400400128000_25.4.1091.44","unstructured":"Russell B. The Principles of Mathematics. W.W. Norton & Company, Inc.; Originally published in 1903."},{"key":"2015072400400128000_25.4.1091.45","unstructured":"Samelson K. Bauer F. Symbolic Languages in Data Processing. Gordon and Breach Science Publishers; 1962. The ALCOR project; p. 207-218."},{"key":"2015072400400128000_25.4.1091.46","unstructured":"Sammet J. E. Programming Languages: History and Fundamentals. Prentice-Hall; 1969."},{"key":"2015072400400128000_25.4.1091.47","doi-asserted-by":"publisher","DOI":"10.1145\/368370.368387"},{"key":"2015072400400128000_25.4.1091.48","unstructured":"Steel T. B. , editor. IFIP Working Conference on Formal Language Description Languages. North-Holland; 1966."},{"key":"2015072400400128000_25.4.1091.49","doi-asserted-by":"crossref","unstructured":"Strachey C. An impossible program. Lett. Editor Computer J. 1965:313.","DOI":"10.1093\/comjnl\/7.4.313"},{"key":"2015072400400128000_25.4.1091.50","unstructured":"Turing A. M. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc., 2nd Ser. 1936;42:230-265."}],"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/25\/4\/1091\/5141351\/exs071.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,10]],"date-time":"2019-07-10T05:49:27Z","timestamp":1562737767000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article-lookup\/doi\/10.1093\/logcom\/exs071"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,26]]},"references-count":50,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2015,7,24]]},"published-print":{"date-parts":[[2015,8]]}},"alternative-id":["10.1093\/logcom\/exs071"],"URL":"https:\/\/doi.org\/10.1093\/logcom\/exs071","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,26]]}}}