Klaus Aehlig

According to our database, Klaus Aehlig authored at least 21 papers between 2001 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2016

Relativizing small complexity classes and their theories.

Klaus Aehlig, Stephen A. Cook, Phuong Nguyen

Comput. Complex., 2016

2012

Multivariate amortized resource analysis.

Jan Hoffmann, Klaus Aehlig, Martin Hofmann

ACM Trans. Program. Lang. Syst., 2012

A compiled implementation of normalisation by evaluation.

Klaus Aehlig, Florian Haftmann, Tobias Nipkow

J. Funct. Program., 2012

Resource Aware ML.

Jan Hoffmann, Klaus Aehlig, Martin Hofmann

Proceedings of the Computer Aided Verification - 24th International Conference, 2012

2010

On the computational complexity of cut-reduction.

Klaus Aehlig, Arnold Beckmann

Ann. Pure Appl. Log., 2010

2008

Parameter-free polymorphic types.

Klaus Aehlig

Ann. Pure Appl. Log., 2008

Normalization by Evaluation.

Klaus Aehlig, Tobias Nipkow

Arch. Formal Proofs, 2008

A Compiled Implementation of Normalization by Evaluation.

Klaus Aehlig, Florian Haftmann, Tobias Nipkow

Proceedings of the Theorem Proving in Higher Order Logics, 21st International Conference, 2008

2007

A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata.

Klaus Aehlig

Log. Methods Comput. Sci., 2007

Normalization by Evaluation for Martin-Löf Type Theory with One Universe.

Andreas Abel, Klaus Aehlig, Peter Dybjer

Proceedings of the 23rd Conference on the Mathematical Foundations of Programming Semantics, 2007

Propositional Logic for Circuit Classes.

Klaus Aehlig, Arnold Beckmann

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2005

An elementary fragment of second-order lambda calculus.

Klaus Aehlig, Jan Johannsen

ACM Trans. Comput. Log., 2005

Induction and inductive definitions in fragments of second order arithmetic.

Klaus Aehlig

J. Symb. Log., 2005

Continuous normalization for the lambda-calculus and Gödel's.

Klaus Aehlig, Felix Joachimski

Ann. Pure Appl. Log., 2005

The Monadic Second Order Theory of Trees Given by Arbitrary Level-Two Recursion Schemes Is Decidable.

Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong

Proceedings of the Typed Lambda Calculi and Applications, 7th International Conference, 2005

Safety Is not a Restriction at Level 2 for String Languages.

Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong

Proceedings of the Foundations of Software Science and Computational Structures, 2005

2004

An arithmetic for non-size-increasing polynomial-time computation.

Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg

Theor. Comput. Sci., 2004

Operational aspects of untyped Normalisation by Evaluation.

Klaus Aehlig, Felix Joachimski

Math. Struct. Comput. Sci., 2004

2002

A syntactical analysis of non-size-increasing polynomial time computation.

Klaus Aehlig, Helmut Schwichtenberg

ACM Trans. Comput. Log., 2002

On Continuous Normalization.

Klaus Aehlig, Felix Joachimski

Proceedings of the Computer Science Logic, 16th International Workshop, 2002

2001

Linear Ramified Higher Type Recursion and Parallel Complexity.

Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn

Proceedings of the Proof Theory in Computer Science, International Seminar, 2001