메뉴 건너뛰기




Volumn 1048, Issue , 1996, Pages 252-266

Efficient translation of lazy functional logic programs into prolog

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; FORMAL LOGIC; PROGRAM TRANSLATORS; PROLOG (PROGRAMMING LANGUAGE);

EID: 84949186673     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60939-3_19     Document Type: Conference Paper
Times cited : (19)

References (27)
  • 1
    • 85025826460 scopus 로고
    • Warren’s Abstract Machine
    • H. Aït-Kaci. Warren’s Abstract Machine. MIT Press, 1991.
    • (1991) MIT Press
    • Aït-Kaci, H.1
  • 8
    • 0022185483 scopus 로고
    • SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting
    • Boston
    • L. Fribourg. SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting. In Proc. IEEE Int. Symposium on Logic Programming, pp. 172-184, Boston, 1985.
    • (1985) Proc. IEEE Int. Symposium on Logic Programming , pp. 172-184
    • Fribourg, L.1
  • 15
    • 0028427164 scopus 로고
    • The Integration of Functions into Logic Programming: From Theory to Practice
    • M. Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming, Vol. 19&20, pp. 583-628, 1994.
    • (1994) Journal of Logic Programming , vol.19-20 , pp. 583-628
    • Hanus, M.1
  • 16
  • 18
  • 22
  • 23
    • 84949304498 scopus 로고
    • Negation and Control in Prolog
    • L. Naish. Negation and Control in Prolog. Springer LNCS 238, 1987.
    • (1987) Springer LNCS , pp. 238
    • Naish, L.1
  • 25
    • 0022213996 scopus 로고
    • Narrowing as the Operational Semantics of Functional Languages
    • Boston
    • U.S. Reddy. Narrowing as the Operational Semantics of Functional Languages. In Proc. IEEE Int. Symposium on Logic Programming, pp. 138-151, Boston, 1985.
    • (1985) Proc. IEEE Int. Symposium on Logic Programming , pp. 138-151
    • Reddy, U.S.1
  • 26
    • 0016115108 scopus 로고
    • Automated Theorem-Proving for Theories with Simplifiers, Commu-tativity, and Associativity
    • J.R. Slagle. Automated Theorem-Proving for Theories with Simplifiers, Commu-tativity, and Associativity. Journal of the ACM, Vol. 21, No. 4, pp. 622-642, 1974.
    • (1974) Journal of the ACM , vol.21 , Issue.4 , pp. 622-642
    • Slagle, J.R.1


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