메뉴 건너뛰기




Volumn 3668, Issue , 2005, Pages 83-97

Guard and continuation optimization for occurrence representations of CHR

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); EMBEDDED SYSTEMS; HIGH LEVEL LANGUAGES; OPTIMIZATION; PROGRAM COMPILERS; PROLOG (PROGRAMMING LANGUAGE); SEMANTICS;

EID: 27144512739     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11562931_9     Document Type: Conference Paper
Times cited : (6)

References (15)
  • 9
    • 27144526550 scopus 로고    scopus 로고
    • Implementing and analysing union-find in CHR
    • K.U.Leuven, Dept. Computer Science, July
    • Tom Schrijvers and Thom Früwirth. Implementing and Analysing Union-Find in CHR. Technical Report CW 389, K.U.Leuven, Dept. Computer Science, July 2004.
    • (2004) Technical Report , vol.CW 389
    • Schrijvers, T.1    Früwirth, T.2
  • 11
    • 27144456725 scopus 로고    scopus 로고
    • Guard simplification in CHR programs
    • K.U.Leuven, Dept. CS, November
    • Jon Sneyers, Tom Schrijvers, and Bart Demoen. Guard Simplification in CHR programs. Technical Report CW 396, K.U.Leuven, Dept. CS, November 2004.
    • (2004) Technical Report , vol.CW 396
    • Sneyers, J.1    Schrijvers, T.2    Demoen, B.3
  • 12
    • 27144434728 scopus 로고    scopus 로고
    • Guard and continuation optimization for occurrence representations of CHR
    • K.U.Leuven, Dept. CS, July
    • Jon Sneyers, Tom Schrijvers, and Bart Demoen. Guard and Continuation Optimization for Occurrence Representations of CHR. Technical Report CW 420, K.U.Leuven, Dept. CS, July 2005.
    • (2005) Technical Report , vol.CW 420
    • Sneyers, J.1    Schrijvers, T.2    Demoen, B.3


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