메뉴 건너뛰기




Volumn 1292, Issue , 1997, Pages 291-308

Tracing lazy functional computations using redex trails

Author keywords

Debugging; Graph reduction; Haskell; Program transformation

Indexed keywords

COMPUTER DEBUGGING; COMPUTER PROGRAMMING LANGUAGES; LOGIC PROGRAMMING; METADATA; PROGRAM DEBUGGING;

EID: 84923020668     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0033851     Document Type: Conference Paper
Times cited : (36)

References (12)
  • 6
    • 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
  • 7
    • 0004763160 scopus 로고
    • The nofib benchmark suite of Haskell programs
    • In J. Launch- bury and P. Sansom, editors, Springer Verlag, Workshops in Computing
    • W. Partain. The nofib benchmark suite of Haskell programs. In J. Launch- bury and P. Sansom, editors, Proc. 1992 Glasgow Workshop on Functional Programming, pages 195-202. Springer Verlag, Workshops in Computing, 1993.
    • (1993) Proc. 1992 Glasgow Workshop on Functional Programming , pp. 195-202
    • Partain, W.1


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