Event structures and domains

AbstractIn the theory of denotational semantics, we study event structures which generalize Kahn and Plotkin's concrete data structures and which model computational processes. With each event structure we associate canonically an event domain (a particular algebraic complete partial order), and conversely we derive a representation result for event domains. For a particular class of event structures, the canonical event structures, we obtain that any two canonical event structures are isomorphic iff they have order-isomorphic canonical domains

Non-deterministic information systems and their domains

AbstractIn the theory of denotational semantics of programming languages Dedekind-complete, algebraic partial orders (domains) frequently have been considered since Scott's and Strachey's fundamental work in 1971 (Stoy, 1977). As Scott (1982) showed, these domains can be represented canonically by (deterministic) information systems. However, recently, more complicated constructions (such as power domains) have led to more general domains (Plotkin, 1976; Smyth and Plotkin, 1977; Smyth, 1983). We introduce non-deterministic information systems and establish the representation theorem similar to Scott (1982) for these more general domains. This result will be the basis for solving recursive domain equations