The following pages link to (Q2778831):
Displaying 15 items.
- From realizability to induction via dependent intersection (Q2636522) (← links)
- Visible Type Application (Q2802481) (← links)
- Redundancy Elimination for LF (Q2871840) (← links)
- I Got Plenty o’ Nuttin’ (Q3188289) (← links)
- Validating Brouwer's continuity principle for numbers using named exceptions (Q4640313) (← links)
- (Q5020623) (← links)
- Linear Dependent Type Theory for Quantum Programming Languages (Q5043587) (← links)
- Monotone recursive types and recursive data representations in Cedille (Q5076393) (← links)
- (Q5089030) (← links)
- Quotients by Idempotent Functions in Cedille (Q5098733) (← links)
- Extracting functional programs from Coq, in Coq (Q5101927) (← links)
- The calculus of dependent lambda eliminations (Q5372010) (← links)
- The Implicit Calculus of Constructions as a Programming Language with Dependent Types (Q5458373) (← links)
- (Q6079236) (← links)
- Is Impredicativity Implicitly Implicit (Q6079240) (← links)
