Universal domains and the amalgamation property

In the theory of denotational semantics of programming languages, several authors have constructed various kinds of universal domains. We present here a categorical generalization of a well-known result in model theory, which we use to characterize large classes of reasonable categories that contain universal homogeneous objects. The existence of such objects is characterized by the condition that the finite objects in the category satisfy the amalgamation property. We derive from this the existence and uniqueness of universal homogeneous domains for several categories of bifinite domains, with embedding-projection-pairs as morphisms. We also obtain universal homogeneous objects for various categories of stable bifinite domains. In contrast, several categories of event domains and concrete domains and the category of all coherent Scott-domains do not contain universal homogeneous objects. Finally, we show that all our constructions can be performed effectively.

[1]  John L. Bell,et al.  Models and Ultraproducts: An Introduction. , 1969 .

[2]  Guo-Qiang Zhang DI-Domains as Information Systems* , 1989 .

[3]  Guo-Qiang Zhang DI-Domains as Information Systems (Extended Abstract) , 1989, ICALP.

[4]  H. M. Macneille,et al.  Partially ordered sets , 1937 .

[5]  Manfred Droste,et al.  Effectively Given Information Systems and Domains , 1990, CSL.

[6]  Pierre-Louis Curien,et al.  Sequential Algorithms on Concrete Data Structures , 1982, Theor. Comput. Sci..

[7]  G. Plotkin Tω as a Universal Domain , 1978 .

[8]  A. Jung,et al.  Coherence and consistency in domains , 1990, [1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science.

[9]  Glynn Winskel,et al.  DI-Domains as a Model of Polymorphism , 1987, MFPS.

[10]  Christiaan Peter Jozef Koymans,et al.  Models of the Lambda Calculus , 1982, Inf. Control..

[11]  P. Cameron,et al.  Oligomorphic permutation groups , 1990 .

[12]  Manfred Droste,et al.  Non-Deterministic Information Systems and their Domains , 1990, Theor. Comput. Sci..

[13]  Manfred Droste Event Structures and Domains , 1989, Theor. Comput. Sci..

[14]  Gordon D. Plotkin,et al.  A Powerdomain Construction , 1976, SIAM J. Comput..

[15]  Roland Fraïssé Theory of relations , 1986 .

[16]  Elsa L. Gunter Pseudo-Retract Functors for Local Lattices and Bifinite L-domains , 1989, Mathematical Foundations of Programming Semantics.

[17]  Michael B. Smyth,et al.  The Largest Cartesian Closed Category of Domains , 1983, Theor. Comput. Sci..

[18]  Manfred Droste,et al.  Recursive Domain Equations for Concrete Data Structures , 1989, Inf. Comput..

[19]  Carl A. Gunter Universal Profinite Domains , 1987, Inf. Comput..

[20]  Manfred Droste Finite Axiomatizations for Universal Domains , 1992, J. Log. Comput..

[21]  Bjarni Jónsson,et al.  Homogeneous Universal Relational Systems. , 1960 .

[22]  Gérard Berry,et al.  Stable Models of Typed lambda-Calculi , 1978, ICALP.

[23]  Gordon D. Plotkin,et al.  The category-theoretic solution of recursive domain equations , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[24]  Manfred Droste,et al.  Universal Information Systems , 1990, Int. J. Found. Comput. Sci..

[25]  Manfred Droste,et al.  Universal Homogeneous Event Structures and Domains , 1991, Inf. Comput..

[26]  Dana S. Scott,et al.  Data Types as Lattices , 1976, SIAM J. Comput..