Buch, Englisch, 402 Seiten, Format (B × H): 161 mm x 240 mm, Gewicht: 769 g
Buch, Englisch, 402 Seiten, Format (B × H): 161 mm x 240 mm, Gewicht: 769 g
ISBN: 978-0-19-853760-1
Verlag: OUP Oxford
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.
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
- Mathematik | Informatik Mathematik Geometrie
- Mathematik | Informatik Mathematik Topologie Mengentheoretische Topologie
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik Mathematik Mathematik Allgemein Grundlagen der Mathematik
Weitere Infos & Material
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.
