Formalising inductive and coinductive containers

DOI10.4230/LIPICS.ITP.2025.17MaRDI QIDQ7323664zbMATH OpenFDO

Authors Stefania Damato, Thorsten Altenkirch

Publication date 1 September 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ITP.2025.17

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites work

• A fixpoint theorem for complete categories
• Automata, Languages and Programming
• 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 1956503 (Why is no real title available?)
• scientific article; zbMATH DE number 2079044 (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
• Path spaces of higher inductive types in homotopy type theory
• Semantics of higher inductive types
• Setoid type theory -- a syntactic translation
• Types for Proofs and Programs

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)