On the sobriety of domains

Achim Jung

(University of Birmingham)

There are two ways in which a domain (in the sense of Dana Scott) may arise from countable data: The classic way is via order-theoretic approximation inside the domain, and leads to the notion of algebraic and continuous domains. Alternatively, one can view a domain as arising from the lattice of predicates that may be formulated for a data type. This latter approach was pioneered and developed by Samson Abramsky in his Domain Theory in Logical Form. I will explain these two approaches and then present an example that illustrates some of the subtlety that we may observe with the latter.

Wednesday 20th January 2016, 16:00
Robert Recorde Room
Department of Computer Science