No subject

be. =A0But<br>
the basic structures needed to understand recursion mathematically<br>
can, in fact, be directly motivated by programming intuitions.<br>
Fixpoints, in particular, are the key to understanding the jump that<br>
programming enables from the finite to the infinite -- the very heart<br>
of computation. =A0Whether or not you use domains or denotational<br>
semantics directly, these ideas are essential. =A0They pervade our<br>
understanding of languages.<br>
<br>
In this tutorial talk, I&#39;ll introduce the essential ingredients of<br>
domain theory, motivating each step by (1) programming intuition and<br>
(2) semantic necessity. =A0We&#39;ll travel from a simple big-step semantic=
s<br>
all the way to the full abstraction problem from PCF. =A0You&#39;ll get<br>
comfortable with CPOs, continuity, and least fixpoints, and you&#39;ll<br>
never see your programs in quite the same way again.<br>

--e0cb4e70046735cac704a279d3c6--