Summer Conference on Topology and Its Applications

Document Type

Semi-plenary Lecture

Publication Date


Publication Source

32nd Summer Conference on Topology and Its Applications


Domain theory has seen success as a semantic model for high-level programming languages, having devised a range of constructs to support various effects that arise in programming. One of the most interesting - and problematic - is probabilistic choice, which traditionally has been modeled using a domain-theoretic rendering of sub-probability measures as valuations. In this talk, I will place the domain-theoretic approach in context, by showing how it relates to the more traditional approaches such as functional analysis and set theory. In particular, we show how the topologies that arise in the classic approaches relate to the domain-theoretic rendering. We also describe some recent developments that extend the domain approach to stochastic process theory.


This document is available for download with the permission of the presenting author and the organizers of the conference. Permission documentation is on file.