Wellfounded Trees and Dependent Polynomial Functors

Nicola Gambino, Nicola Gambino, Martin Hyland

Risultato della ricerca: Otherpeer review

53 Citazioni (Scopus)

Abstract

We set out to study the consequences of the assumption of types of wellfounded trees in dependent type theories. We do so by in- vestigating 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 cat- egories.
Lingua originaleEnglish
Numero di pagine15
Stato di pubblicazionePublished - 2004

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Entra nei temi di ricerca di 'Wellfounded Trees and Dependent Polynomial Functors'. Insieme formano una fingerprint unica.

Cita questo