Table of Contents

1. Topology, Computer Science and the Mathematics of Convergence, A. Roscoe2. The Soundness and Completeness of Axioms for CSP Processes, Stephen Blamey3. Classifying Unbounded Nondeterminism in CSP, G. Barrett and M. Goldsmith4. Algebraic Posets, Algebraic CPO's and Models of Concurrency, M. Mislove5. Concurrency Semantics Based on Metric Domain Equations, J. De Bakker and J. Rutten6. On Topological Characterization of Behavioural Properties, M. Zwiatkowska7. Order and Strongly Sober Compactifications, J. Lawson8. Totally Bounded Spaces and Compact Ordered Spaces as Domains of Computation, M. Smyth9. A Characterization of Effective Topological Spaces II, D. Spreen10. The Importance of Cardinality, Separability, and Compactness in Computer Science with an Example from Numerical Signal Analysis, K. Grue11. Digital Topology: A Comparison of the Graph-Based and Topological Approaches, T. Kong and A. Rosenfeld12. Tiling the Plane with One Tile, D. Girault-Beauquier and M. Nivat13. An Algebraic Axiomatization of Linear Logic Models, N. Marti-Oliet and J. Meseguer14. Types as Theories, J. Goguen