In the refinement calculus, monotonic predicate transformers are used to model specifications for (imperative) programs. Together with a natural notion of simulation, they form a...
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...
Abstract: Denotational semantics is a powerful technique to formally define programming languages. However, language constructs are not always orthogonal, so many semantic equation...
Progress, Extended Abstract) Philippe Jorrand1 Simon Perdrix2 Leibniz Laboratory IMAG-INPG Grenoble, France The aim of this paper is to introduce a general model of quantum comput...
We give a denotational semantics to a region-based effect system tracking reading, writing and allocation in a higher-order language with dynamically allocated integer references....
Nick Benton, Andrew Kennedy, Lennart Beringer, Mar...