Searching for authors named "Klaus Aehlig" – sorted by Relevance.
-
A finite semantics for simply-typed lambda terms for infinite runs of automata. preprint
- A Finite Semantics of Simply-Typed Lambda Terms for Infinite Runs of Automata Klaus Aehlig
- Cited by 1 (0 self) – Add To MetaCart
-
Operational Aspects of Normalization by Evaluation
- Operational Aspects of Normalization by Evaluation Klaus Aehlig Felix Joachimski y Abstract A
- Cited by 4 (3 self) – Add To MetaCart
-
On Continuous Normalization
- On Continuous Normalization Klaus Aehlig ? and Felix Joachimski faehligjjoachskig
- Cited by 4 (2 self) – Add To MetaCart
-
Continuous Normalization for the Lambda-Calculus and Gödel's T
- Continuous Normalization for the Lambda-Calculus and Godel's T Klaus Aehlig ? and Felix
- Cited by 2 (2 self) – Add To MetaCart
-
A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation
- A syntactical analysis of non-size-increasing polynomial time computation Klaus Aehlig Helmut
- Cited by 8 (2 self) – Add To MetaCart
-
An Elementary Fragment of Second-Order Lambda Calculus
- An Elementary Fragment of Second-Order Lambda Calculus KLAUS AEHLIG and JAN JOHANNSEN Ludwig
- Cited by 1 (0 self) – Add To MetaCart
-
Operational Aspects of Untyped Normalization by Evaluation
- of Untyped Normalization by Evaluation KLAUS AEHL I G y and FEL I X JOACH I MSKI y Mathematisches
- Cited by 9 (2 self) – Add To MetaCart
-
On the computational complexity of cut-reduction
- On the computational complexity of cut-reduction Klaus Aehlig Arnold Beckmann Department
- Cited by 1 (1 self) – Add To MetaCart
-
An Arithmetic for Non-Size-Increasing Polynomial-Time Computation
- An arithmetic for non-size-increasing polynomial-time computation Klaus Aehlig Universitat
- Cited by 2 (0 self) – Add To MetaCart
-
Relativizing Small Complexity Classes and their Theories
- Relativizing Small Complexity Classes and their Theories Klaus Aehlig ∗ Stephen Cook Phuong Nguyen
- Cited by 1 (0 self) – Add To MetaCart

