Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 20 for “"dependent type theory"”.

  1. Formalization of Opaque Definitions for a Dependent Type Theory

    … by restricting the unfolding of definitions at type-checking time, but their implementation demands some subtlety—for instance, subject reduction may be lost if an opaque type definition doesn’t unfold in exactly the right way. Despite this, there has been relatively little work on formally …

    chalmers Repository record for Formalization of Opaque Definitions for a Dependent Type Theory (opens in a new tab)

  2. A Haskell Implementation for a Dependent Type Theory with Definitions

    We present in this paper a simple dependently typed language. This language could be viewed as a pure -calculus extended with dependent types and definitions. The focus of this project is on the study of a definition mechanism where the definitions of constants could be handled efficiently during …

    chalmers Repository record for A Haskell Implementation for a Dependent Type Theory with Definitions (opens in a new tab)

  3. Models of Dependent Type Theory from Algebraic Weak Factorisation Systems

    … systems provide models of Martin-L ̈of dependent type theory. To this end, we develop the notion of a type-theoretic awfs; this is a category equipped with an algebraic weak factorisation system and some additional structure, such that after performing a splitting procedure, a model of …

    whiterose Download PDF for Models of Dependent Type Theory from Algebraic Weak Factorisation Systems (opens in a new tab)

  4. In search of effectful dependent types

    … Logical frameworks rely on predicates, or dependent types, to express detailed logical properties about entities. According to the Curry-Howard correspondence, programming languages and logical frameworks should be very closely related. However, a language that has both good support for …

    oxford Repository record for In search of effectful dependent types (opens in a new tab)

  5. A continuous computational interpretation of type theories

    … provides a computational interpretation of type theory validating Brouwer’s uniform-continuity principle that all functions from the Cantor space to natural numbers are uniformly continuous, so that type-theoretic proofs with the principle as an assumption have computational content. For …

    birmingham Download PDF for A continuous computational interpretation of type theories (opens in a new tab)

  6. Type inference, Haskell and dependent types

    This thesis studies questions of type inference, unification and elaboration for languages that combine dependent type theory and functional programming. Languages such as modern Haskell have very expressive type systems, allowing the programmer a great deal of freedom. These require advanced type …

    strathclyde Repository record for Type inference, Haskell and dependent types (opens in a new tab)

  7. L-Fuzzy Relations in Coq

    … prover based on Higher-Order Logic (HOL) with dependent types. This implementation can be used to specify and develop correct software based on L-fuzzy relations such as fuzzy controllers. We give an overview of lattices, L-fuzzy relations, category theory and dependent type theory before …

    brock Repository record for L-Fuzzy Relations in Coq (opens in a new tab)

  8. Type Theoretic Methods for Higher Structures

    … study of higher structures through the lens of dependent type theory and categorical logic. We distinguish two main themes, but type theory can be seen as the common ground. The first part presents some aspects of the theory of (∞,1)-categories in the framework of simplicial homotopy type theory …

    ottawa-retro Repository record for Type Theoretic Methods for Higher Structures (opens in a new tab)

  9. Globular multicategories with homomorphism types

    … of globular multicategory with homomorphism types. We develop a higher dimensional modules construction that constructs globular multicategories with strict homomorphism types. We illustrate how this construction is related to iterated enrichment. We show how various collections of “higher …

    oxford Repository record for Globular multicategories with homomorphism types (opens in a new tab)

  10. On Initial Categories with Families Formalization of unityped and simply typed CwFs in Agda

    This thesis explores a categorical model of type theory, namely, categories with families who provide a model for a basic framework of dependent type theory. The notion of a category with families is formalized as a generalized algebraic theory with extra structure with the purpose of modelling …

    chalmers Repository record for On Initial Categories with Families Formalization of unityped and simply typed CwFs in Agda (opens in a new tab)

  11. Design and Implementation of Family Polymorphism for Interactive Theorem Proving

    … language design geared towards extensible metatheory mechanization in a proof assistant. The new design achieves reuse and extensibility via a form of family polymorphism, an object-oriented idea, that allows code and proofs to be polymorphic to their enclosing families. Our development …

    waterloo Repository record for Design and Implementation of Family Polymorphism for Interactive Theorem Proving (opens in a new tab)

  12. Methods for using Agda to prove Safety and Liveness for Concurrent Programs

    … develop such proofs, a modern implementation of dependent type theory, the proof checking tool Agda [Nor09], is used. The methods are based on the semi-formal theory of the semantics of concurrent programming from [OL82] (Owicki and Lamport, 1981);. The formalisation and implementation in Agda is …

    chalmers Repository record for Methods for using Agda to prove Safety and Liveness for Concurrent Programs (opens in a new tab)

  13. Irrelevance, Polymorphism, and Erasure in Type Theory

    Dependent type theory is a proven technology for verified functional programming in which programs and their correctness proofs may be developed using the same rules in a single formal system. In practice, large portions of programs developed in this way have no computational relevance to the …

    portland-state Repository record for Irrelevance, Polymorphism, and Erasure in Type Theory (opens in a new tab)

  14. A framework for semiring-annotated type systems

    … range of satisfactory implementations of simply typed calculi in proof assistants based on dependent type theory. In this thesis, I extend an account of Simply Typed ?-calculus so as to be able to represent and reason about calculi whose variables have restricted usage patterns. Examples of such …

    strathclyde Repository record for A framework for semiring-annotated type systems (opens in a new tab)

  15. Combinatorial presentations of string diagrams for non-symmetric monoidal categories

    … case of graphs embedded in the plane in the dependently typed programming language Agda. We develop a suitable, inductive, and finite representation of plane graphs in the setup of Agda’s dependent type theory. We show how splitting a graph into a substructure of interest and its context, …

    strathclyde Repository record for Combinatorial presentations of string diagrams for non-symmetric monoidal categories (opens in a new tab)

  16. Compositional lexical networks: a case study of the English spatial adjectives

    … sense connections. However, lexical network theory is not compositional: it does not explain how lexical networks are combined together to yield the meanings of phrases and sentences. The aim of this thesis is to develop lexical network theory in a formal, compositional setting. I argue that …

    oxford Repository record for Compositional lexical networks: a case study of the English spatial adjectives (opens in a new tab)

  17. A cosmology of datatypes : reusability and dependent types

    This dissertation defends the idea of a closed dependent type theory whose inductive types are encoded in a universe. Each inductive definition arises by interpreting its description - itself a firstclass citizen in the type theory. Datatype-generic programming thus becomes ordinary programming. …

    strathclyde Repository record for A cosmology of datatypes : reusability and dependent types (opens in a new tab)

  18. Proof Repair

    … can leverage new and existing results in dependent type theory. For example, one transformation externalizes univalent transport from homotopy type theory, leveraging novel transformations over equalities to make this possible. This approach is realized inside of a proof repair tool suite …

    washington Repository record for Proof Repair (opens in a new tab)

  19. Sized dependent types via extensional type theory

    Many contemporary proof assistants based on dependent type theories such as Coq and Agda are founded on the types-as-propositions paradigm where type checking a program corresponds to verifying a proof of some proposition in a higher-order predicate logic. To ensure decidability of type checking …

    ubc Repository record for Sized dependent types via extensional type theory (opens in a new tab) Download PDF for Sized dependent types via extensional type theory (opens in a new tab)

  20. Computing spaces in type theory

    … case studies computing with and in cubical type theory.</p> <p>We begin by setting up a framework to compute with sets in the theorem prover Cubical Agda. Using the example of the powerset, we show how both mathematical <em>definitions</em> and <em>programs</em> can be expressed and related …

    oxford Repository record for Computing spaces in type theory (opens in a new tab)