메뉴 건너뛰기




Volumn 4827 LNAI, Issue , 2007, Pages 305-315

Improving efficiency of prolog programs by fully automated unfold/fold transformation

Author keywords

Homeomorphic embedding; Logic programming; Partial deduction; Prolog; Unfold fold transformation

Indexed keywords

COMPUTATIONAL EFFICIENCY; EMBEDDED SYSTEMS; HEURISTIC METHODS; PROLOG (PROGRAMMING LANGUAGE);

EID: 38149012940     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76631-5_29     Document Type: Conference Paper
Times cited : (1)

References (11)
  • 1
    • 38149023678 scopus 로고    scopus 로고
    • 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)
  • 4
    • 84916498981 scopus 로고    scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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 scopus 로고
    • 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 scopus 로고
    • 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
  • 10
    • 84974250709 scopus 로고
    • 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 scopus 로고    scopus 로고
    • 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


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.