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. © Springer-Verlag 2004.
Cite
CITATION STYLE
APA
Gambino, N., & Hyland, M. (2004). Wellfounded Trees and Dependent Polynomial Functors. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3085, 210–225. https://doi.org/10.1007/978-3-540-24849-1_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free