Klaus Aehlig

Available identifiers

Publication	Date of Publication	Type
An elementary fragment of second-order lambda calculus	2017-07-12	Paper
A syntactical analysis of non-size-increasing polynomial time computation	2017-06-13	Paper
Relativizing small complexity classes and their theories	2016-03-21	Paper
Normalization by Evaluation for Martin-Löf Type Theory with One Universe	2015-07-10	Paper
Multivariate amortized resource analysis	2014-04-10	Paper
A compiled implementation of normalisation by evaluation	2012-09-21	Paper
On the computational complexity of cut-reduction	2011-08-26	Paper
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata	2009-03-12	Paper
Relativizing small complexity classes and their theories	2009-03-05	Paper
Propositional Logic for Circuit Classes	2009-03-05	Paper
Parameter-free polymorphic types	2008-12-05	Paper
A Compiled Implementation of Normalization by Evaluation	2008-12-04	Paper
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata	2007-11-15	Paper
Induction and inductive definitions in fragments of second order arithmetic	2006-09-06	Paper
https://portal.mardi4nfdi.de/entity/Q3025192	2005-07-12	Paper
Continuous normalization for the lambda-calculus and Gödel's T	2005-04-21	Paper
Operational aspects of untyped Normalisation by Evaluation	2004-09-24	Paper
An arithmetic for non-size-increasing polynomial-time computation	2004-08-06	Paper
https://portal.mardi4nfdi.de/entity/Q4436023	2003-11-23	Paper
https://portal.mardi4nfdi.de/entity/Q4411815	2003-07-10	Paper

This page was built for person: Klaus Aehlig