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. Front Matter....Pages i-xii Playful, Streamlike Computation....Pages 1-24 Universal Types and What They are Good For....Pages 25-63 Relational Representations of Hyper-Continuous Lattices....Pages 65-74 Convergence Classes and Spaces of Partial Functions....Pages 75-115 On Meet-Continuous Dcpos....Pages 117-135 External Characterizations of Continuous sL-domains....Pages 137-149 Projectives and Injectives in the Category of Quantales....Pages 151-160 On Minimal Event and Concrete Data Structures....Pages 161-178 A Note on Strongly Finite Sequent Structures....Pages 179-196 Back Matter....Pages 197-197 Proceedings of the 2nd International Symposium on Domain Theory, Sichuan, China, October 2001