Fredrik Nordvall Forsberg

Learn More
Induction-induction is a principle for defining data types in Martin-Löf Type Theory. An inductive-inductive definition consists of a set A, together with an A-indexed family B : A Ñ Set, where both A and B are inductively defined in such a way that the constructors for A can refer to B and vice versa. In addition, the constructors for B can refer to the(More)
Minlog is a proof assistant which automatically extracts computational content in an extension of Gödel's T from formalized proofs. We report on extending Minlog to deal with predicates defined using a particular combination of induction and coinduction, via so-called nested definitions. In order to increase the efficiency of the extracted programs, we have(More)
In the 1980s, John Reynolds postulated that a parametrically polymorphic function is an ad-hoc polymorphic function satisfying a uniformity principle. This allowed him to prove that his set-theoretic semantics has a relational lifting which satisfies the Identity Extension Lemma and the Abstraction Theorem. However, his definition (and subsequent variants)(More)
This paper combines reflexive-graph-category structure for relational parametricity with fibrational models of impredicative poly-morphism. To achieve this, we modify the definition of fibrational model of impredicative polymorphism by adding one further ingredient to the structure: comprehension in the sense of Lawvere. Our main result is that such(More)
In type theory one usually defines data types inductively. Over the years, many principles have been invented, such as inductive families , and inductive-recursive and inductive-inductive definitions. More recently, higher inductive types have been proposed in the context of homotopy type theory. Specific instances of higher in-ductive types have been(More)