Search the dblp DataBase

Publications of Author

1. Klaus Aehlig
   A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata. [Citation Graph (0, 0)][DBLP]
   CSL, 2006, pp:104-118 [Conf]
   
2. Klaus Aehlig, Felix Joachimski
   On Continuous Normalization. [Citation Graph (0, 0)][DBLP]
   CSL, 2002, pp:59-73 [Conf]
   
3. Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn
   Linear Ramified Higher Type Recursion and Parallel Complexity. [Citation Graph (0, 0)][DBLP]
   Proof Theory in Computer Science, 2001, pp:1-21 [Conf]
   
4. Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong
   Safety Is not a Restriction at Level 2 for String Languages. [Citation Graph (0, 0)][DBLP]
   FoSSaCS, 2005, pp:490-504 [Conf]
   
5. Klaus Aehlig, Helmut Schwichtenberg
   A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation. [Citation Graph (0, 0)][DBLP]
   LICS, 2000, pp:84-91 [Conf]
   
6. 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. [Citation Graph (0, 0)][DBLP]
   TLCA, 2005, pp:39-54 [Conf]
   
7. Klaus Aehlig, Felix Joachimski
   Continuous normalization for the lambda-calculus and Gödel's. [Citation Graph (0, 0)][DBLP]
   Ann. Pure Appl. Logic, 2005, v:133, n:1-3, pp:39-71 [Journal]
   
8. Klaus Aehlig, Helmut Schwichtenberg
   A syntactical analysis of non-size-increasing polynomial time computation [Citation Graph (0, 0)][DBLP]
   CoRR, 2000, v:0, n:, pp:- [Journal]
   
9. Klaus Aehlig, Jan Johannsen
   An Elementary Fragment of Second-Order Lambda Calculus [Citation Graph (0, 0)][DBLP]
   CoRR, 2002, v:0, n:, pp:- [Journal]
   
10. Andreas Abel, Klaus Aehlig, Peter Dybjer
    Normalization by Evaluation for Martin-Löf Type Theory with One Universe. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:173, n:, pp:17-39 [Journal]
    
11. Klaus Aehlig, Felix Joachimski
    Operational aspects of untyped Normalisation by Evaluation. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2004, v:14, n:4, pp:587-611 [Journal]
    
12. Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg
    An arithmetic for non-size-increasing polynomial-time computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:318, n:1-2, pp:3-27 [Journal]
    
13. Klaus Aehlig, Jan Johannsen
    An elementary fragment of second-order lambda calculus. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2005, v:6, n:2, pp:468-480 [Journal]
    
14. Klaus Aehlig, Helmut Schwichtenberg
    A syntactical analysis of non-size-increasing polynomial time computation. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2002, v:3, n:3, pp:383-401 [Journal]
    
15. Klaus Aehlig, Arnold Beckmann
    Propositional Logic for Circuit Classes. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:512-526 [Conf]
    
16. Klaus Aehlig, Stephen Cook, Phuong Nguyen
    Relativizing Small Complexity Classes and Their Theories. [Citation Graph (0, 0)][DBLP]
    CSL, 2007, pp:374-388 [Conf]
    
17. Klaus Aehlig
    A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of<br> Automata [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
    
18. 
    On the Computational Complexity of Cut-Reduction. [Citation Graph (, )][DBLP]
    
    
19. 
    A Compiled Implementation of Normalization by Evaluation. [Citation Graph (, )][DBLP]
    
    
20. 
    Parameter-free polymorphic types. [Citation Graph (, )][DBLP]
    
    
21. 
    On the computational complexity of cut-reduction. [Citation Graph (, )][DBLP]
    
    
22. 
    On the computational complexity of cut-reduction [Citation Graph (, )][DBLP]