In this biography
Quick facts
- Born
- 1934
- Died
- 5 March 2026
- Birthplace
- Colombo, then Ceylon
- Country
- United Kingdom
- Nationality
- Not independently established
- Known for
- Program reasoning
- Award
- Turing Award, 1980
- Language collaboration
- ALGOL W with Niklaus Wirth
Why this life matters
He helped connect programming-language design with systematic reasoning about software.
Timeline
Key moments
Industry
Joined Elliott Brothers.
Research record
Published the axiomatic-programming paper.
University role
Began the Oxford professorship.
Languages before programming
Hoare studied classics and philosophy at Oxford. Naval Russian-language service was followed by statistics and a period in Moscow studying machine translation.
He joined Elliott Brothers in 1960.
His route into computing therefore involved language, mathematical reasoning and industrial equipment rather than a computer-science degree.
Rules for a program
The 1969 paper presented assignment and iteration rules while acknowledging Floydโs contribution. It expressly separated these rules from a basis for proving termination.
The distinction matters to users of formal notation: an assertion may describe every terminating execution while leaving open whether execution stops. Machine arithmetic and side effects also require explicit treatment.
Sources for this section: [4]
Universities and software design
He worked at Queenโs University Belfast before becoming professor at Oxford in 1977, succeeding the programming-research tradition established by Christopher Strachey.
His work also included communicating sequential processes, Z and software-engineering education. With Niklaus Wirth he worked on ALGOL W.
Language design and verification were connected projects. Better notation could make programs easier to construct, discuss and reason about, rather than merely decorate a finished implementation with a proof.
Later research and death
After his university career he continued research at Microsoft. He died on 5 March 2026.
His biography spans industrial programming, academic institution building and later collaborative verification work. The linked exercise isolates one small rule; it is not a certification method for an arbitrary software product.
Sources for this section: [2]
Quick answers
Frequently asked questions about Tony Hoare
- Does an invariant by itself prove that a loop stops?
- No. A separate termination argument is needed in the original example.
Keep exploring
Lives connected to this story
- Alan Turing
Read an earlier and different mathematical approach to computation.
- Leslie Lamport
Continue with specification and ordering in distributed computation.
Sources and further reading
Explore the evidence
These references support the biography and offer further reading. Official records, first-person accounts and independent reporting provide different perspectives; image records document attribution and licensing.
- 1. Kellogg College, 19 March 2026Remembering Sir Charles Antony Richard Hoare
- 2. Wolfson College, 16 March 2026Wolfson Emeritus Fellow Professor Sir Tony Hoare dies
This memorial gives an inconsistent middle-name spelling and award year. The other university record supports the forms used here; the disputed retirement year is withheld.
- 3. Oxford Department of Computer ScienceTony Hoare: historical personal biography
- 4. C. A. R. Hoare, CACM 12(10), 576โ580, 583, 1969An Axiomatic Basis for Computer Programming