Search for dissertations about: "agda"
Showing result 1 - 5 of 13 swedish dissertations containing the word agda.
-
1. Guarded Recursive Types in Type Theory
Abstract : In total functional (co)programming valid programs are guaranteed to always produce (part of) their output in a finite number of steps.Enforcing this property while not sacrificing expressivity has beenchallenging. READ MORE
-
2. Univalent Types, Sets and Multisets : Investigations in dependent type theory
Abstract : This thesis consists of four papers on type theory and a formalisation of certain results from the two first papers in the Agda language. We cover topics such as models of multisets and sets in Homotopy Type Theory, and explore ideas of using type theory as a language for databases and different ways of expressing dependencies between terms. READ MORE
-
3. MAC, A Verified Information-Flow Control Library
Abstract : Information Flow Control (IFC) is a language-based security mechanism that tracks where data flows within a program and prevents leakage of sensitive data. IFC has been embedded in pure functional languages such as Haskell, in the form of a library, thus reducing the implementation and maintenance effort and fostering a secure-by-construction programming-model. READ MORE
-
4. Formalizing Univalent Set-Level Structures in Cubical Agda
Abstract : This licentiate thesis consists of two papers on formalization projects using Cubical Agda, a rather new extension of the Agda proof assistant with constructive support for univalence and higher inductive types. The common denominator of the two papers is that they are concerned with structures on types that are sets in the sense of Homotopy Type Theory or Univalent Foundations (HoTT/UF). READ MORE
-
5. Practical Unification for Dependent Type Checking
Abstract : When using popular dependently-typed languages such as Agda, Idris or Coq to write a proof or a program, some function arguments can be omitted, both to decrease code size and to improve readability. Type checking such a program involves inferring a combination of these implicit arguments that makes the program type-correct. READ MORE