1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.LO2007★ 1 cited
On the computational complexity of cut-reduction
Klaus Aehlig, Arnold Beckmann
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation sys…
cs.LO2002
An Elementary Fragment of Second-Order Lambda Calculus
Klaus Aehlig, Jan Johannsen
A fragment of second-order lambda calculus (System F) is defined that characterizes the elementary recursive functions. Type quantification is restricted to be non-interleaved and…
cs.LO2000
A syntactical analysis of non-size-increasing polynomial time computation
Klaus Aehlig, Helmut Schwichtenberg
A syntactical proof is given that all functions definable in a certain affine linear typed lambda-calculus with iteration in all types are polynomial time computable. The proof pro…