The following pages link to Klaus Aehlig (Q636309):
Displaying 18 items.
- On the computational complexity of cut-reduction (Q636310) (← links)
- Parameter-free polymorphic types (Q958481) (← links)
- Continuous normalization for the lambda-calculus and Gödel's T (Q1772771) (← links)
- An arithmetic for non-size-increasing polynomial-time computation (Q1827388) (← links)
- A compiled implementation of normalisation by evaluation (Q2913943) (← links)
- (Q3025192) (← links)
- A Compiled Implementation of Normalization by Evaluation (Q3543648) (← links)
- Propositional Logic for Circuit Classes (Q3608435) (← links)
- A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata (Q3613331) (← links)
- (Q4411815) (← links)
- (Q4436023) (← links)
- Operational aspects of untyped Normalisation by Evaluation (Q4818938) (← links)
- Normalization by Evaluation for Martin-Löf Type Theory with One Universe (Q5262927) (← links)
- An elementary fragment of second-order lambda calculus (Q5277728) (← links)
- Multivariate amortized resource analysis (Q5408556) (← links)
- A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata (Q5426067) (← links)
- Induction and inductive definitions in fragments of second order arithmetic (Q5486242) (← links)
- A syntactical analysis of non-size-increasing polynomial time computation (Q5738960) (← links)
