This volume reflects the growing use of techniques from topology and category theory in the field of theoretical computer science. In so doing it offers a source of new problems with a practical flavor while stimulating original ideas and solutions. Reflecting the latest innovations at the interface between mathematics and computer science, the work will interest researchers and advanced students in both fields.
1. Topology, Computer Science and the Mathematics of Convergence,A. Roscoe 2. The Soundness and Completeness of Axioms for CSP Processes,Stephen Blamey 3. Classifying Unbounded Nondeterminism in CSP,G. Barrett and M. Goldsmith 4. Algebraic Posets, Algebraic CPO's and Models of Concurrency,M. Mislove 5. Concurrency Semantics Based on Metric Domain Equations,J. De Bakker and J. Rutten 6. On Topological Characterization of Behavioural Properties,M. Zwiatkowska 7. Order and Strongly Sober Compactifications,J. Lawson 8. Totally Bounded Spaces and Compact Ordered Spaces as Domains of Computation,M. Smyth 9. A Characterization of Effective Topological Spaces II,D. Spreen 10. The Importance of Cardinality, Separability, and Compactness in Computer Science with an Example from Numerical Signal Analysis,K. Grue 11. Digital Topology: A Comparison of the Graph-Based and Topological Approaches,T. Kong and A. Rosenfeld 12. Tiling the Plane with One Tile,D. Girault-Beauquier and M. Nivat 13. An Algebraic Axiomatization of Linear Logic Models,N. Marti-Oliet and J. Meseguer 14. Types as Theories,J. Goguen