University of Cambridge > Talks.cam > Logic and Semantics Seminar (Computer Laboratory) > Algebra unifies Calculi of programming

Algebra unifies Calculi of programming

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Bjarki Holm.

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 extensions to treat concurrency, and they apply to program specifications and designs as well. The laws justify algebraic proofs of a collection of useful programming calculi, including both deductive rules (e.g. Hoare Logic) and operational semantics (e.g. Milner transitions). Surprisingly, the algebra is simpler than each of these calculi individually, and as strong as all of them in combination.

This talk is part of the Logic and Semantics Seminar (Computer Laboratory) series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2017 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity