AbstractWe prove that every strictly positive endofunctor on the category of sets generated by Martin-Löf's extensional type theory has an initial algebra. This representation of inductively defined sets uses essentially the wellorderings introduced by Martin-Löf in “Constructive Mathematics and Computer Programming”
Abstract. One of the many results which makes Joachim Lambek famous is: an initial algebra of an end...
We analyze some extensions of Martin-L\uf6f's constructive type theory by means of extensional set c...
We propose a uniform, category-theoretic account of structural induction for inductively defined dat...
We prove that every strictly positive endofunctor on the category of sets generated by Martin-Lof&ap...
AbstractWe prove that every strictly positive endofunctor on the category of sets generated by Marti...
AbstractInduction–recursion is a powerful definition method in intuitionistic type theory. It extend...
We give a short introduction to Martin-L\uf6f\u27s Type Theory, seen as a theory of inductive defini...
Martin-Lof's type theory is presented in several steps. The kernel is a dependently typed -calc...
Induction-recursion is a powerful definition method in intuitionistic type theory. It extends (gener...
We investigate inductive types in type theory, using the insights provided by homotopy type theory a...
Abstract. We show that strictly positive inductive types, constructed from polynomial functors, cons...
We present a principle for introducing new types in type theory which generalises strictly positive ...
AbstractAn indexed inductive definition (IID) is a simultaneous inductive definition of an indexed f...
International audienceInductive-inductive types (IITs) are a generalisation of inductive types in ty...
AbstractWe present well-ordering proofs for Martin-Löf's type theory with W-type and one universe. T...
Abstract. One of the many results which makes Joachim Lambek famous is: an initial algebra of an end...
We analyze some extensions of Martin-L\uf6f's constructive type theory by means of extensional set c...
We propose a uniform, category-theoretic account of structural induction for inductively defined dat...
We prove that every strictly positive endofunctor on the category of sets generated by Martin-Lof&ap...
AbstractWe prove that every strictly positive endofunctor on the category of sets generated by Marti...
AbstractInduction–recursion is a powerful definition method in intuitionistic type theory. It extend...
We give a short introduction to Martin-L\uf6f\u27s Type Theory, seen as a theory of inductive defini...
Martin-Lof's type theory is presented in several steps. The kernel is a dependently typed -calc...
Induction-recursion is a powerful definition method in intuitionistic type theory. It extends (gener...
We investigate inductive types in type theory, using the insights provided by homotopy type theory a...
Abstract. We show that strictly positive inductive types, constructed from polynomial functors, cons...
We present a principle for introducing new types in type theory which generalises strictly positive ...
AbstractAn indexed inductive definition (IID) is a simultaneous inductive definition of an indexed f...
International audienceInductive-inductive types (IITs) are a generalisation of inductive types in ty...
AbstractWe present well-ordering proofs for Martin-Löf's type theory with W-type and one universe. T...
Abstract. One of the many results which makes Joachim Lambek famous is: an initial algebra of an end...
We analyze some extensions of Martin-L\uf6f's constructive type theory by means of extensional set c...
We propose a uniform, category-theoretic account of structural induction for inductively defined dat...
DOI
Add to ORKG