4 search results - page 1 / 1 » alp 1997 |
ALP
1997
Springer
13 years 8 months ago
1997
Springer
ALP
1997
Springer
13 years 9 months ago
1997
Springer
Abstract. We show that non-determinism simplifies coding certain problems into programs. We define a non-confluent, but well-behaved class of rewrite systems for supporting non-...
ALP
1997
Springer
13 years 9 months ago
1997
Springer
We de ne a perpetual one-step reduction strategy which enables one to construct minimal (w.r.t. Levy's ordering 2 on reductions) in nite reductions in Conditional Orthogonal ...
ASAP
1997
IEEE
13 years 8 months ago
1997
IEEE
In the framework of perfect loop nests with uniform dependences, tiling has been extensively studied as a source-to-source program transformation. Little work has been devoted to ...