Towards a foundation for semantics in complete metric spaces
Information and Computation
Terminal coalgebras in well-founded set theory
Theoretical Computer Science
David Michael Ritchie Park (1935–1990) in memoriam
Theoretical Computer Science - Special issue on formal methods in databases and software engineering
Control flow semantics
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Mathematical Theory of Program Correctness
Mathematical Theory of Program Correctness
Ten Years of Concurrency Semantics; Selected Papers of the Amsterdam Concurrency Group
Ten Years of Concurrency Semantics; Selected Papers of the Amsterdam Concurrency Group
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Compactness in Semantics for Merge and Fair Merge
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
On the Foundation of Final Semantics: Non-Standard Sets, Metric Spaces, Partial Orders
Proceedings of the REX Workshop on Sematics: Foundations and Applications
A behavioural pseudometric for probabilistic transition systems
Theoretical Computer Science - Automata, languages and programming
Recursively defined metric spaces without contraction
Theoretical Computer Science
| Hi-index | 0.00 |
The sets of compact and of closed subsets of a metric space endowed with the Hausdorff metric are studied. Both give rise to a functor on the category of 1-bounded metric spaces and nonexpansive functions. It is shown that the former functor has a terminal coalgebra and that the latter does not.