Wellfounded Trees and Dependent Polynomial Functors (2004)
by
Nicola Gambino
,
Martin Hyland
| Venue: | OF LECTURE NOTES IN COMPUTER SCIENCE |
| Citations: | 20 - 4 self |
BibTeX
@INPROCEEDINGS{Gambino04wellfoundedtrees,
author = {Nicola Gambino and Martin Hyland},
title = {Wellfounded Trees and Dependent Polynomial Functors},
booktitle = {OF LECTURE NOTES IN COMPUTER SCIENCE},
year = {2004},
pages = {210--225},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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.
