A monadic approach for avoiding code duplication when staging memoized functions

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

Volumn , Issue , 2006, Pages 160-169

  Swadi, Kedar ^a   Taha, Walid ^a   Kiselyov, Oleg ^b   Pasalic, Emir ^a  

^a RICE UNIVERSITY   (United States)

^b FNMOC   (United States)

Author keywords

Code duplication; Fixed points; Monads; Multi stage programming; Partial evaluation; Program generation; Program specialization; Staging

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER SOFTWARE; DYNAMIC PROGRAMMING; SEMANTICS; STORAGE ALLOCATION (COMPUTER);

CODE DUPLICATION; FIXED POINTS; MONADS; MULTI STAGE PROGRAMMING; PARTIAL EVALUATION; PROGRAM SPECIALIZATION;

AUTOMATIC PROGRAMMING;

EID: 34250646270     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1111542.1111570     Document Type: Conference Paper

References (51)

1. U. Acar, O. Blelloch, and R. Harper. Selective memoization. In Proceedings of the ACM SIGPLAN/SICACT Symposium on Principles of Programming Languages (POPL '03). ACM Press, Jan. 2003.
2. M. S. Ager, O. Danvy, and H. K. Rohde. Fast partial evaluation of pattern matching in strings. In M. Leuschel, editor, Proceedings of the. ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '03), pages 3-9. ACM Press, 2003.
3. J. Aldrich. Open modules: A foundation for modular aspect-oriented programming. Available online from http://www-2.cs.emu.edu/aldrich/papers/ tinyaspect.pdf, Jan. 2003.
4. A. Bondorf. Improving binding times without explicit CPS-conversion. In The Proceedings of the ACM Conference on Lisp and Functional Programming (LFP '92), pages 1-10. ACM Press, June 1992.
5. C. Calcagno, E. Moggi, and T. Sheard. Closed types for a safe imperative MetaML. Journal of Functional Programming, 13(3):545-571, 2003. In [46].
6. C. Calcagno, E. Moggi, and W. Taha. Closed types as a simple approach to safe imperative multi-stage programming. In Proceedings of the International Colloquium on Automata, Languages, and Programming (JCALP '00), volume 1853 of Lecture Notes in Computer Science, pages 25-36. Springer-Verlag, July 2000.
7. C. Calcagno, E. Moggi, and W. Taha. ML-like inference for classifiers. In Proceedings of the European Symposium on Programming (ESOP '04), volume 2986 of Lecture Notes in Computer Science. Springer-Verlag, Mar. 2004.
8. C. Calcagno, W. Taha, L. Huang, and X. Leroy. Implementing multistage languages using ASTs, gensym, and reflection. In K. Czarnecki, F. Pfenning, and Y. Smaragdakis, editors, Proceedings of the ACM SIGPLAN/SIGSOFT International Conference on Generative Programming and Component Engineering (GPCE '03), volume 2830 of Lecture Notes in Computer Science. Springer-Verlag, Sept. 2003.
9. J. Carette and O. Kiselyov. Multi-stage programming with functors and monads: Eliminating abstraction overhead from generic code. In R. Glück and M. Lowry, editors, Proceedings of the ACM International Conference on Generative Programming and Component Engineering (GPCE'05), volume 3676 of Lecture Notes In Computer Science. Springer-Verlag, Sept. 2005.
10. C. Consel and O. Danvy. For a better support of static data flow. In R. Hughes, editor, Proceedings of the ACM SIGPLAN/SIGARCH Functional Programming Languages and Computer Architecture (FPCA '91), volume 523 of Lecture Notes in Computer Science, pages 496-519. ACM Press, Springer-Verlag, Aug. 1991.
11. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to algorithms. MIT Press and McGraw-Hill Book Company, 14th edition, 1994.
12. S. Debois. Imperative program optimization by partial evaluation. In N. Heintze and P. Sestoft, editors, Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '04), pages 113 - 122. ACM Press, Aug. 2004.
13. W. DeMeuter. Monads as a theoretical foundation for AOP. In Proceedings of the International Workshop on Aspect-Oriented Programming at ECOOP, volume 1357 of Lecture Notes in Computer Science, page 25. Springer-Verlag, 1997.
14. Dynamic Programming Benchmark. Available online from http://www. metaocaml.org/examples/dp, 2005.
15. D. Dussart, R. Hughes, and P. Thiemann. Type specialization for imperative languages. In Proceedings of the ACM SIGPLAN International Conference on Functional Programming (ICFP '97), pages 204-216. ACM Press, June 1997.
16. J. Eckhardt, R. Kaiabachev, E. Pasalic, K. Swadi, and W. Taha. Implicitly heterogeneous multi-stage programming. In R. Glück and M. Lowry, editors, Proceedings of the ACM International Conference on Generative Programming and Component Engineering (GPCE'05), volume 3676 of Lecture Notes In Computer Science. Springer-Verlag, September 2005.
17. C. Elliott, S. Finne, and O. de Moore. Compiling embedded languages. Journal of Functional Programming, 13(3):455-481, May 2003. In [46].
18. A. Filinski. Normalization by evaluation for the computational lambda-calculus. In S. Abramsky, editor, Proceedings of the International Conference on Typed Lambda Calculi and Applications (TLCA '01), volume 2044 of Lecture Notes in Computer Science, pages 151-165. Springer-Verlag, May 2001.
19. C. Flanagan, A. Sabry, B. F. Duba, and M. Felleisen. The essence of compiling with continuations. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, (PLDI '93), pages 237-247. ACM Press, June 1993.
20. M. Frigo. A Fast Fourier Transform compiler. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI '99), pages 169-180. ACM Press, May 1999.
21. W. L. Harrison and S. N. Kamin. Modular compilers based on monad transformers. In Proceedings of the IEEE International Conference on Computer Languages (ICCL '98). IEEE Computer Society Press, May 1998.
22. J. Hatcliff and O. Danvy. A computational formalization for partial evaluation. Mathematical Structures in Computer Science, 7(5):507-_541, 1997.
23. C. K. Holst and C. K. Gomard. Partial evaluation is fuller laziness. In Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '91), pages 223-233. ACM Press, June 1991.
24. R. Hughes. Generalising monads to arrows. Science of Computer Programming, 37:67-111, May 2000.
25. N. D. Jones, C. K. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice-Hall, 1993.
26. O. Kiselyov, K. Swadi, and W. Taha. A methodology for generating verified combinatorial circuits. In Proceedings of the ACM SIGBED International Workshop on Embedded Software (EMSOFT '04), pages 249-258. ACM Press, Sept. 2004.
27. O. Kiselyov and W. Taha. Relating FFTW and split radix. In Z. Wu, M. Guo, C. Chen, and J. Bu, editors, Proceedings of the International Conference on Embedded Software and Systems (ICESS '04), volume 3605 of Lecture Notes in Computer Science. Springer-Verlag, Dec. 2004.
28. J. Launchbury and S. L. Peyton Jones. State in Haskell. LISP and Symbolic Computation, 8(4):293-342, 1995.
29. J. L. Lawall and O. Danvy. Continuation-based partial evaluation. In Proceedings of the ACM Conference on Lisp and Functional Programming (LFP '94), pages 227-238. ACM Press, June 1994.
30. S. Liang, P. Hudak, and M. Jones. Monad transformers and modular interpreters. In Proceedings of ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages (POPL '95), pages 333-343. ACM Press, Jan. 1995.
31. Y. A. Liu and S. D. Stoller. From recursion to iteration: what are the optimizations? In Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '00), pages 73-82. ACM Press, Jan. 2000.
32. Y. A. Liu and S. D. Stoller. Dynamic programming via static incrementalization. Higher-Order and Symbolic Computation (HOSC), 16(1-2):37-62, Mar. 2003.
33. B. McAdam. Y in practical programs (extended abstract). Unpublished manuscript.
34. N. McKay and S. Singh. Dynamic specialization of XC6200 FPGAs by partial evaluation. In R. W. Hartenstein and A. Keevallik, editors, Proceedings of the International Workshop on Field-Programmable Logic and Applications (FPL '98), volume 1482 of Lecture Notes in Computer Science, pages 298-307. Springer-Verlag, Aug. 1998.
35. MetaOCaml: A compiled, type-safe multi-stage programming language. Available online from http://WWB.metaocaml.org/.
36. E. Moggi. Computational lambda-calculus and monads. In Proceedings of IEEE Symposium on Logic in Computer Science (UCS'89), pages 14-23. IEEE Computer Society Press, June 1989.
37. E. Moggi. Notions of computation and monads. Information and Computation, 93(1), 1991.
38. E. Moggi and S. Fagorzi. A monadic multi-stage metalanguage. In A. Gordon, editor, Proceedings of Foundations of Software Science and Computation Structures (FOSSACS '03), volume 2620 of Lecture Notes in Computer Science. Springer-Verlag, Apr. 2003.
39. F. Nielson and H. R. Nielson. Two-Level Functional Languages. Number 34 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge, 1992.
40. Oregon Graduate Institute Technical Reports. P.O. Box 91000, Portland, OR 97291-1000.USA. Available online from http://www.cse.ogi.edu/tech-reports/.
41. T. Sheard, Z.-e.-A. Benaissa, and E. Pasalic. DSL implementation using staging and monads. In Proceedings of the ACM USENIX Conference on Domain-Specific Languages (DSL'99), pages 81-94. ACM Press, October 1999.
42. M. Sperber and P. Thiemann. The essence of LR parsing. In Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '95), pages 146-155. ACM Press, June 1995.
43. E. Sumii and N. Kobayashi. A hybrid approach to online and offline partial evaluation. Higher-Order and Symbolic Computation, 14(2/3): 101-142, 2001.
44. W. Taha. Multi-Stage Programming: Its Theory and Applications. PhD thesis, Oregon Graduate Institute of Science and Technology, 1999. Available from [40].
45. W. Taha. A sound reduction semantics for untyped CBN multistage computation. Or, the theory of MetaML is non-trivial. In Proceedings of the ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation (PEPM '00). ACM Press, Jan. 2000.
46. W. Taha, editor. Journal of Functional Programming, Special Issue on 'Semantics, Applications, and Implementation of Programming Generation (SAIG)', volume 13(3). Cambridge University Press, May 2003.
47. W. Taha and M. F. Nielsen. Environment classifiers. In Proceedings of the ACM SIGPLAN/SIGACT Symposium on Principles of Programming Languages (POPL '03). ACM Press, Jan. 2003.
48. W. Taha and T. Sheard. Multi-stage programming with explicit annotations. In Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantic-Based Program Manipulation (PEPM '97), pages 203-217. ACM Press, 1997.
49. P. Thiemann. Continuation-based partial evaluation without continuations. In R. Cousot, editor, Proceedings of the International Symposium on Static Analysis (SAS '03), volume 2694 of Lecture Notes in Computer Science, pages 366-382. Springer-Verlag, 2003.
50. P. Wadler. The essence of functional programming. In Proceedings of the ACM SIGPLAN Symposium on Principles of Programming Languages (POPL '92), pages 1-14. ACM Press, Jan. 1992.
51. D. Weise, R. Conybeare, E. Ruf, and S. Seligman. Automatic online partial evaluation. In Proceedings of the ACM SIGPLAN/SIGAKCH Conference on Functional programming languages and computer architecture. (FPCA '91), volume 523 of Lecture Notes in Computer Science, pages 165-191. Springer-Verlag New York, Inc., Aug. 1991.