Klaus Aehlig

Publication Activity (10 Years)

Years Active: 2000-2016
Publications (10 Years): 1

Top Topics

Implementation Details

Information Systems

Evaluation Process

Complexity Measures

Top Venues

J. Funct. Program.

Comput. Complex.

Publications

Klaus Aehlig, Stephen A. Cook, Phuong Nguyen
Relativizing small complexity classes and their theories. Comput. Complex. 25 (1) (2016)
Klaus Aehlig, Stephen A. Cook, Phuong Nguyen
Relativizing Small Complexity Classes and their Theories CoRR (2012)
Klaus Aehlig, Florian Haftmann, Tobias Nipkow
A compiled implementation of normalisation by evaluation. J. Funct. Program. 22 (1) (2012)
Jan Hoffmann, Klaus Aehlig, Martin Hofmann
Multivariate amortized resource analysis. ACM Trans. Program. Lang. Syst. 34 (3) (2012)
Jan Hoffmann, Klaus Aehlig, Martin Hofmann
Resource Aware ML. CAV (2012)
Jan Hoffmann, Klaus Aehlig, Martin Hofmann
Multivariate amortized resource analysis. POPL (2011)
Klaus Aehlig, Arnold Beckmann
On the computational complexity of cut-reduction. Ann. Pure Appl. Log. 161 (6) (2010)
Klaus Aehlig, Florian Haftmann, Tobias Nipkow
A Compiled Implementation of Normalization by Evaluation. TPHOLs (2008)
Klaus Aehlig
Parameter-free polymorphic types. Ann. Pure Appl. Log. 156 (1) (2008)
Klaus Aehlig, Arnold Beckmann
On the Computational Complexity of Cut-Reduction. LICS (2008)
Klaus Aehlig, Tobias Nipkow
Normalization by Evaluation. Arch. Formal Proofs 2008 (2008)
Klaus Aehlig, Stephen A. Cook, Phuong Nguyen
Relativizing Small Complexity Classes and Their Theories. CSL (2007)
Klaus Aehlig
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata. Log. Methods Comput. Sci. 3 (3) (2007)
Andreas Abel, Klaus Aehlig, Peter Dybjer
Normalization by Evaluation for Martin-Löf Type Theory with One Universe. MFPS (2007)
Klaus Aehlig
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata CoRR (2007)
Klaus Aehlig, Arnold Beckmann
Propositional Logic for Circuit Classes. CSL (2007)
Klaus Aehlig, Arnold Beckmann
On the computational complexity of cut-reduction CoRR (2007)
Klaus Aehlig
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata. CSL (2006)
Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong
Safety Is not a Restriction at Level 2 for String Languages. FoSSaCS (2005)
Klaus Aehlig, Jan Johannsen
An elementary fragment of second-order lambda calculus. ACM Trans. Comput. Log. 6 (2) (2005)
Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong
The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable. TLCA (2005)
Klaus Aehlig, Felix Joachimski
Continuous normalization for the lambda-calculus and Gödel's. Ann. Pure Appl. Log. 133 (1-3) (2005)
Klaus Aehlig
Induction and inductive definitions in fragments of second order arithmetic. J. Symb. Log. 70 (4) (2005)
Klaus Aehlig, Felix Joachimski
Operational aspects of untyped Normalisation by Evaluation. Math. Struct. Comput. Sci. 14 (4) (2004)
Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg
An arithmetic for non-size-increasing polynomial-time computation. Theor. Comput. Sci. 318 (1-2) (2004)
Klaus Aehlig, Jan Johannsen
An Elementary Fragment of Second-Order Lambda Calculus CoRR (2002)
Klaus Aehlig, Helmut Schwichtenberg
A syntactical analysis of non-size-increasing polynomial time computation. ACM Trans. Comput. Log. 3 (3) (2002)
Klaus Aehlig, Felix Joachimski
On Continuous Normalization. CSL (2002)
Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn
Linear Ramified Higher Type Recursion and Parallel Complexity. Proof Theory in Computer Science (2001)
Klaus Aehlig, Helmut Schwichtenberg
A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation. LICS (2000)
Klaus Aehlig, Helmut Schwichtenberg
A syntactical analysis of non-size-increasing polynomial time computation CoRR (2000)