Results 1 
2 of
2
Lower Bag Domains
 Fundamenta Informaticae
, 1995
"... . 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 b ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
. 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. 1 Introduction Power domain constructions [13, 15, 16] were introduced to describe the denotational semantics of nondeterministic programming languages. A power domain construction is a domain constructor P , which maps domains to domains, together with some families of continuous operations. If X is the semantic domain ...
Semantics of Binary Choice Constructs
"... This paper is a summary of the following six publications: (1) Stable Power Domains [Hec94d] (2) Product Operations in Strong Monads [Hec93b] (3) Power Domains Supporting Recursion and Failure [Hec92] (4) Lower Bag Domains [Hec94a] (5) Probabilistic Domains [Hec94b] (6) Probabilistic Power Domains, ..."
Abstract
 Add to MetaCart
This paper is a summary of the following six publications: (1) Stable Power Domains [Hec94d] (2) Product Operations in Strong Monads [Hec93b] (3) Power Domains Supporting Recursion and Failure [Hec92] (4) Lower Bag Domains [Hec94a] (5) Probabilistic Domains [Hec94b] (6) Probabilistic Power Domains, Information Systems, and Locales [Hec94c] After a general introduction in Section 0, the main results of these six publications are summarized in Sections 1 through 6. 0 Introduction In this section, we provide a common framework for the summarized papers. In Subsection 0.1, Moggi's approach to specify denotational semantics by means of strong monads is introduced. In Subsection 0.2, we specialize this approach to languages with a binary choice construct. Strong monads can be obtained in at least two ways: as free constructions w.r.t. algebraic theories (Subsection 0.3), and by using second order functions (Subsection 0.4). Finally, formal definitions of those concepts which are used in all...