Two models of synthetic domain theory

Abstract Two models of synthetic domain theory encompassing traditional categories of domains are introduced. First, we present a Grothendieck topos embedding the category ω- Cpo of ω-complete posets and ω-continuous functions as a reflective exponential ideal. Second, we obtain analogous results with respect to a category of domains and stable functions.

[1]  Philip S. Mulry.  Generalized Banach-Mazur functionals in the topos of recursive sets , 1982 .

[2]  Carl A. Gunter.  Semantics of programming languages: structures and techniques , 1993, Choice Reviews Online.

[3]  Peter J. Freyd,et al.  Recursive types reduced to inductive types , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[4]  Glynn Winskel,et al.  The formal semantics of programming languages - an introduction , 1993, Foundation of computing series.

[5]  Wesley Phoa,et al.  Effective domains and intrinsic structure , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[6]  P. Freyd.  Algebraically complete categories , 1991 .

[7]  Marcelo P. Fiore.  Axiomatic domain theory in categories of partial maps , 1994 .

[8]  Paul Taylor,et al.  The fixed point property in synthetic domain theory , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[9]  S. Lane,et al.  Sheaves In Geometry And Logic , 1992 .

[10]  Horst Herrlich,et al.  Category theory , 1979 .

[11]  I. Moerdijk,et al.  Sheaves in geometry and logic: a first introduction to topos theory , 1992 .

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

[13]  P. J. Freyd.  Applications of Categories in Computer Science: Remarks on algebraically compact categories , 1992 .

[14]  J. Hyland.  First steps in synthetic domain theory , 1991 .