First lecture 4 February 1997. This course will be given in English. A first attempt would be to use set theory, but it turns out that ordinary sets cannot support the circularity inherent in phenomena like recursion, loops, and recursive data structures. Instead we need objects with some additional structure, to capture the way in which finite programs may exhibit potentially infinite behaviour.
Domain theory is both interesting mathematics and good computer science.
In this course we shall develop the basic mathematical theory of domains, guided by their primary use as models for describing computation. Schedule Lectures by week. The links lead to exercise sheets. Other material given out includes a diagram showing part of the domain hierarchy , and some information on PCF and its domain interpretation . The following textbooks all include some material on domains.