A probabilistic powerdomain of evaluations
Proceedings of the Fourth Annual Symposium on Logic in computer science
Cartesian closed categories of algebraic CPOs
Theoretical Computer Science
ESOP '90 Selected papers from the symposium on 3rd European symposium on programming
Probabilistic non-determinism
Power domains and second-order predicates
Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
Handbook of logic in computer science (vol. 3)
Call-by-Value and Nondeterminism
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
Power Domains and Predicate Transformers: A Topological View
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Characterising FS domains by means of power domains
Theoretical Computer Science - Domains
A characterization of partial metrizability: domains are quantifiable
Theoretical Computer Science - Topology in computer science
The correspondence between partial metrics and semivaluations
Theoretical Computer Science - Mathematical foundations of programming semantics
Mathematical Structures in Computer Science
Discrete random variables over domains
Theoretical Computer Science
IW-FM'99 Proceedings of the 3rd Irish conference on Formal Methods
Hi-index | 0.00 |
Two lower bag domain constructions are introduced: the initial construction which gives free lower monoids, and the final construction which is defined explicitly in terms of second order functions. The latter is analyzed closely. For sober dcpo's, the elements of the final lower bag domains can be described concretely as bags. For continuous domains, initial and final lower bag domains coincide. They are continuous again and can be described via a basis which is constructed from a basis of the argument domain. The lower bag domain construction preserves algebraicity and the properties I and M, but does not preserve bounded completeness, property L, or bifiniteness.