Search for dissertations about: "denotational semantics"

Showing result 1 - 5 of 10 swedish dissertations containing the words denotational semantics.

2. 1. Denotational Semantics for Asynchronous Concurrent Languages

   Author : Sven-Olof Nyström; Bengt Jonsson; Uppsala universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Datalogi; Computing Science;

   Abstract : .... READ MORE

4. 2. Primitive Direcursion and Difunctorial Semantics of Typed Object Calculus

   Author : Johan Glimming; Karl Meinke; John Power; Stockholms universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; denotational semantics; axiomatic domain theory; coalgebra; primitive co recursion; object-based programming; typed object calculus; Computer science; Datavetenskap; datalogi; Computer Science;

   Abstract : In the first part of this thesis, we contribute to the semantics of typed object calculus by giving (a) a category-theoretic denotational semantics using partial maps making use of an algebraic compactness assumption, (b) a notion of "wrappers'' by which algebraic datatypes can be represented as object types, and (c) proofs of computational soundness and adequacy of typed object calculus via Plotkin's FPC (with lazy operational semantics), thus making models of FPC suitable also for first-order typed object calculus (with recursive objects supporting method update, but not subtyping). It follows that a valid equation in the model induces operationally congruent terms in the language, so that program algebras can be studied. READ MORE

5. 3. Types for Crash Preventionn

   Author : Lars Pareto; Chalmers tekniska högskola; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; reliability; dependability; concurrent programming; denotational semantics; real-time systems and embedded systems; data-flow; dynamic storage management; applicative functional programming languages ; type systems;

   Abstract : This thesis seeks to strengthen the capabilities of static polymorphic type-checking (as known from typed lambda calculus and functional programming) to allow a larger class of programming errors to be caught at compile time: the goal is to not only prevent illegal uses of data, but to also errors that lead to busy-loops, deadlocks, stack-overflows and heap-overflows. The thesis exploits that, for recursive programs, many correctness properties (including freedom from errors leading to busy-loops, etc. READ MORE

6. 4. Compiler generation for parallel languages from denotational specifications

   Author : Johan Ringström; Linköpings universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES;

   Abstract : There exist several systems for the generation of compiler front-ends from formal semantics. Systems that generate entire compilers have also started to appear. Many of these use attribute grammars as the specification formalism, but there also are systems based on operational semantics or denotational semantics. READ MORE

7. 5. Compiler Generation for Data-Parallel Programming Languages from Two-Level Semantics Specifications

   Author : Johan Ringström; Linköpings universitet; []
   Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

   Abstract : This thesis is an empirical study of compiler generation for data-parallel languages from denotational-semantics-based formal specifications. We investigate whether compiler generation from such specifications is practical, not only with respect to generation of practical compilers, but also with respect to compilation of programs into efficient code and execution of the compiled programs on massively parallel SIMD (Single Instruction Multiple Data) architectures. READ MORE