The article deals with the denotational semantics of a special query language called XML-Lambda, which is based on the simply typed lambda calculus. Such semantics allows experimentation with a language definition, prototyping of programs, and similar experiments.

McCarthy’s amb operator has no known denotational semantics, and its basic operational properties the context lemma, the compatibility of refinement similarity and convex bisimilarity have long been open. In this paper, we give a single example program that demonstrates the failure of each of these properties. This shows that there cannot be any well-pointed denotational semantics. However, we ...

We present a semantic framework for logic programs based on first-order hereditary Harrop formulas. The denotational and operational semantics are defined in a uniform way by characterizing some basic algebraic operators, which are directly related to the syntactic structure of the language. This allows us to address problems such as the relation between the operational semantics and the denota...

Classical Linear Logic (CLL) has long inspired readings of its proofs as communicating processes. Wadler’s CP calculus is one of these readings. Wadler gave CP an operational semantics by selecting a subset of the cut-elimination rules of CLL to use as reduction rules. This semantics has an appealing close connection to the logic, but does not resolve the status of the other cut-elimination rul...

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 parameterpassing mechanism. Thus common and distinguishing features of a...

Recognising language design as a valid programming paradigm should have widespread benefits e.g. for the development of CASE tools. This validity is demonstrated both pragmatically and formally. The pragmatic justification derives from matching the patterns of usage and quality assessment of programming languages on the one hand, with corresponding patterns for the output of the ‘‘programming’’...

For an abstract programming language with action reenement both an operational and a denotational semantics are given. The operational semantics is based on an SOS-style transition system speciication involving syntactical reenement sequences. The denotational semantics is an interleaving model which uses semantical reenementènvironments'. It identiies those statements which are equal under all...

The Rosetta systems level design language [1, 2] is an emerging standard designed to address the integration of information across domains. Specifically, Rosetta directly supports specifying and integrating models whose basic computation models differ due to technology domain. Rosetta achieves this by providing a framework where models of computation and domain specific information can be defin...

This paper gives an introduction to and overview of the functional quantum programming language QML. The syntax of this language is defined and explained, along with a new QML definition of the quantum teleport algorithm. The categorical operational semantics of QML is also briefly introduced, in the form of annotated quantum circuits. This definition leads to a denotational semantics, given in...