Modular dependent induction in Coq, Mendler-style
From MaRDI portal
Publication:2829276
Recommendations
Cites work
- scientific article; zbMATH DE number 1400097 (Why is no real title available?)
- A Brief Overview of Agda – A Functional Language with Dependent Types
- A hierarchy of Mendler style recursion combinators: taming inductive datatypes with negative occurrences
- A tutorial on the universality and expressiveness of fold
- Containers: Constructing strictly positive types
- Data types à la carte
- Inductive types and type constraints in the second-order lambda calculus
- Iteration and coiteration schemes for higher-order and nested datatypes
- Map fusion for nested datatypes in intensional type theory
- Meta-theory à la carte
- Modular dependent induction in Coq, Mendler-style
- Modular monadic meta-theory
- The calculus of constructions
- Type-based termination of generic programs
Cited in
(6)
This page was built for publication: Modular dependent induction in Coq, Mendler-style
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829276)