메뉴 건너뛰기




Volumn , Issue , 1997, Pages 203-217

Multi-stage programming with explicit annotations

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTATIONAL LINGUISTICS; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; PROGRAM COMPILERS; RESPONSE TIME (COMPUTER SYSTEMS);

EID: 0030691229     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/258993.259019     Document Type: Conference Paper
Times cited : (169)

References (32)
  • 3
    • 0347737893 scopus 로고
    • Isomorphisms of types: From X-calculus to information retrieval and language design
    • Birkhäuser
    • Roberto Di Cosmo. Isomorphisms of Types: from X-calculus to information retrieval and language design. Progress in Theoretical Computer Science. Birkhäuser, 1995.
    • (1995) Progress in Theoretical Computer Science
    • Cosmo, R.D.1
  • 4
    • 0029706995 scopus 로고    scopus 로고
    • Type-directed partial evaluation
    • Florida, January New York: ACM
    • Olivier Danvy. Type-directed partial evaluation. In ACM Symposium on Principles of Programming Languages, pages 242-257, Florida, January 1996. New York: ACM.
    • (1996) ACM Symposium on Principles of Programming Languages , pp. 242-257
    • Danvy, O.1
  • 6
    • 0029719031 scopus 로고    scopus 로고
    • A temporal-logic approach to binding-time analysis
    • New Brunswick, New Jersey, 27-30 July IEEE Computer Society Press
    • th Annual IEEE Symposium on Logic in Computer Science, pages 184-195, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press.
    • (1996) th Annual IEEE Symposium on Logic in Computer Science , pp. 184-195
    • Davies, R.1
  • 8
    • 0022065057 scopus 로고
    • Computing with rewrite systems
    • Nachum Dershowitz. Computing with rewrite systems. Information and Control 65:122-157, 1985.
    • (1985) Information and Control , vol.65 , pp. 122-157
    • Dershowitz, N.1
  • 11
    • 0002157340 scopus 로고
    • A partial evalua-tor for untyped lambda calculus
    • Carsten K. Gomard and Neil D. Jones. A partial evalua-tor for untyped lambda calculus. Journal of Functional Programming, l(l):21-69, 1991.
    • (1991) Journal of Functional Programming , vol.1 , Issue.1 , pp. 21-69
    • Gomard, C.K.1    Jones, N.D.2
  • 12
    • 0347737043 scopus 로고    scopus 로고
    • Reasoning about hierarchies of online specialization systems
    • Olivier Danvy, Robert Glück, and Peter Thiemann, editors Springer-Verlag
    • John Hatcliff and Robert Glück. Reasoning about hierarchies of online specialization systems. In Olivier Danvy, Robert Glück, and Peter Thiemann, editors, Partial Evaluation, Volume 1110 of Lecture Notes in Computer Science, pages 161-182. Springer-Verlag, 1996.
    • (1996) Partial Evaluation, Volume 1110 of Lecture Notes in Computer Science , pp. 161-182
    • Hatcliff, J.1    Glück, R.2
  • 20
    • 0012528419 scopus 로고
    • Deferred compilation: The automation of run-time code generation
    • Carnegie Mellon University, Dec.
    • Mark Leone and Peter Lee. Deferred compilation: The automation of run-time code generation. Technical Report CMU-CS-93-225, Carnegie Mellon University, Dec. 1993.
    • (1993) Technical Report CMU-CS-93-225
    • Leone, M.1    Lee, P.2
  • 22
    • 0018105622 scopus 로고
    • A theory of type polymorphism in programming
    • Robin Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences 17:348-375, 1978.
    • (1978) Journal of Computer and System Sciences , vol.17 , pp. 348-375
    • Milner, R.1
  • 23
    • 84974081740 scopus 로고
    • Efficient self-interpretation in lambda calculus
    • July
    • Torben M. Mogensen. Efficient self-interpretation in lambda calculus. Functional Programming 2(3):345-364, July 1992.
    • (1992) Functional Programming , vol.2 , Issue.3 , pp. 345-364
    • Mogensen, T.M.1
  • 24
    • 0022847358 scopus 로고
    • Correctness of code generation from a two-level meta-language
    • B. Robinet and R. Wilhelm, editors Saarbrücken, FRG, March Springer
    • F. Nielson. Correctness of code generation from a two-level meta-language. In B. Robinet and R. Wilhelm, editors, Proceedings of the European Symposium on Programming (ESOP 86), Volume 213 of LNCS pages 30-40, Saarbrücken, FRG, March 1986. Springer.
    • (1986) Proceedings of the European Symposium on Programming (ESOP 86), Volume 213 of LNCS , pp. 30-40
    • Nielson, F.1
  • 26
    • 18944377121 scopus 로고
    • Call-by-name, call-by-value- and the lambda-calculus
    • G. 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
  • 28
    • 0346476348 scopus 로고
    • Type safe abstractions using program generators
    • Oregon Graduate Institute of Science and Technology
    • Tim Sheard and Neal Nelson. Type safe abstractions using program generators. Technical Report OGI-TR-95-013, Oregon Graduate Institute of Science and Technology, 1995.
    • (1995) Technical Report OGI-TR-95-013
    • Sheard, T.1    Nelson, N.2
  • 31
    • 0040802334 scopus 로고    scopus 로고
    • Towards partial evaluation of full scheme
    • Gregor Kiczales, editor San Francisco, CA, USA, April
    • Peter Thiemann. Towards partial evaluation of full Scheme. In Gregor Kiczales, editor, Reflection 96, pages 95-106, San Francisco, CA, USA, April 1996.
    • (1996) Reflection 96 , pp. 95-106
    • Thiemann, P.1


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