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.
Beschreibung
Wellfounded Trees and Dependent Polynomial Functors - Springer
%0 Book Section
%1 gambino2004wellfounded
%A Gambino, Nicola
%A Hyland, Martin
%B Types for Proofs and Programs
%D 2004
%E Berardi, Stefano
%E Coppo, Mario
%E Damiani, Ferruccio
%I Springer Berlin Heidelberg
%K dependent functor polynomial type wellfounded
%P 210-225
%R 10.1007/978-3-540-24849-1_14
%T Wellfounded Trees and Dependent Polynomial Functors
%U http://dx.doi.org/10.1007/978-3-540-24849-1_14
%V 3085
%X 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.
%@ 978-3-540-22164-7
@incollection{gambino2004wellfounded,
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.},
added-at = {2014-11-25T12:34:00.000+0100},
author = {Gambino, Nicola and Hyland, Martin},
biburl = {https://www.bibsonomy.org/bibtex/239065a54d73d592774df291194631847/t.uemura},
booktitle = {Types for Proofs and Programs},
description = {Wellfounded Trees and Dependent Polynomial Functors - Springer},
doi = {10.1007/978-3-540-24849-1_14},
editor = {Berardi, Stefano and Coppo, Mario and Damiani, Ferruccio},
interhash = {f706ed62886e91ea48e86d5ef6cfa2e6},
intrahash = {39065a54d73d592774df291194631847},
isbn = {978-3-540-22164-7},
keywords = {dependent functor polynomial type wellfounded},
language = {English},
pages = {210-225},
publisher = {Springer Berlin Heidelberg},
series = {Lecture Notes in Computer Science},
timestamp = {2014-11-25T12:34:00.000+0100},
title = {Wellfounded Trees and Dependent Polynomial Functors},
url = {http://dx.doi.org/10.1007/978-3-540-24849-1_14},
volume = 3085,
year = 2004
}