University of Cambridge > Talks.cam > Microsoft Research Cambridge, public talks > Microsoft Distinguished Research Lecture - Laws of Programming with Concurrency

Microsoft Distinguished Research Lecture - Laws of Programming with Concurrency

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

If you have a question about this talk, please contact Microsoft Research Cambridge Talks Admins.

This event may be recorded and made available internally or externally via http://research.microsoft.com. Microsoft will own the copyright of any recordings made. If you do not wish to have your image/voice recorded please consider this before attending

The basic Laws of Nature sought by many branches of science, as well as the basic axioms postulated in many branches of mathematics, have historically been expressed in great generality as algebraic equations, or occasionally as inequalities. Nowadays these equations provide the theoretical foundation for the design of automated tools which are widely used to help scientists and engineers in pursuit of their goals. This is the way in which Isaac Newton still contributes to mechanics, Blaise Pascal to statistics, Clark Maxwell to electronics, and George Boole to computer Logic Design.

How many Computer Scientists and Software Engineers are familiar with the laws which underlie their own professional practice? They are remarkably similar to the laws of arithmetic, taught even today to schoolchildren. I will present arguments that they are both generally true of computer programs, and provide the foundation for tools that are widely used in programming practice.And the laws of concurrent programming are no more complicated than those for sequential programming.

Please register for this talk to ensure your place: http://research.microsoft.com/en-us/events/lpc/default.aspx

This talk is part of the Microsoft Research Cambridge, public talks series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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