Domains are mathematical structures for information and approximation; they combine order-theoretic, logical, and topological ideas and provide a natural framework for modelling and reasoning about computation. The theory of domains has proved to be a useful tool for programming languages and other areas of computer science, and for applications in mathematics.
Included in this proceedings volume are selected papers of original
research presented at the 2nd International Symposium on Domain
Theory in Chengdu, China. With authors from France, Germany, Great
Britain, Ireland, Mexico, and China, the papers cover the latest
research in these sub-areas: domains and computation, topology and
convergence, domains, lattices, and continuity, and representations
of domains as event and logical structures.
Researchers and students in theoretical computer science should
find this a valuable source of reference. The survey papers at the
beginning should be of particular interest to those who wish to
gain an understanding of some general ideas and techniques in this