All Outputs (2)

Extending Homotopy Type Theory with Strict Equality (2016)
Conference Proceeding
Altenkirch, T., Capriotti, P., & Kraus, N. (2016). Extending Homotopy Type Theory with Strict Equality. In 25th EACSL Annual Conference on Computer Science Logic (21:1-21:17). https://doi.org/10.4230/LIPIcs.CSL.2016.21

In homotopy type theory (HoTT), all constructions are necessarily stable under homotopy equivalence. This has shortcomings: for example, it is believed that it is impossible to define a type of semi-simplicial types. More generally, it is difficult a... Read More about Extending Homotopy Type Theory with Strict Equality.

Constructions with Non-Recursive Higher Inductive Types (2016)
Conference Proceeding
Kraus, N. (2016). Constructions with Non-Recursive Higher Inductive Types. In LICS '16: Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science (595-604). https://doi.org/10.1145/2933575.2933586

© 2016 ACM. Higher inductive types (HITs) in homotopy type theory are a powerful generalization of inductive types. Not only can they have ordinary constructors to define elements, but also higher constructors to define equalities (paths). We say tha... Read More about Constructions with Non-Recursive Higher Inductive Types.