Recommendations
Cites work
- A type-theoretic foundation for programming with higher-order abstract syntax and first-class substitutions
- Combining deduction modulo and logics of fixed-point definitions
- Computer Science Logic
- Contextual modal type theory
- Cut elimination for a logic with induction and co-induction
- Guarded recursive datatype constructors
- Indexed codata types
- Intensional interpretations of functionals of finite type I
- Programming with binders and indexed data-types
- Proof normalization modulo
- Reasoning with higher-order abstract syntax in a logical framework
- Stratification in logics of definitions
- Theorem proving modulo
- Types for Proofs and Programs
- Well-founded recursion over contextual objects
Cited in
(4)
This page was built for publication: Index-stratified types
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993349)