,

Wellfounded Trees and Dependent Polynomial Functors

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

Аннотация

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.

тэги

Пользователи данного ресурса

  • @t.uemura

Комментарии и рецензии