-
1
-
-
38149023678
-
-
Apt, K.R.: From Logic Programming to Prolog. Prentice-Hall, Englewood Cliffs (1996)
-
Apt, K.R.: From Logic Programming to Prolog. Prentice-Hall, Englewood Cliffs (1996)
-
-
-
-
3
-
-
0343390271
-
Conjunctive partial deduction: Foundations, control, algorithms and experiments
-
De Schreye, D., Glück, R., Jørgensen, J., Leuschel, M., Martens, B., Sørensen, M.H.: Conjunctive partial deduction: foundations, control, algorithms and experiments. The Journal of Logic Programming 41, 231-277 (1999)
-
(1999)
The Journal of Logic Programming
, vol.41
, pp. 231-277
-
-
De Schreye, D.1
Glück, R.2
Jørgensen, J.3
Leuschel, M.4
Martens, B.5
Sørensen, M.H.6
-
4
-
-
84916498981
-
-
Kruskal, J.B.: Well-quasi-ordering, the Tree Theorem, and Varsonyi's conjecture. Trans.Amer. Math. Society 95, 210-225 (1960)
-
Kruskal, J.B.: Well-quasi-ordering, the Tree Theorem, and Varsonyi's conjecture. Trans.Amer. Math. Society 95, 210-225 (1960)
-
-
-
-
5
-
-
84947920320
-
Improving Homeomorphic Embeddings for On line Termination
-
Flener, P, ed, LOPSTR 1998, Springer, Heidelberg
-
Leuschel, M.: Improving Homeomorphic Embeddings for On line Termination. In: Flener, P. (ed.) LOPSTR 1998. LNCS, vol. 1559, pp. 199-218. Springer, Heidelberg (1999)
-
(1999)
LNCS
, vol.1559
, pp. 199-218
-
-
Leuschel, M.1
-
7
-
-
84971128444
-
On well quasi ordering finite trees
-
Nash-Williams, C.: On well quasi ordering finite trees. Proc. Camb. Phil. Society 59, 833-835 (1963)
-
(1963)
Proc. Camb. Phil. Society
, vol.59
, pp. 833-835
-
-
Nash-Williams, C.1
-
8
-
-
0344000680
-
Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs
-
Proietti, M., Pettorossi, A.: Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs. Theoretical Computer Science 142, 89-124 (1995)
-
(1995)
Theoretical Computer Science
, vol.142
, pp. 89-124
-
-
Proietti, M.1
Pettorossi, A.2
-
9
-
-
0002086541
-
-
Tärnlund, S, ed, Uppsala University, Sweeden
-
Tamaki, H., Sato, T.: Unfold/Fold Transformation of Logic Programs. In: Tärnlund, S. (ed.) ICLP 1984, pp. 127-138, Uppsala University, Sweeden (1984)
-
(1984)
Unfold/Fold Transformation of Logic Programs
, vol.ICLP 1984
, pp. 127-138
-
-
Tamaki, H.1
Sato, T.2
-
10
-
-
84974250709
-
Program transformation with metasystems transitions
-
Turchin, V.F.: Program transformation with metasystems transitions. Journal of Functional Programming 3(3), 283-313 (1993)
-
(1993)
Journal of Functional Programming
, vol.3
, Issue.3
, pp. 283-313
-
-
Turchin, V.F.1
-
11
-
-
38149046080
-
Speedup by Fully Automated Unfold/Fold Transformation
-
No 2006 /1 Department of KTIML MFF, Charles University in Prague
-
Vyskočil, J., Štěpánek, P., Halama, M.: Speedup by Fully Automated Unfold/Fold Transformation. Technical Report TR No 2006 /1 Department of KTIML MFF, Charles University in Prague (2006)
-
(2006)
Technical Report TR
-
-
Vyskočil, J.1
Štěpánek, P.2
Halama, M.3
|