Incollection,

Wellfounded Trees and Dependent Polynomial Functors

, and .
Types for Proofs and Programs, volume 3085 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2004)
DOI: 10.1007/978-3-540-24849-1_14

Abstract

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.

Tags

Users

  • @t.uemura

Comments and Reviews