A dependently-typed construction of semi-simplicial types - Inria - Institut national de recherche en sciences et technologies du numérique
Journal Articles Mathematical Structures in Computer Science Year : 2015

A dependently-typed construction of semi-simplicial types

Abstract

This paper presents a dependently-typed construction of semi-simplicial sets in type theory where sets are taken to be types. This addresses an open question raised on the wiki of the special year on Univalent Foundations at the Institute of Advanced Study (2012-2013).

Domains

Logic [math.LO] Algebraic Topology [math.AT] Logic in Computer Science [cs.LO]
Fichier principal
Vignette du fichier
simplicial-revise-final.pdf (315.43 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive

Hugo Herbelin  : Connect in order to contact the contributor

https://inria.hal.science/hal-00935446

Submitted on : Thursday, January 23, 2014-3:15:42 PM

Last modification on : Thursday, March 14, 2024-3:10:22 AM

Long-term archiving on : Thursday, April 24, 2014-12:10:22 PM

Download

Dates and versions

hal-00935446 , version 1 (23-01-2014)

Licence

Attribution

Identifiers

Cite

Hugo Herbelin. A dependently-typed construction of semi-simplicial types. Mathematical Structures in Computer Science, 2015, From type theory and homotopy theory to Univalent Foundations of Mathematics, 25 (Special issue 05), pp.16. ⟨10.1017/S0960129514000528⟩. ⟨hal-00935446⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-PARIS7 PPS CNRS INRIA INRIA2
194 View
165 Download

Altmetric

Share

More