메뉴 건너뛰기




Volumn , Issue , 2004, Pages 179-190

A semantics for tracing declarative multi-paradigm programs

Author keywords

Functional Logic Programming; Semantics; Tracing

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; DATA ACQUISITION; FORMAL LOGIC; GRAPH THEORY; LOGIC PROGRAMMING; PROGRAM DEBUGGING;

EID: 11244277056     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1013963.1013984     Document Type: Conference Paper
Times cited : (19)

References (19)
  • 7
    • 1242308586 scopus 로고    scopus 로고
    • Debugging haskell by observing intermediate data structures
    • University of Nottingham
    • A. Gill. Debugging Haskell by Observing Intermediate Data Structures. In Proc. of the 4th Haskell Workshop. University of Nottingham, 2000.
    • (2000) Proc. of the 4th Haskell Workshop
    • Gill, A.1
  • 10
    • 0033449591 scopus 로고    scopus 로고
    • Higher-order narrowing with definitional trees
    • M. Hanus and C. Prehofer. Higher-Order Narrowing with Definitional Trees. Journal of Functional Programming, 9(l):33-75, 1999.
    • (1999) Journal of Functional Programming , vol.9 , Issue.50 , pp. 33-75
    • Hanus, M.1    Prehofer, C.2
  • 14
    • 84972363380 scopus 로고
    • Algorithmic debugging for lazy functional languages
    • H. Nilsson and P. Fritzson. Algorithmic debugging for lazy functional languages. Journal of Functional Programming, 4(3):337-370, 1994.
    • (1994) Journal of Functional Programming , vol.4 , Issue.3 , pp. 337-370
    • Nilsson, H.1    Fritzson, P.2
  • 15
    • 0031126461 scopus 로고    scopus 로고
    • The evaluation dependence tree as a basis for lazy functional debugging
    • H. Nilsson and J. Sparud. The Evaluation Dependence Tree as a Basis for Lazy Functional Debugging. Automated Software Engineering, 4(2): 121-150, 1997.
    • (1997) Automated Software Engineering , vol.4 , Issue.2 , pp. 121-150
    • Nilsson, H.1    Sparud, J.2


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