Sökning: "axiomatic domain theory"

Hittade 2 avhandlingar innehållade orden axiomatic domain theory.

  1. 1. Primitive Direcursion and Difunctorial Semantics of Typed Object Calculus

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

    Sammanfattning : 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. LÄS MER

  3. 2. Inverse Problems in Analytic Interpolation for Robust Control and Spectral Estimation

    Författare :Johan Karlsson; Anders Lindquist; Alberto Isidori; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Nevanlinna-Pick Interpolation; Approximation; Model Reduction; Robust Control; Gap-robustness; Sensitivity Shaping; Entropy functional; Spectral Estimation; Weak*-topology; Monge-Kantorovic Transportation; Optimization; systems theory; Optimeringslära; systemteori;

    Sammanfattning : This thesis is divided into two parts. The first part deals with theNevanlinna-Pick interpolation problem, a problem which occursnaturally in several applications such as robust control, signalprocessing and circuit theory. We consider the problem of shaping andapproximating solutions to the Nevanlinna-Pick problem in a systematicway. LÄS MER