Recursive domain equations for concrete data structures

Manfred Droste
1989 Information and Computation  
In the theory of denotational semantics of programming languages, we study event structures which combine features of Scott's information systems and Kahn and Plotkin's concrete data structures and model computational processes. We show that a simple approximation concept for event structures allows us to obtain straightforward solutions of recursive domain equations for event domains. From this, we derive a generalization of corresponding theorems of Kahn and Plotkin respectively Berry and
more » ... en for concrete data structures and concrete domains.
doi:10.1016/0890-5401(89)90065-5 fatcat:2ruohpgndjfv5cejstx2dwpxie