In this thesis we present a theory of quotient inductive-inductive definitions, which are inductive-inductive definitions extended with constructors for equations. The resulting theory is an improvement over previous treatments of inductive-inductive and indexed inductive definitions in that it unifies and generalises these into a single framework. The framework can also be seen as a first approximation towards a theory of higher inductive types, but done in a set truncated setting. We give the type of specifications of quotient inductive-inductive definitions mutually with its interpretation as categories of algebras. A categorical characterisation of the induction principle is given and is shown to coincide with the property of being a...
We propose a uniform, category-theoretic account of structural induction for inductively defined dat...
Homotopy Type Theory is a new field of mathematics based on the surprising and elegant correspondenc...
In an extensional setting, ? types are sufficient to construct a broad class of inductive types, but...
Martin-Löf type theory is a formal language which is used both as a foundation for mathematics and t...
Higher inductive types (HITs) in Homotopy Type Theory allow the definition of datatypes which have c...
Induction-induction is a principle for defining data types in Martin-Löf Type Theory. An inductive-i...
The theory of recursive functions where the domain of a function is inductively defined at the same ...
This article presents a new extension of inductive definitions, namely inductive-inductive definitio...
AbstractInduction–recursion is a powerful definition method in intuitionistic type theory. It extend...
Induction-recursion is a powerful definition method in intuitionistic type theory. It extends (gener...
Type theories can provide a foundational account of constructive mathematics, and for the computer s...
Inductive-inductive types (IITs) are a generalisation of inductive types in type theory. They allow ...
Higher inductive-inductive types (HIITs) generalise inductive types of dependent type theories in tw...
Intuitionistic type theory is a formal system designed by Per Martin-Loef to be a full-fledged found...
We present an internal formalisation of a type heory with dependent types in Type Theory using a spe...
We propose a uniform, category-theoretic account of structural induction for inductively defined dat...
Homotopy Type Theory is a new field of mathematics based on the surprising and elegant correspondenc...
In an extensional setting, ? types are sufficient to construct a broad class of inductive types, but...
Martin-Löf type theory is a formal language which is used both as a foundation for mathematics and t...
Higher inductive types (HITs) in Homotopy Type Theory allow the definition of datatypes which have c...
Induction-induction is a principle for defining data types in Martin-Löf Type Theory. An inductive-i...
The theory of recursive functions where the domain of a function is inductively defined at the same ...
This article presents a new extension of inductive definitions, namely inductive-inductive definitio...
AbstractInduction–recursion is a powerful definition method in intuitionistic type theory. It extend...
Induction-recursion is a powerful definition method in intuitionistic type theory. It extends (gener...
Type theories can provide a foundational account of constructive mathematics, and for the computer s...
Inductive-inductive types (IITs) are a generalisation of inductive types in type theory. They allow ...
Higher inductive-inductive types (HIITs) generalise inductive types of dependent type theories in tw...
Intuitionistic type theory is a formal system designed by Per Martin-Loef to be a full-fledged found...
We present an internal formalisation of a type heory with dependent types in Type Theory using a spe...
We propose a uniform, category-theoretic account of structural induction for inductively defined dat...
Homotopy Type Theory is a new field of mathematics based on the surprising and elegant correspondenc...
In an extensional setting, ? types are sufficient to construct a broad class of inductive types, but...