The “classical” paradigm for denotational semantics models data types as domains, i.e. structured sets of some kind, and programs as (suitable) functions between domains. The semantic universe in which the denotational modelling is carried out is thus a category with domains as objects, functions as morphisms, and composition of morphisms given by function composition. A sharp distinction is th...

One goal of model-driven development (MDD) is automated code generation, which is ultimately a type of model transformation. Current approaches to such transformations are often rule-based, implying a focus on operational semantics. We explore an approach based on denotational semantics in this paper. First, we construct a denotational semantics for elements of a modeling language based on the ...

This paper presents a formalization using Object-Z of the State Machine package in the UML metamodel. In the specification, the abstract syntax and the static and dynamic semantics for each individual model construct in the package are grouped together and encapsulated within a single Object-Z class. For formalizing the dynamic semantics, a denotational semantics of the construct is first given...

For programming languages whose denotational semantics uses xed points of domain constructors of mixed variance, proofs of correspondence between operational and denotational semantics (or between two diierent denotational semantics) often depend upon the existence of relations speciied as the xed point of non-monotonic operators. This paper describes a new approach to constructing such relatio...

We present a denotational continuation semantics for Prolog with cut. First a uniform language B is studied, which captures the control flow aspects of Prolog. The denotational semantics for B is proven equivalent to a transition system based operational semantics. The congruence proof relies on the representation of the operational semantics as a chain of approximations and on a convenient ind...