Wellfounded Trees and Dependent Polynomial Functors

We set out to study the consequences of the assumption of types of wellfounded trees in dependent type theories. We do so by investigating the categorical notion of wellfounded tree introduced in [16]. Our main result shows that wellfounded trees allow us to define initial algebras for a wide class of endofunctors on locally cartesian closed categories.

[1]  S. Lane.  Categories for the Working Mathematician , 1971 .

[2]  Thorsten Altenkirch,et al.  Foundations of Software Science and Computation Structures: 6th International Conference, FOSSACS 2003 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2003 Warsaw, Poland, April 7–11, 2003 Proceedings , 2003, Lecture Notes in Computer Science.

[3]  J. Paris,et al.  The Type Theoretic Interpretation of Constructive Set Theory , 1978 .

[4]  Peter Freyd,et al.  Aspects of topoi , 1972, Bulletin of the Australian Mathematical Society.

[5]  Erik Palmgren,et al.  Wellfounded trees in categories , 2000, Ann. Pure Appl. Log..

[6]  Peter Aczel,et al.  The Type Theoretic Interpretation of Constructive Set Theory: Inductive Definitions , 1986 .

[7]  M. Barr.  Coequalizers and free triples , 1970 .

[8]  Bengt Nordström,et al.  Programming in Martin-Löf's Type Theory , 1990 .

[9]  Per Martin-Löf,et al.  Intuitionistic type theory , 1984, Studies in proof theory.

[10]  Martin Hofmann,et al.  On the Interpretation of Type Theory in Locally Cartesian Closed Categories , 1994, CSL.

[11]  R. Seely,et al.  Locally cartesian closed categories and type theory , 1984, Mathematical Proceedings of the Cambridge Philosophical Society.

[12]  G. M. Kelly,et al.  BASIC CONCEPTS OF ENRICHED CATEGORY THEORY , 2022, Elements of ∞-Category Theory.

[13]  R. Street,et al.  Review of the elements of 2-categories , 1974 .

[14]  Peter Dybjer,et al.  Representing Inductively Defined Sets by Wellorderings in Martin-Löf's Type Theory , 1997, Theor. Comput. Sci..

[15]  M. Barr,et al.  Toposes, Triples and Theories , 1984 .

[16]  G. Kelly.  A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on , 1980, Bulletin of the Australian Mathematical Society.

[17]  Laurent Regnier,et al.  The differential lambda-calculus , 2003, Theor. Comput. Sci..

[18]  Michael Rathjen,et al.  The strength of some Martin-Löf type theories , 1994, Arch. Math. Log..

[19]  S. Lack,et al.  The formal theory of monads II , 2002 .