메뉴 건너뛰기




Volumn 32, Issue 8, 1997, Pages 75-82

Statically Checkable Pattern Abstractions

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0346616752     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/258949.258957     Document Type: Article
Times cited : (2)

References (14)
  • 2
    • 0347729156 scopus 로고
    • Attributed transformational code generation for dynamic compilers
    • R. Giegerich and S. L. Graham, editors, Springer-Verlag, Berlin
    • John Boyland, Charles Farnum, and Susan L. Graham. Attributed transformational code generation for dynamic compilers. In R. Giegerich and S. L. Graham, editors, Code Generation - Concepts, Tools, Techniques. Workshops in Computer Science, pages 227-254. Springer-Verlag, Berlin, 1992.
    • (1992) Code Generation - Concepts, Tools, Techniques. Workshops in Computer Science , pp. 227-254
    • Boyland, J.1    Farnum, C.2    Graham, S.L.3
  • 3
    • 0011524173 scopus 로고    scopus 로고
    • PhD thesis, University of California, Berkeley, Available as technical report UCB//CSD-96-916
    • John Tang Boyland. Descriptional Composition of Compiler Components. PhD thesis, University of California, Berkeley, 1996. Available as technical report UCB//CSD-96-916.
    • (1996) Descriptional Composition of Compiler Components
    • Boyland, J.T.1
  • 6
    • 17244383252 scopus 로고
    • PhD thesis, Computer Science Division - EECS, University of California, Berkeley, December Available as technical report UCB//CSD-90-608
    • Charles Farnum. Pattern-based languages for prototyping compiler optimizers. PhD thesis, Computer Science Division - EECS, University of California, Berkeley, December 1990. Available as technical report UCB//CSD-90-608.
    • (1990) Pattern-based Languages for Prototyping Compiler Optimizers
    • Farnum, C.1
  • 8
    • 85034988338 scopus 로고
    • A functional language for the specification of complex tree transformations
    • Harald Ganzinger, editor, Springer-Verlag, Berlin
    • Reinhold Heckmann. A functional language for the specification of complex tree transformations. In Harald Ganzinger, editor, European Symposium on Programming (ESOP '88), volume 300 of Lecture Notes in Computer Science, pages 175-190. Springer-Verlag, Berlin, 1988.
    • (1988) European Symposium on Programming (ESOP '88), Volume 300 of Lecture Notes in Computer Science , vol.300 , pp. 175-190
    • Heckmann, R.1
  • 9
    • 0019899359 scopus 로고
    • Pattern matching in trees
    • January
    • Christoph M. Hoffmann and Michael J. O'Donnell. Pattern matching in trees. Journal of the ACM, 29(1):68-95, January 1982.
    • (1982) Journal of the ACM , vol.29 , Issue.1 , pp. 68-95
    • Hoffmann, C.M.1    O'Donnell, M.J.2
  • 12
    • 0012527078 scopus 로고
    • Partial evaluation applied to symbolic pattern matching with intelligent backtrack
    • October
    • Christian Queinnec and Jean-Marie Geffroy. Partial evaluation applied to symbolic pattern matching with intelligent backtrack. In Workshop for Static Analysis. October 1992.
    • (1992) Workshop for Static Analysis
    • Queinnec, C.1    Geffroy, J.-M.2
  • 13
    • 84957686328 scopus 로고    scopus 로고
    • ML pattern match compilation and partial evaluation
    • O. Danvy, R. Gluck, and P. Thiemann, editors, Springer-Verlag, Berlin, February
    • P. Sestoft. ML pattern match compilation and partial evaluation. In O. Danvy, R. Gluck, and P. Thiemann, editors, Partial Evaluation. International Seminar. Selected Papers, pages 446-464. Springer-Verlag, Berlin, February 1996.
    • (1996) Partial Evaluation. International Seminar. Selected Papers , pp. 446-464
    • Sestoft, P.1


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