Computational lambda-calculus and monads
Proceedings of the Fourth Annual Symposium on Logic in computer science
Notions of computation and monads
Information and Computation
Probabilistic non-determinism
Handbook of logic in computer science (vol. 3)
Note on free algebras over continuous domains
Theoretical Computer Science
Closure Properties of a Probabilistic Domain Construction
Proceedings of the 3rd Workshop on Mathematical Foundations of Programming Language Semantics
Notions of Computation Determine Monads
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Combining Computational Effects: commutativity & sum
TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Topological and limit-space subcategories of countably-based equilogical spaces
Mathematical Structures in Computer Science
General synthetic domain theory – a logical approach
Mathematical Structures in Computer Science
A uniform approach to domain theory in realizability models
Mathematical Structures in Computer Science
Compactly generated domain theory
Mathematical Structures in Computer Science
A Convenient Category of Domains
Electronic Notes in Theoretical Computer Science (ENTCS)
Two preservation results for countable products of sequential spaces
Mathematical Structures in Computer Science
RETRACTED: Semantic Domains for Combining Probability and Non-Determinism
Electronic Notes in Theoretical Computer Science (ENTCS)
Computational Effects and Operations: An Overview
Electronic Notes in Theoretical Computer Science (ENTCS)
Probabilistic Observations and Valuations
Electronic Notes in Theoretical Computer Science (ENTCS)
Computational Effects in Topological Domain Theory
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 5.26 |
We compare how computational effects are modelled in Classical Domain Theory and Topological Domain Theory. Both of these theories provide powerful toolkits for denotational semantics: Classical Domain Theory having been introduced by Scott, and well established and developed since; Topological Domain Theory being a generalization in which topologies more general than the Scott-topology are admitted. Computational effects can be modelled using free algebra constructions, according to Plotkin and Power, and we show that for a wide range of computational effects, including all the classical powerdomains, this free algebra construction coincides in Classical and Topological Domain Theory, when restricted to countably-based continuous domains.