The following pages link to Types for Proofs and Programs (Q5712325):
Displaying 8 items.
- Graded modal dependent type theory (Q2233475) (← links)
- Turing-Completeness Totally Free (Q2941179) (← links)
- Foundations of dependent interoperability (Q4577812) (← links)
- Extracting functional programs from Coq, in Coq (Q5101927) (← links)
- Elaborating dependent (co)pattern matching: No pattern left behind (Q5110925) (← links)
- The Implicit Calculus of Constructions as a Programming Language with Dependent Types (Q5458373) (← links)
- Typing with Leftovers - A mechanization of Intuitionistic Multiplicative-Additive Linear Logic (Q6060672) (← links)
- Builtin types viewed as inductive families (Q6535230) (← links)