Closing the stage: From staged code to typed closures

Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation

Volumn , Issue , 2008, Pages 147-157

  Kameyama, Yukiyoshi ^a   Kiselyov, Oleg ^b   Shan, Chung Chieh ^c  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b FNMOC ^*  (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

Closures; Multistage programming; Mutable state and control effects; Parametric polymorphism; Type abstraction

Indexed keywords

CLOSURES; CODE GENERATION; CORRECT CODE; EVALUATION ORDER; MODAL LOGIC; MULTI-STAGE PROGRAMMING; OPEN CODES; OPEN PROBLEMS; OPERATIONAL SEMANTICS; PARAMETRIC POLYMORPHISM; PERFORMANCE PENALTIES; SIDE EFFECT; SOURCE LANGUAGE; SYSTEM F; TERMINATION EFFECT; TYPE ERRORS; TYPE SYSTEMS;

ABSTRACTING; AUTOMATIC PROGRAMMING; COMPUTATIONAL LINGUISTICS; JAVA PROGRAMMING LANGUAGE; NETWORK COMPONENTS; POLYMORPHISM; PROGRAM COMPILERS; QUERY LANGUAGES; SEMANTICS; TRANSLATION (LANGUAGES);

PROGRAM TRANSLATORS;

EID: 67650699577     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1328408.1328430     Document Type: Conference Paper

References (35)

1. Ariola, Zena M., and Matthias Felleisen. 1997. The call-by-need lambda calculus. Journal of Functional Programming 7(3):265-301.
2. Asai, Kenichi. 2002. Online partial evaluation for shift and reset. In PEPM, 19-30.
3. Balat, Vincent, Roberto Di Cosmo, and Marcelo P. Fiore. 2004. Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums. In POPL, 64-76.
4. Calcagno, Cristiano, Eugenio Moggi, and Walid Taha. 2000. Closed types as a simple approach to safe imperative multi-stage programming. In ICALP, 25-36. LNCS 1853.
5. -. 2004. ML-like inference for classifiers. In ESOP, 79-93. LNCS 2986.
6. Carette, Jacques, and Oleg Kiselyov. 2005. Multi-stage programming with functors and monads: Eliminating abstraction overhead from generic code. In GPCE, 256-274. LNCS 3676.
7. Czarnecki, Krzysztof, John T. O'Donnell, Jörg Striegnitz, and Walid Taha. 2004. DSL implementation in MetaOCaml, Template Haskell, and C++. In DSPG 2003, 51-72. LNCS 3016.
8. Davies, Rowan, and Frank Pfenning. 2001. A modal analysis of staged computation. Journal of the ACM 48(3):555-604.
9. Elliott, Conal. 2004. Programming graphics processors functionally. In Haskell workshop, 45-56.
10. Ghani, Neil, Valeria de Paiva, and Eike Ritter. 1998. Explicit substitutions for constructive necessity. In ICALP, 743-754. LNCS 1443.
11. Glück, Robert, and Jesper Jørgensen. 1997. An automatic program generator for multi-level specialization. Lisp and Symbolic Computation 10(2):113-158.
12. Gödel, Kurt. 1933. Eine Interpretation des intuitionistischen Aussagenkalküls. Ergebnisse eines Mathematischen Kolloquiums 4: 39-40.
13. Hammond, Kevin, and Greg Michaelson. 2003. Hume: A domain-specific language for real-time embedded systems. In GPCE, 37-56. LNCS 2830.
14. Jones, Neil D. 1988. Challenging problems in partial evaluation and mixed computation. New Generation Computing 6(2-3): 291-302.
15. Kim, Ik-Soon, Kwangkeun Yi, and Cristiano Calcagno. 2006. A polymorphic modal type system for Lisp-like multi-staged languages. In POPL, 257-268. (Pubitemid 43906975)
16. Launchbury, John, and Simon L. Peyton Jones. 1995. State in Haskell. Lisp and Symbolic Computation 8(4):293-341.
17. Lawall, Julia L., and Olivier Danvy. 1994. Continuation-based partial evaluation. In Lisp & functional programming, 227-238.
18. Lengauer, Christian, and Walid Taha, eds. 2006. Special issue on the 1st MetaOCaml workshop (2004), vol.62(1) of Science of Computer Programming. Elsevier.
19. Maraist, John, Martin Odersky, and Philip Wadler. 1998. The call-by-need lambda calculus. Journal of Functional Programming 8(3):275-317.
20. Miller, Dale A., and Alwen Tiu. 2003. A proof theory for generic judgments: An extended abstract. In LICS, 118-127.
21. Minamide, Yasuhiko, J. Gregory Morrisett, and Robert Harper. 1996. Typed closure conversion. In POPL, 271-283.
22. Nanevski, Aleksandar, Frank Pfenning, and Brigitte Pientka. 2007. Contextual modal type theory. Transactions on Computational Logic. In press.
23. Nielson, Flemming, and Hanne Riis Nielson. 1996. Multi-level lambda-calculi. In Partial evaluation, 338-354. LNCS 1110.
24. O'Hearn, Peter W., and Robert D. Tennent. 1995. Parametricity and local variables. Journal of the ACM 42(3):658-709.
25. Pašalić, Emir, Walid Taha, and Tim Sheard. 2002. Tagless staged interpreters for typed languages. In ICFP, 157-166.
26. Püschel, Markus, José M. F. Moura, Jeremy Johnson, David Padua, Manuela Veloso, Bryan W. Singer, Jianxin Xiong, Franz Franchetti, Aca Gačić, Yevgen Voronenko, Kang Chen, Robert W. Johnson, and Nick Rizzolo. 2005. SPIRAL: Code generation for DSP transforms. Proceedings of the IEEE special issue on program generation, optimization, and adaptation 93(2):232-275.
27. Sumii, Eijiro, and Naoki Kobayashi. 2001. A hybrid approach to online and offline partial evaluation. Higher-Order and Symbolic Computation 14(2-3):101-142.
28. Swadi, Kedar, Walid Taha, Oleg Kiselyov, and Emir Pasalic. 2006. A monadic approach for avoiding code duplication when staging memoized functions. In PEPM, 160-169.
29. Taha,Walid. 1999. Multi-stage programming: Its theory and applications. Ph.D. thesis, Oregon Graduate Institute of Science and Technology.
30. -. 2000. A sound reduction semantics for untyped CBN multi-stage computation. In PEPM.
31. -. 2004. A gentle introduction to multi-stage programming. In DSPG 2003, 30-50. LNCS 3016.
32. -. 2005. Resource-aware programming. In ICESS, 38-43. LNCS 3605.
33. Taha, Walid, and Michael Florentin Nielsen. 2003. Environment classifiers. In POPL, 26-37.
34. Wright, Andrew K., and Matthias Felleisen. 1994. A syntactic approach to type soundness. Information and Computation 115(1):38-94.
35. Yuse, Yosihiro, and Atsushi Igarashi. 2006. A modal type system for multi-level generating extensions with persistent code. In PPDP, 201-212.