Formalising inductive and coinductive containers
From MaRDI portal
Cites work
- A fixpoint theorem for complete categories
- Categories of containers
- Containers: Constructing strictly positive types
- Cubical Agda: a dependently typed programming language with univalence and higher inductive types
- Cubical type theory: a constructive interpretation of the univalence axiom
- Higher Structures in Homotopy Type Theory
- Homotopy type theory. Univalent foundations of mathematics
- scientific article; zbMATH DE number 3859117 (Why is no real title available?)
- scientific article; zbMATH DE number 3910392 (Why is no real title available?)
- scientific article; zbMATH DE number 7649955 (Why is no real title available?)
- Locally cartesian closed categories and type theory
- Non-well-founded trees in categories
- Non-wellfounded trees in homotopy type theory
- On higher inductive types in cubical type theory
- On the interpretation of type theory in locally Cartesian closed categories
- Path spaces of higher inductive types in homotopy type theory
- Representing nested inductive types using W-types
- Semantics of higher inductive types
- Setoid type theory -- a syntactic translation
- Wellfounded trees and dependent polynomial functors
This page was built for publication: Formalising inductive and coinductive containers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7323664)