The emperor's old clothes

The 1980 ACM Turing Award was presented to Charles Antony Richard Hoare, Professor of Computation at the University of Oxford, England, by Walter Carlson, Chairman of the Awards Committee, at the ACM Annual Conference in Nashville, Tennessee, October 27, 1980. Professor Hoare was selected by the General Technical Achievement Award Committee for his fundamental contributions to the definition and design of programming languages. His work is characterized by an unusual combination of insight, originality, elegance, and impact. He is best known for his work on axiomatic definitions of programming languages through the use of techniques popularly referred to as axiomatic semantics. He developed ingenious algorithms such as Quichsort and was responsible for inventing and promulgating advanced data structuring techniques in scientific programming languages. He has also made important contributions to operating systems through the study of monitors. His most recent work is on communicating sequential processes. Prior to his appointment to the University of Oxford in 1977, Professor Hoare was Professor of Computer Science at The Queen's University in Belfast, Ireland, from 1968 to 1977 and was a Visiting Professor at Stanford University in 1973. From 1960 to 1968 he held a number of positions with Elliott Brothers, Ltd., England.

[1]  C. A. R. Hoare,et al.  An axiomatic basis for computer programming , 1969, CACM.

[2]  Peter Henderson,et al.  A lazy evaluator , 1976, POPL.

[3]  Daniel P. Friedman,et al.  CONS Should Not Evaluate its Arguments , 1976, ICALP.

[4]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[5]  William H. Burge,et al.  Recursive Programming Techniques , 1975 .

[6]  Arvind,et al.  A new interpreter for data flow schemas and its implications for computer architecture , 1975 .

[7]  Jack B. Dennis,et al.  First version of a data flow procedure language , 1974, Symposium on Programming.

[8]  John W. Backus.  Programming language semantics and closed applicative languages , 1973, POPL '73.

[9]  Z. Manna,et al.  Inductive methods for proving properties of programs , 1973, CACM.

[10]  D. Scott.  Models for Various Type-Free Calculi , 1973 .

[11]  Christopher Strachey,et al.  Toward a mathematical semantics for computer languages , 1971 .

[12]  John C. Reynolds,et al.  GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept , 1970, Commun. ACM.

[13]  Dana S. Scott,et al.  Outline of a Mathematical Theory of Computation , 1970 .

[14]  P. J. Landin.  The Mechanical Evaluation of Expressions , 1964, Comput. J..

[15]  John McCarthy,et al.  Recursive functions of symbolic expressions and their computation by machine, Part I , 1960, Commun. ACM.

[16]  A. Church.  The calculi of lambda-conversion , 1941 .