The following pages link to (Q4793030):
Displaying 9 items.
- A note on complexity measures for inductive classes in constructive type theory (Q1271558) (← links)
- Parameter free induction and provably total computable functions (Q1960416) (← links)
- Computational Complexity Via Finite Types (Q2946764) (← links)
- Ludics with repetitions (Exponentials, Interactive types and Completeness) (Q3003332) (← links)
- The complexity space of partial functions: a connection between complexity analysis and denotational semantics (Q3008383) (← links)
- (Q3708005) (← links)
- (Q3816069) (← links)
- Bar Induction is Compatible with Constructive Type Theory (Q5244386) (← links)
- Typed Lambda Calculi and Applications (Q5704015) (← links)