BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Algebra unifies Calculi of programming - Tony Hoare (Microsoft Res
 earch)
DTSTART:20111202T140000Z
DTEND:20111202T150000Z
UID:TALK34089@talks.cam.ac.uk
CONTACT:Bjarki Holm
DESCRIPTION:Boolean algebra has made an indispensable contribution to the 
 design of computer hardware. I suggest an algebra of programs\, supported 
 by mechanised tools\, may be important in the engineering of software. The
  algebraic laws that govern program constructions are extremely familiar (
 e.g. associativity\, commutativity)\, but with a couple of novel extension
 s to treat concurrency\, and they apply to program specifications and desi
 gns as well. The laws justify algebraic proofs of a collection of useful p
 rogramming calculi\, including both deductive rules (e.g. Hoare Logic) and
  operational semantics (e.g. Milner transitions). Surprisingly\, the algeb
 ra is simpler than each of these calculi individually\, and as strong as a
 ll of them in combination.
LOCATION:Room FW11\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR