The system F of variable types, fifteen years later
Theoretical Computer Science
Information and Computation
Theoretical Computer Science
Universal homogeneous event structures and domains
Information and Computation
Categories, types, and structures: an introduction to category theory for the working computer scientist
Concurrent automata, prime event structures and universal domains
Semantics of programming languages and model theory
Sequentiality in an extensional framework
Papers presented at the IEEE symposium on Logic in computer science
Stable Models of Typed lambda-Calculi
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Domains for Denotational Semantics
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Hi-index | 0.00 |
We present explicit constructions of universal homogeneous objects in categories of domains with stable embedding–projection pairs as arrows. These results make use of a representation of such domains through graph-like structures and apply a generalization of Rado’s result on the existence of the universal homogeneous countable graph. In particular, we build universal homogeneous objects in the categories of coherence spaces and qualitative domains, introduced by Girard (Girard 1987; Girard 1986), and two categories of hypercoherences recently studied by Ehrhard (Ehrhard 1993). Our constructions rely on basic numerical notions. We also show that a suitable random construction of Rado’s graph and its generalizations produces with probability 1 the universal homogeneous structures presented here.