Computational Effects in Topological Domain Theory

This paper contributes towards establishing the category QCB, of topological quotients of countably based spaces, and its subcategory TP, of topological predomains, as a flexible framework for denotational semantics of programming languages. In particular, we show that both categories have free algebras for arbitrary countable parametrised equational theories, and are thus, following ideas of Plotkin and Power, able to model a wide range of computational effects. Furthermore, we give an explicit construction of the free algebras.

[1]  Mogens Nielsen,et al.  Foundations of Software Science and Computation Structures , 2002, Lecture Notes in Computer Science.

[2]  Gordon D. Plotkin,et al.  Algebraic Operations and Generic Effects , 2003, Appl. Categorical Struct..

[3]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

[4]  Alexander Simpson.  Proceedings of thirteenth ALGI Workshop , 2003 .

[5]  Matías Menni,et al.  Topological and Limit-Space Subcategories of Countably-Based Equilogical Spaces , 2002, Math. Struct. Comput. Sci..

[6]  Davide Sangiorgi,et al.  Termination of processes , 2006, Mathematical Structures in Computer Science.

[7]  I. Protasov.  Varieties of topological algebras , 1984 .

[8]  H. Porst.  On free topological algebras , 1987 .

[9]  A. Simpson,et al.  Towards a Convenient Category of Topological Domains , 2003 .

[10]  Samson Abramsky,et al.  Handbook of logic in computer science. , 1992 .

[11]  Gordon D. Plotkin,et al.  Computational Effects and Operations: An Overview , 2004, Electron. Notes Theor. Comput. Sci..

[12]  Eugenio Moggi,et al.  Notions of Computation and Monads , 1991, Inf. Comput..

[13]  Samson Abramsky,et al.  Domain theory , 1995, LICS 1995.

[14]  Matthias Schröder,et al.  Admissible representations for continuous computations , 2003 .

[15]  Eugenio Moggi,et al.  Computational lambda-calculus and monads , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[16]  Matthias Schröder,et al.  Two preservation results for countable products of sequential spaces , 2007, Mathematical Structures in Computer Science.

[17]  K. Brown,et al.  Graduate Texts in Mathematics , 1982 .

[18]  J. Lawson,et al.  Comparing Cartesian closed categories of (core) compactly generated spaces , 2004 .

[19]  K. Hofmann,et al.  Continuous Lattices and Domains , 2003 .

[20]  Matthias Schröder,et al.  Compactly generated domain theory , 2006, Mathematical Structures in Computer Science.

[21]  Gordon D. Plotkin,et al.  Notions of Computation Determine Monads , 2002, FoSSaCS.

[22]  Thomas Streicher,et al.  A Category of Topological Predomains , 2008 .