메뉴 건너뛰기




Volumn 1467, Issue , 1998, Pages 160-177

Complete and partial redex trails of functional computations

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

EID: 84957053327     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055430     Document Type: Conference Paper
Times cited : (19)

References (11)
  • 2
    • 0346498673 scopus 로고    scopus 로고
    • Research Report LiTH-IDA-R-96-23, Department of Computer and Information Science, Linköping University, S-581 83, Linköping, Sweden, August
    • Henrik Nilsson and Jan Sparud. The evaluation dependence tree: an execution record for lazy functional debugging. Research Report LiTH-IDA-R-96-23, Department of Computer and Information Science, Linköping University, S-581 83, Linköping, Sweden, August 1996.
    • (1996) The evaluation dependence tree: An execution record for lazy functional debugging
    • Nilsson, H.1    Sparud, J.2
  • 3
    • 0031126461 scopus 로고    scopus 로고
    • The evaluation dependence tree as a basis for lazy functional debugging
    • April
    • Henrik Nilsson and Jan Sparud. The evaluation dependence tree as a basis for lazy functional debugging. Journal of Automated Software Engineering, 4(2): 152-205, April 1997.
    • (1997) Journal of Automated Software Engineering , vol.4 , Issue.2 , pp. 152-205
    • Nilsson, H.1    Sparud, J.2
  • 6
    • 0029708795 scopus 로고    scopus 로고
    • Lag, drag, void and use - Heap profiling and space-efficient compilation revisited
    • ACM Press, June
    • N. Röjemo and C. Runciman. Lag, drag, void and use - heap profiling and space-efficient compilation revisited. In Proc. Intl. Conf. on Functional Programming, pages 34-41. ACM Press, June 1996.
    • (1996) Proc. Intl. Conf. on Functional Programming , pp. 34-41
    • Röjemo, N.1    Runciman, C.2


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