A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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 anddoi:10.1016/0890-5401(89)90065-5 fatcat:2ruohpgndjfv5cejstx2dwpxie