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 157 for “"Type Theory"”.
-
Categorical type theory
Promotores : H. Barendregt en I. Moerdijk
-
Proof theoretical issues in Martin-Löf Type Theory and Homotopy Type Theory
Homotopy Type Theory (HoTT) is a quite recent branch of research in mathematical logic, which provides interesting connections among various areas of mathematics. It was first introduced by Vladimir Voevodsky as a means to develop synthetic homotopy theory, and further advancements suggested that …
-
Analysis in univalent type theory
… real analysis is developed in univalent type theory (UTT). We develop various types of real numbers, and prove several equivalences between those types. We then study computation with real numbers. It is well known how to compute with real numbers in intensional formalizations of …
-
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 …
-
Finiteness in cubical type theory
This thesis will explore and explain finiteness in constructive mathematics: using this setting, it will also serve as an introduction to constructive mathematics in Cubical Agda, and some related topics.
-
Exact couples in cubical type theory
In homotopy theory, spectral sequences are widely used tools for computing homology and cohomology groups by approximating them iteratively. Exact couples are a key algebraic abstraction at the heart of many spectral sequences, such as the Serre and Adams spectral sequences, handling the complexity …
-
Polynomial-time Martin-Lof type theory
Fragments of extensional Martin-Lof type theory without universes, $ML\sb0,$ are introduced that conservatively extend S. A. Cook and A. Urquhart's $IPV\sp\omega.$ A model for these restricted theories is obtained by interpretation in Feferman's theory APP of operators, a natural model of which is …
-
Sized dependent types via extensional type theory
… 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 and …
-
Intensional type theory for higher-order contingentism
… and vice versa. I also show that Stalnaker's theory of contingently existing propositions is in tension with his own theory of counterfactuals, but not with one of the main competing theories, proposed by David Lewis.</p> <p>Finally, I connect higher-order contingentism to expressive power …
-
Higher-dimensional realizability for intensional type theory
<p>We develop realizability models of intensional type theory, based on groupoids, wherein realizers themselves carry higher-dimensional structure. In the spirit of realizability this is intended to formalise a higher-dimensional (topological, homotopical) BHK interpretation whereby evidence for an …
-
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 …
-
Investigating abelian categories in univalent type theory
… proofs are Feit-Thompson (in finite group theory) and Kepler’s conjecture. One area of mathematics that has however been difficult to formalize is category theory because of its high level of abstraction. With the development of homotopy type theory and research on the consequences of the …
-
The Path Model of Intensional Type Theory
The groupoid interpretation of Martin-Löf type theory not only shows the independence of uniqueness of identity proofs from the axioms of intensional type theory but is also constructive and validates the computation rules as definitional equalities. The groupoid semantics are very clear when …
-
A model of Type Theory in Groupoid Assemblies
… $\GrpA{A}$ showing the category to be a model of type theory. We also show that $\GrpA{A}$ has $W$-types with reductions and univalent object classifier for assemblies and modest assemblies, where the latter is an impredicative object classifier. Using the $W$-types with reductions, we show that …
-
Towards a Bezout-type Theory of Affine Varieties
… for P). Moreover, we show that there are `finite type' completions with the latter property, i.e. determined by the maximum of a finite number of `semidegrees', by which we mean degree like functions that send products into sums. We characterize the latter type completions as the ones for which …
-
Partial functions and recursion in univalent type theory
… investigate partial functions and computability theory from within a constructive, univalent type theory. The focus is on placing computability into a larger mathematical context, rather than on a complete development of computability theory. We begin with a treatment of partial functions, using …
Page 1 of 8