Hoare, C. A. R. 1934-

Enlarge text Shrink text
  • Personality
| System number 987007262637405171

Information for Authority record

Name (Hebrew)
הואר, טוני, 1934-
Name (Latin)
Hoare, C. A. R. 1934-
Other forms of name
nnaa Hoare, Charles Antony Richard
Hoare, Charles Antony Richard, 1934-
Hoare, Tony, 1934-
Date of birth
1934-01-11
Gender
male
MARC
MARC

Other Identifiers

VIAF: 108123782
Wikidata: Q92602
Library of congress: n 84148204
Sources of Information
  • A classical mind, 1994:t.p. (C.A.R. Hoare) fwd. (Tony Hoare)
  • His Communicating sequential processes, 1985:CIP t.p. (C.A.R. Hoare, prof. of computer science, Oxford University) CIP data sheet (b. 1-11-34)
  • LC data base, 10-3-84(hdg.: Hoare, Charles Antony Richard; usage: C.A.R. Hoare)
  • LCN: Hoare, C. A. R. (Charles Antony Richard), 1934-

Wikipedia description:

Sir Charles Antony Richard Hoare ( 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.

Read more on Wikipedia >