|
П |
Parallelizing Functional Programs by Term Rewriting |
1997 |
Geser A., Gorlatch S. |
|
|
Univ.Passau |
|
05.11.1997 |
|
СТ |
Relative Undecidability in Term Rewriting |
1997 |
Geser A., Middeldorp A., Ohlebusch E., Zantema H. |
|
|
|
Lecture Notes in Computer Science |
18.07.1997 |
|
П |
A Proof of Higman s Lemma by Open Induction |
1996 |
Geser A. |
Lecture Notes in Computer Science |
|
Univ.Passau |
|
26.11.1996 |
|
П |
Omega-Termination is Undecidable for Totally Terminating Term Rewriting Systems |
1996 |
Geser A. |
Lecture Notes in Computer Science |
|
Univ.Passau |
|
26.11.1996 |
|
СТ |
Non-monotone Fixpoint Iterations to Resolve Second Order Effects |
1996 |
Geser A., Knoop J., Luttgen G., Ruthing O., Steffen B. |
|
|
|
Lecture Notes in Computer Science |
21.05.1996 |
|
СТ |
Mechanized Inductive Proof of Properties of a Simple Code Optimizer |
1995 |
Geser A. |
|
|
|
Lecture Notes in Computer Science |
20.06.1995 |
|
СТ |
A Complete Characterization of Termination of 0 1 - 1 0 |
1995 |
Zantema H., Geser A. |
|
|
|
Lecture Notes in Computer Science |
27.04.1995 |
|
П |
Chaotic Fixed Point Iterations |
1994 |
Geser A., Knoop J., Luttgen G., Steffen B., Ruthing O. |
|
|
Univ.Passau |
|
28.01.1995 |
|
П |
An Improved General Path Order |
1994 |
Geser A. |
|
|
Univ.Passau |
|
18.11.1994 |
|
П |
A Solution to Zantema s Problem |
1993 |
Geser A. |
|
|
Univ.Passau |
|
01.04.1994 |
|
П |
Rapid Prototyping for Algebraic Specifications: Examples for the Use of the RAP System |
1985 |
Geser A., Hussmann H. |
|
|
Univ.Passau |
|
29.08.1991 |
