According to our database1, Armin Kühnemann
Legend:Book In proceedings Article PhD thesis Other
Deaccumulation techniques for improving provability.
J. Log. Algebr. Program., 2007
The Substitution Vanishes.
Proceedings of the Algebraic Methodology and Software Technology, 2006
Linear deterministic multi bottom-up tree transducers.
Theor. Comput. Sci., 2005
Composition of functions with accumulating parameters.
J. Funct. Program., 2004
A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead.
Inf. Process. Lett., 2004
Deaccumulation - Improving Provability.
Proceedings of the Advances in Computing Science, 2003
Relating Accumulative and Non-accumulative Functional Programs.
Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001
Attribute grammars and program optimization - summer colloquium Waseda University, Tokyo, Japan, July 25 - August 2, 2000.
Waseda University, 2001
Comparison of Deforestation Techniques for Functional Programs and for Tree Transducers.
Proceedings of the Functional and Logic Programming, 4th Fuji International Symposium, 1999
Benefits of Tree Transducers for Optimizing Functional Programs.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1998
Berechnungsstärken von Teilklassen primitiv-rekursiver Programmschemata.
PhD thesis, 1997
A Two-Dimensional Hierarchy for Attributed Tree Transducers.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997
A Pumping Lemma for Output Languages of Macro Tree Transducers.
Proceedings of the Trees in Algebra and Programming, 1996
A Pumping Lemma for Output Languages of Attributed Tree Transducers.
Acta Cybern., 1994
Synthesized and Inherited Functions. A new Computational Model for Syntax-Directed Semantic.
Acta Inf., 1994