Tony Hoare

Sir Tony Hoare
Hoare in 2011
Born
Charles Antony Richard Hoare

(1934-01-11)11 January 1934
Colombo, British Ceylon
Died5 March 2026(2026-03-05) (aged 92)
Cambridge, England
EducationDragon School
The King's School, Canterbury
Alma materUniversity of Oxford (BA, PgDip)
Known for
SpouseJill Pym
Children3
Awards
Scientific career
FieldsComputer science
Workplaces
Doctoral students
Websitewww.cs.ox.ac.uk/people/tony.hoare/ Edit this at Wikidata
Preview warning: Page using Template:Infobox person with deprecated parameter alma_mater which should be merged with/replaced by education.
Preview warning: Using more than one of the following parameters in Template:Infobox scientist: alma_mater, education.

Sir Charles Antony Richard Hoare (/hɔːr/ HOR; 11 January 1934 – 5 March 2026), known as Sir Tony Hoare or C. A. R. Hoare, was a British computer scientist who made foundational contributions to programming languages, algorithms, operating systems, formal verification, and concurrent computing. His work earned him the 1980 ACM Turing Award, usually regarded as the highest distinction in computer science.

Hoare developed the sorting algorithm quicksort in 1959–1960. He developed Hoare logic, an axiomatic basis for verifying program correctness. In the semantics of concurrency, he introduced the formal language communicating sequential processes (CSP) to specify the interactions of concurrent processes, and along with Edsger Dijkstra, formulated the dining philosophers problem. From 1977 on, he held positions at the University of Oxford as well as at Microsoft Research in Cambridge.