메뉴 건너뛰기
New Generation Computing
Volumn 6, Issue 2-3, 1988, Pages 211-225
Composing recursive logic programs with Clausal join
Author keywords

Logic Programming, Program Composition; Meta Programming; Program Transformation; Specification; Unfold Fold Transformations
Indexed keywords

EID: 0346476375     PISSN: 02883635     EISSN: 18827055     Source Type: Journal    
DOI: 10.1007/BF03037138     Document Type: Article
Times cited : (12)
References (10)
  • 3
    • 84934520547 scopus 로고    scopus 로고
    • Clark, K. L. and Sickel, S., “Predicate logic: a calculus for deriving programs,”Proc. IJCAI 77, Boston, 1977.
  • 4
    • 84934520546 scopus 로고    scopus 로고
    • Ershov, A. P. and Jones N. D., “Two characterizations of Partial and Mixed Computation,”Literature circulated for Workshop on Partial and Mixed Computation, Oct., 1986.
  • 6
    • 84934520549 scopus 로고    scopus 로고
    • Sterling, L. and Beer, R. D., “Incremental Flavor-Mixing of Meta-interpreters for Expert System Construction,”Proceedings Third Logic Programming Symposium, pp. 20–27, Salt Lake City, 1986.
  • 7
    • 84934520550 scopus 로고    scopus 로고
    • Sterling, L. and Lakhotia, A., “Composing Prolog Meta-interpreters,”CES-87-12, Case Western Reserve University, 1987.
  • 8
    • 84934520551 scopus 로고    scopus 로고
    • Sterling, L. and Shapiro, E., The Art of Prolog, MIT Press, 1986.
  • 9
    • 84934520552 scopus 로고    scopus 로고
    • Tamaki, H. and Sato, T., “Unfold/fold Transformations of Logic Programs,”Proc. of Second ICLP, pp. 127–138, 1984.
  • 10
    • 84934520553 scopus 로고    scopus 로고
    • Ullman, J. D., Database Systems, Computer Science Press, 1982.

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