Domain Theory, Logic and Computation Proceedings of the 2nd International Symposium on Domain Theory, Sichuan, China, October 2001

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 area.

1 Playful, streamlike computation.- 2 Universal types and what they are good for.- 3 Relational representations of hyper-continuous lattices.- 4 Convergence classes and spaces of partial functions.- 5 On meet-continuous dcpos.- 6 External characterizations of continuous sL-domains.- 7 Projectives and injectives in the category of quantales.- 8 On minimal event and concrete data structures.- 9 A note on strongly finite sequent structures.