СТ |
Strictness Analysis by Abstract Reduction Using a Tableau Calculus |
1995 |
Schmidt-Schauss M., Panitz S. E., Schutz M. |
Lecture Notes in Computer Science |
|
|
Static Analysis |
17.11.1995 |
СТ |
TEA: Automatically Proving Termination of Programs in a Non-strict Higher-Order Functional Language |
1997 |
Panitz S. E., Schmidt-Schauss M. |
|
|
|
Lecture Notes in Computer Science |
20.09.1997 |
П |
Unification in Permutative Equational Theories Is Undecidable |
1987 |
Schmidt-Schauss M. |
|
|
Univ. Kaiserslautern |
|
30.04.1998 |
П |
Unification in a Combination of Arbitrary Disjoint Equational Theories |
1987 |
Schmidt-Schauss M. |
|
|
Univ. Kaiserslautern |
|
30.04.1998 |