default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKlaus Aehlig
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j13]Klaus Aehlig, Stephen A. Cook, Phuong Nguyen:
Relativizing small complexity classes and their theories. Comput. Complex. 25(1): 177-215 (2016)- 2012
- [j12]Klaus Aehlig, Florian Haftmann, Tobias Nipkow
:
A compiled implementation of normalisation by evaluation. J. Funct. Program. 22(1): 9-30 (2012) - [j11]Jan Hoffmann, Klaus Aehlig, Martin Hofmann:
Multivariate amortized resource analysis. ACM Trans. Program. Lang. Syst. 34(3): 14:1-14:62 (2012) - [c13]Jan Hoffmann, Klaus Aehlig, Martin Hofmann:
Resource Aware ML. CAV 2012: 781-786 - [i5]Klaus Aehlig, Stephen A. Cook, Phuong Nguyen:
Relativizing Small Complexity Classes and their Theories. CoRR abs/1204.5508 (2012) - 2011
- [c12]Jan Hoffmann, Klaus Aehlig, Martin Hofmann:
Multivariate amortized resource analysis. POPL 2011: 357-370 - 2010
- [j10]Klaus Aehlig, Arnold Beckmann:
On the computational complexity of cut-reduction. Ann. Pure Appl. Log. 161(6): 711-736 (2010)
2000 – 2009
- 2008
- [j9]Klaus Aehlig, Tobias Nipkow:
Normalization by Evaluation. Arch. Formal Proofs 2008 (2008) - [j8]Klaus Aehlig:
Parameter-free polymorphic types. Ann. Pure Appl. Log. 156(1): 3-12 (2008) - [c11]Klaus Aehlig, Arnold Beckmann:
On the Computational Complexity of Cut-Reduction. LICS 2008: 284-293 - [c10]Klaus Aehlig, Florian Haftmann, Tobias Nipkow:
A Compiled Implementation of Normalization by Evaluation. TPHOLs 2008: 39-54 - 2007
- [j7]Klaus Aehlig:
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata. Log. Methods Comput. Sci. 3(3) (2007) - [c9]Klaus Aehlig, Stephen A. Cook, Phuong Nguyen:
Relativizing Small Complexity Classes and Their Theories. CSL 2007: 374-388 - [c8]Klaus Aehlig, Arnold Beckmann:
Propositional Logic for Circuit Classes. CSL 2007: 512-526 - [c7]Andreas Abel, Klaus Aehlig, Peter Dybjer:
Normalization by Evaluation for Martin-Löf Type Theory with One Universe. MFPS 2007: 17-39 - [i4]Klaus Aehlig:
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata. CoRR abs/0706.2076 (2007) - [i3]Klaus Aehlig, Arnold Beckmann:
On the computational complexity of cut-reduction. CoRR abs/0712.1499 (2007) - 2006
- [c6]Klaus Aehlig:
A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata. CSL 2006: 104-118 - 2005
- [j6]Klaus Aehlig, Felix Joachimski:
Continuous normalization for the lambda-calculus and Gödel's. Ann. Pure Appl. Log. 133(1-3): 39-71 (2005) - [j5]Klaus Aehlig:
Induction and inductive definitions in fragments of second order arithmetic. J. Symb. Log. 70(4): 1087-1107 (2005) - [j4]Klaus Aehlig, Jan Johannsen:
An elementary fragment of second-order lambda calculus. ACM Trans. Comput. Log. 6(2): 468-480 (2005) - [c5]Klaus Aehlig, Jolie G. de Miranda, C.-H. Luke Ong:
Safety Is not a Restriction at Level 2 for String Languages. FoSSaCS 2005: 490-504 - [c4]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: 39-54 - 2004
- [j3]Klaus Aehlig, Felix Joachimski:
Operational aspects of untyped Normalisation by Evaluation. Math. Struct. Comput. Sci. 14(4): 587-611 (2004) - [j2]Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg:
An arithmetic for non-size-increasing polynomial-time computation. Theor. Comput. Sci. 318(1-2): 3-27 (2004) - 2002
- [j1]Klaus Aehlig, Helmut Schwichtenberg:
A syntactical analysis of non-size-increasing polynomial time computation. ACM Trans. Comput. Log. 3(3): 383-401 (2002) - [c3]Klaus Aehlig, Felix Joachimski:
On Continuous Normalization. CSL 2002: 59-73 - [i2]Klaus Aehlig, Jan Johannsen:
An Elementary Fragment of Second-Order Lambda Calculus. CoRR cs.LO/0210022 (2002) - 2001
- [c2]Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn:
Linear Ramified Higher Type Recursion and Parallel Complexity. Proof Theory in Computer Science 2001: 1-21 - 2000
- [c1]Klaus Aehlig, Helmut Schwichtenberg:
A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation. LICS 2000: 84-91 - [i1]Klaus Aehlig, Helmut Schwichtenberg:
A syntactical analysis of non-size-increasing polynomial time computation. CoRR cs.LO/0011037 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
