= Tony Hoare
{c}
{wiki}
= C. A. R. Hoare
{c}
{synonym}
= Charles Antony Richard Hoare
{c}
{synonym}
<Tony Hoare> is a <computer scientist> whose contributions include <quicksort>, <Hoare logic> and <communicating sequential processes>. His industrial work included an early <ALGOL 60> <compiler>; his institutional biography also describes an unsuccessful <operating system> project, giving concrete context for the difficulty of reliable systems engineering.https://www.microsoft.com/en-us/research/people/thoare/[Institutional biography, early Elliott Brothers projects and research achievements]{ref}
In his 1969 paper <An Axiomatic Basis for Computer Programming by Tony Hoare>, he set out assignment, composition and iteration rules for reasoning directly about program text. The assignment rule reasons backward from the required result, while a <loop invariant> compresses arbitrarily many iterations into a preservation obligation. The paper explicitly distinguishes these <partial correctness> results from successful termination and discusses how arithmetic and <side effects> affect the model.<An Axiomatic Basis for Computer Programming by Tony Hoare>[sections 2–4]{ref}
\Image[https://commons.wikimedia.org/wiki/Special:Redirect/file/Tony%20Hoare%20%28FLoC%202006%29.jpg?width=250]
{title=Portrait of <Tony Hoare>}
{description=Dennis Hamilton (orcmid), Flickr; File caption identifies FLoC 2006, 18 August 2006. https://creativecommons.org/licenses/by/2.0/[Creative Commons Attribution 2.0 Generic.], via Wikimedia Commons.}
{source=https://commons.wikimedia.org/wiki/File:Tony_Hoare_%28FLoC_2006%29.jpg}
{width=250}
Back to article page
