Publication date
January 2010
DOI Publisher
Springer Science and Business Media LLC ISSN
0302-9743 Citation count (estimate)
18Abstract
This article presents a new extension of inductive definitions, namely inductive-inductive definitions
This article presents a new extension of inductive definitions, namely inductive-inductive definitions
Higher inductive-inductive types (HIITs) generalise inductive types of dependent type theories in tw...
Abstract Induction-recursion is a schema which formalizes the principles for introducing new sets in...
The fundamental burden of a theory of inductive inference is to determine which are the good inducti...
We present a principle for introducing new types in type theory which generalises strictly positive ...
In this thesis we present a theory of quotient inductive-inductive definitions, which are inductive-...
Induction-induction is a principle for defining data types in Martin-Löf Type Theory. An inductive-i...
Martin-Löf type theory is a formal language which is used both as a foundation for mathematics and t...
AbstractAn indexed inductive definition (IID) is a simultaneous inductive definition of an indexed f...
The theory of recursive functions where the domain of a function is inductively defined at the same ...
Induction-induction is a priciple for mutually defining data types A : Set and B : A Set. Both A and...
In the past, there have been several attempts to explain logic programming under the well-founded ...
Type theories can provide a foundational account of constructive mathematics, and for the computer s...
Higher inductive types (HITs) in Homotopy Type Theory allow the definition of datatypes which have c...
This dissertation deals with constructive languages: languages for the formal expression of mathemat...
The goal of this paper is to extend classical logic with a generalized notion of inductive definitio...
Higher inductive-inductive types (HIITs) generalise inductive types of dependent type theories in tw...
Abstract Induction-recursion is a schema which formalizes the principles for introducing new sets in...
The fundamental burden of a theory of inductive inference is to determine which are the good inducti...
We present a principle for introducing new types in type theory which generalises strictly positive ...
In this thesis we present a theory of quotient inductive-inductive definitions, which are inductive-...
Induction-induction is a principle for defining data types in Martin-Löf Type Theory. An inductive-i...
Martin-Löf type theory is a formal language which is used both as a foundation for mathematics and t...
AbstractAn indexed inductive definition (IID) is a simultaneous inductive definition of an indexed f...
The theory of recursive functions where the domain of a function is inductively defined at the same ...
Induction-induction is a priciple for mutually defining data types A : Set and B : A Set. Both A and...
In the past, there have been several attempts to explain logic programming under the well-founded ...
Type theories can provide a foundational account of constructive mathematics, and for the computer s...
Higher inductive types (HITs) in Homotopy Type Theory allow the definition of datatypes which have c...
This dissertation deals with constructive languages: languages for the formal expression of mathemat...
The goal of this paper is to extend classical logic with a generalized notion of inductive definitio...
Higher inductive-inductive types (HIITs) generalise inductive types of dependent type theories in tw...
Abstract Induction-recursion is a schema which formalizes the principles for introducing new sets in...
The fundamental burden of a theory of inductive inference is to determine which are the good inducti...
Add to ORKG