Topology and Category Theory in Computer Science

ISBN-13: 9780198537601 / Angielski / Twarda / 1991 / 408 str.

G. M. Reed; R. F. Wachter; A. W. Roscoe

Opis

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.

Recenzje

beautifully printed book

Spis treści

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.