
Topology and Category Theory in Computer Science
Clarendon Press
Published on 1. August 1991
Book
Hardback
402 pages
978-0-19-853760-1 (ISBN)
Description
The Oxford Topology Symposium was held in June 1989. Since techniques from topology and category theory have been used increasingly by theoretical computer scientists in recent years, it was decided to hold a special session at the symposium which would be devoted to the application of these topics in computer science. By holding this session in the context of the topology symposium, the organisers hoped to achieve a cross-fertilization between the communities they brought together - giving one a course of new problems with a more practical flavour, and the other a source of solutions and ideas. The session itself proved successful, attracting a large audience of mathematicians as well as computer scientists.
The organizing committee decided to produce two separate proceedings for the conference. All those who had presented papers, plus a very few others, were invited to submit papers for these proceedings of the special session on topology and category theory in computer science.
The organizing committee decided to produce two separate proceedings for the conference. All those who had presented papers, plus a very few others, were invited to submit papers for these proceedings of the special session on topology and category theory in computer science.
Reviews / Votes
'What comes out most strikingly in this collection is the sheer variety of approaches ... I believe that anyone who already has some knowledge of computer science applications of topology will find plenty here to broaden their horizons.'Steven Vickers, Imperial College, London, Journal of Logic and Computation, Volume 3, Number 6, December 1993 beautifully printed book * David B. Benson, Computing Reviews, September 1994 *
More details
Language
English
Place of publication
Oxford
United Kingdom
Publishing group
Oxford University Press
Target group
Professional and scholarly
Illustrations
line drawings
Dimensions
Height: 240 mm
Width: 161 mm
Thickness: 26 mm
Weight
769 gr
ISBN-13
978-0-19-853760-1 (9780198537601)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Persons
Editor
, both at the Oxford University Computing Laboratory, Programming Research Group
Computer Science DivisionComputer Science Division, United States Office of Naval Research, Arlington, Virginia
Content
A.W. Roscoe: Topology, computer science and the mathematics of convergence; Stepen Blamey: The soundness and completeness of axioms for CSP processes; Geoff Barrett & Michael Goldsmith: Classifying unbounded nondeterminism in CSP; Michael W. Mislove: Algebraic posets, algebraic cpo's and models of concurrency; J.W. de Bakker & J.J.M.M. Rutten: Concurrency semantics based on metric domain equations; Marta Z. Kwiatkowska: On topological characterization of behavioral properties; J.D. Lawson: Order and strongly sober compactifications; Michael B. Smyth: Totally bounded spaces and compact ordered spaces as domains of computation; Dieter Spreen: A characterization of effective topological spaces II; Klaus E. Grue: The importance of cardinality, separability, and compactness in computer science with an example from numerical signal analysis; T.Y. Kong: Digital topology: a comparison of the graph-based and topological approaches; D. Girault-Beauquier & M. Nivat: Tiling the plane with one tile; Narcisco Marti-Oliet & Jose Meseguer: An algebraic axiomatization of linear logic models; Joseph A. Goguen: Types as theories.