C. A. R. HOARE

Sir 'Charles Antony Richard Hoare' ('Tony Hoare' or 'C.A.R. Hoare', born January 11, 1934) is a British computer scientist, probably best known for the development of Quicksort (or Hoaresort), the world's most widely used sorting algorithm, in 1960. He also developed Hoare logic for verifying program correctness, and the formal language Communicating Sequential Processes (CSP) used to specify the interactions of concurrent processes (including the Dining philosophers problem) and the inspiration for the Occam programming language.

Contents

Biography

Awards

Books

References

External links

Biography

Born in Colombo (Sri Lanka) to British parents, he received his Bachelor's degree in Classics from the University of Oxford (Merton College) in 1956. He remained an extra year at Oxford studying graduate-level statistics, and following his National Service in the Royal Navy (1956–1958), when he learned to speak Russian, he studied computer translation of human languages at Moscow State University in the Soviet Union in the school of Kolmogorov.
In 1960, he left the Soviet Union and began working at Elliott Brothers, Ltd, a small computer manufacturing firm, where he implemented ALGOL 60 and began developing algorithms in earnest.^[1] He became a Professor of Computing Science at the Queen's University of Belfast in 1968, and in 1977 moved back to Oxford as a Professor of Computing to lead the Programming Research Group in the Oxford University Computing Laboratory, following the death of Christopher Strachey. He is now an Emeritus Professor there, and is also a senior researcher at Microsoft Research in Cambridge, England.

Awards

★ He received the 1980 ACM Turing Award for "his fundamental contributions to the definition and design of programming languages". The award was presented to him at the ACM Annual Conference in Nashville, Tennessee, on October 27, 1980, by Walter Carlson, Chairman of the Awards committee. A transcript of Hoare's speech was published in ''Communications of the ACM''.

★ ''Harry H. Goode Memorial Award'' in 1981

★ In 2000 he was knighted for services to education and computer science.

★ On Oct 13, 2006, the Computer History Museum (CHM) in Mountain View, California inducted him as Fellow of the Museum "for development of the Quicksort algorithm and for lifelong contributions to the theory of programming languages".

Books

★ Structured Programming, O.-J. Dahl, E. W. Dijkstra and C. A. R. Hoare, , , Academic Press, 1972, ISBN 0-12-200550-3

★ Communicating Sequential Processes, C. A. R. Hoare, , , Prentice Hall International Series in Computer Science, 1985, ISBN 0-13-153271-5 hardback or ISBN 0-13-153289-8 paperback

★ Mechanised Reasoning and Hardware Design, C. A. R. Hoare and M. J. C. Gordon, , , Prentice Hall International Series in Computer Science, 1992, ISBN 0-13-572405-8

★ Unifying Theories of Programming, C. A. R. Hoare and He Jifeng, , , Prentice Hall International Series in Computer Science, 1998, ISBN 0-13-458761-8

References

1.

External links

★ Microsoft home page — short biography

★ Oxford University Computing Laboratory home page — Emeritus Professor of Computing

★ Advice for Ph.D. students from Tony Hoare — held at the International Summer School Marktoberdorf 2006

★

★ The classic article on monitors — The original article on monitors that was republished as a classic of the ACM