In this paper we explain how recursion operators can be used to structure and reason about program semantics within a functional language. In particular, we show how the recursion...
Traditionally, the various semantics of the process algebra Csp are formulated in denotational style. For many Csp models, e.g., the traces model, equivalent semantics have been gi...
This is a follow-on to my 1988PLDIpaper, “Control-Flow Analysis e”[9]. Iusethe methodofabstractsemanticinterpretations to explicate the control-flow analysis technique presen...
This paper offers an account of the semantics of count nous. I show that neither the atomic/nonatomic distinction nor the homogeneous/non-homogeneous distinction is sufficient to ...
Past attempts to relate two well-known models of backtracking computation have met with only limited success. We relate these two models using logical relations. We accommodate hi...