This paper adds the technique of chain completion to the setting of [MCB94]. We develop the theory of chain completion Ch(V) of a domain V and show how this completion relates to metric and ideal completion. Especially we study consistency results for denotational semantics on D, Ch(V) and Idl(V).

We recast Milner's work on SCCS, a calculus for nite but unbounded delay based on SCCS, by giving a denotational semantics for admissibility of innnite computations on a biinite domain K. Using Abramsky's SFP domain D for bisimulation we obtain a fully abstract model in D K for an operational pre-order which generalizes Milner's fortiication. Our preorder includes divergence and its restriction...

Verification techniques for C11 programs have advanced significantly in recent years with the development of operational semantics and associated logics increasingly large fragments C11. However, these been developed a restricted setting to avoid thin-air-read problem. In this article, we propose an that leverages intra-thread partial order (called semantic dependencies ) induced by recently de...

Real-time process algebra (RTPA) is a form of denotational mathematics for dealing with fundamental system behaviors such as timing, interrupt, concurrency, and event/time/interrupt-driven system dispatching. Because some key RTPA processes cannot be described adequately in conventional denotational semantic paradigms, a new framework for modeling time and processes is sought in order to repres...

A comprehensive semantics for functional programs is presented, which generalizes the well-known call-by-value and call-by-name semantics. By permitting a separate choice between call-by value and call-by-name for every argument position of every function and parameterizing the semantics by this choice we abstract from the parameter-passing mechanism. Thus common and distinguishing features of ...

In his seminal paper “A Natural Semantics for Lazy Evaluation”, John Launchbury proves his semantics correct with respect to a denotational semantics, and outlines a proof of adequacy. Previous attempts to rigorize the adequacy proof, which involves an intermediate natural semantics and an intermediate resourced denotational semantics, have failed. We devised a new, direct proof that skips the ...

-The addition of context free grammar rules to a functional language simplifies the construction of interpreters from denotationaI semantic language definitions. Functional abstraction over grammar rules enables the specification and processing of context sensitive language syntax aspects in a functional style. DenotatLonaI semantics Language design Language implementation Functional language G...

In a previous work with Antonio Bucciarelli, we introduced indexed linear logic as a tool for studying and enlarging the denotational semantics of linear logic. In particular, we showed how to define new denotational models of linear logic using symmetric product phase models (truth-value models) of indexed linear logic. We present here a strict extension of indexed linear logic for which symme...