메뉴 건너뛰기




Volumn 1853, Issue , 2000, Pages 25-36

Closed types as a simple approach to safe imperative multi-stage programming

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EID: 84983098357     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_4     Document Type: Conference Paper
Times cited : (27)

References (19)
  • 3
    • 0029719031 scopus 로고    scopus 로고
    • A temporal-logic approach to binding-time analysis
    • New Brunswick, July 1996. IEEE Computer Society Press
    • Rowan Davies. A temporal-logic approach to binding-time analysis. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 184-195, New Brunswick, July 1996. IEEE Computer Society Press.
    • Proceedings, 11Th Annual IEEE Symposium on Logic in Computer Science , pp. 184-195
    • Davies, R.1
  • 5
    • 0002157340 scopus 로고
    • A partial evaluator for untyped lambda calculus
    • Carsten K. Gomard and Neil D. Jones. A partial evaluator for untyped lambda calculus. Journal of Functional Programming, 1(1):21-69, January 1991.
    • (1991) Journal of Functional Programming , vol.1 , Issue.1 , pp. 21-69
    • Gomard, C.K.1    Jones, N.D.2
  • 6
    • 84955597134 scopus 로고    scopus 로고
    • Fast binding-time analysis for multilevel specialization
    • Dines Bjørner, Manfred Broy, and Igor V. Pottosin, editors, Springer-Verlag
    • Robert Glück and Jesper Jørgensen. Fast binding-time analysis for multilevel specialization. In Dines Bjørner, Manfred Broy, and Igor V. Pottosin, editors, Perspectives of System Informatics, volume 1181 of Lecture Notes in Computer Science, pages 261-272. Springer-Verlag, 1996.
    • (1996) Perspectives of System Informatics, Volume 1181 of Lecture Notes in Computer Science , pp. 261-272
    • Robert, G.1    Jørgensen, J.2
  • 7
    • 85002306430 scopus 로고    scopus 로고
    • A computational formalization for partial evaluation
    • John Hatcliff and Olivier Danvy. A computational formalization for partial evaluation. Mathematical Structures in Computer Science, 7(5):507-541, October 1997.
    • (1997) Mathematical Structures in Computer Science , vol.7 , Issue.5 , pp. 507-541
    • Hatcliff, J.1    Danvy, O.2
  • 13
    • 18944377121 scopus 로고
    • Call-by-name, call-by-value and the lambda-calculus
    • Gordon D. Plotkin. Call-by-name, call-by-value and the lambda-calculus. Theoretical Computer Science, 1:125-159, 1975.
    • (1975) Theoretical Computer Science , vol.1 , pp. 125-159
    • Plotkin, G.D.1
  • 19
    • 0013091874 scopus 로고    scopus 로고
    • MetaML: Multi-stage programming with explicit annotations
    • Walid Taha and Tim Sheard. MetaML: Multi-stage programming with explicit annotations. Theoretical Computer Science, 248(1-2), 2000.
    • (2000) Theoretical Computer Science , vol.248 , Issue.1-2
    • Taha, W.1    Sheard, T.2


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