| 2006 |
|---|
| 15 | EE | Klaus Indermark,
Thomas Noll:
Algebraic Correctness Proofs for Compiling Recursive Function Definitions with Strictness Information.
Acta Inf. 43(1): 1-43 (2006) |
| 1989 |
|---|
| 14 | | Rita Loogen,
Herbert Kuchen,
Klaus Indermark,
Werner Damm:
Distributed Implementation of Programmed Graph Reduction.
PARLE (1) 1989: 136-157 |
| 1987 |
|---|
| 13 | | Herbert Klaeren,
Klaus Indermark:
Efficient Implementation of an Algebraic Specification Language.
Algebraic Methods 1987: 69-90 |
| 12 | | Klaus Indermark,
Herbert Klaeren:
Efficient Implementation of Structural Recursion.
FCT 1987: 204-213 |
| 11 | | Klaus Indermark,
Herbert Klaeren:
Compiling Fibonacci-Like Recursion.
SIGPLAN Notices 22(6): 101-108 (1987) |
| 1984 |
|---|
| 10 | | Klaus Indermark:
Reduction Semantics for Rational Schemes.
ITA 18(3): 209-223 (1984) |
| 1983 |
|---|
| 9 | | Klaus Indermark:
Complexity of Infinite Trees.
ICALP 1983: 347-360 |
| 1982 |
|---|
| 8 | | Klaus Indermark:
On Rational Definitions in Complete Algebras without Rank.
Theor. Comput. Sci. 21: 281-313 (1982) |
| 1976 |
|---|
| 7 | | Klaus Indermark:
Schemes with Recursion on Higher Types.
MFCS 1976: 352-358 |
| 1975 |
|---|
| 6 | | Klaus Indermark:
Control structures and monadic languages.
Automata Theory and Formal Languages 1975: 289-292 |
| 5 | | Klaus Indermark:
The Continuous Algebra of Monadic Languages.
MFCS 1975: 266-270 |
| 1973 |
|---|
| 4 | | Karl-Heinz Böhling,
Klaus Indermark:
1. Fachtagung über Automatentheorie und Formale Sprachen, Bonn, 9.-12. Juli 1973, Gesellschaft für Informatik (GI)
Springer 1973 |
| 3 | | Klaus Indermark:
On lanov schemas with one memory location.
Automatentheorie und Formale Sprachen 1973: 284-293 |
| 2 | | Klaus Indermark:
On Ianov Schemas with One Memory Location.
MFCS 1973: 239-245 |
| 1972 |
|---|
| 1 | | Friedrich W. von Henke,
Klaus Indermark,
Klaus Weihrauch:
Hierarchies of Primitive Recursive Wordfunctions and Transductions Defined by Automata.
ICALP 1972: 549-561 |
