Computational Effects in Topological Domain Theory

Authors:
Ingo Battenfeld
Affiliations:
LFCS, School of Informatics, University of Edinburgh, Edinburgh, UK
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2006

Citing 8
Cited 3

Computational lambda-calculus and monads

Proceedings of the Fourth Annual Symposium on Logic in computer science
Notions of computation and monads

Information and Computation
Topology

Handbook of logic in computer science (vol. 1)
Domain theory

Handbook of logic in computer science (vol. 3)
Notions of Computation Determine Monads

FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Topological and limit-space subcategories of countably-based equilogical spaces

Mathematical Structures in Computer Science
Compactly generated domain theory

Mathematical Structures in Computer Science
Computational Effects and Operations: An Overview

Electronic Notes in Theoretical Computer Science (ENTCS)

A Convenient Category of Domains

Electronic Notes in Theoretical Computer Science (ENTCS)
Comparing free algebras in Topological and Classical Domain Theory

Theoretical Computer Science
Domain representations of spaces of compact subsets

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.