Wednesday 25th May, 2016
9:30am to 10:30am
What's the meaning behind the PL slogan, 'computation is continuous'? In order to find out, we'll explore the basics of a field called domain theory. Domain theory is interesting because it lets us characterize continuity with a very simple property. This version of continuity, though, is abstract enough that it's applicable to how we think about programs!
From there we'll see how we can use this simple slogan to apply all the tools of normal mathematics to study problems around systems like the lambda calculus and dip our toes into the wonderful world of denotational semantics.
This talk assumes as few mathematical prerequisites as possible, though its content is a little mathematical. It would be helpful if participants were familiar with the lambda calculus, or a functional language based on it.
Sign in to add slides, notes or videos to this session