Search for dissertations about: "coalgebra"

Found 2 swedish dissertations containing the word coalgebra.

2. 1. 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

4. 2. Relations in Models of Calculi and Logics with Names

   Author : Kidane Yemane; Björn Victor; John Power; Uppsala universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Process Calculi; Syntax; Semantics; HD-automata; Logic; Category theory; Computer engineering; Datorteknik;

   Abstract : In this thesis we investigate two operational models of name-passing calculi: one based on coalgebra, and one based on enriched automata. We develop a semantic framework for modelling the open bisimulation in π-calculus, hyperbisimulation in Fusion calculus, and the first semantic interpretation of FOλ(nabla) logic. READ MORE