Scrapping your inefficient engine: Using partial evaluation to improve domain-specific language implementation

ACM SIGPLAN Notices

Volumn 45, Issue 9, 2010, Pages 297-308

  Brady, Edwin C ^a   Hammond, Kevin ^a  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

Dependent types; Partial evaluation

Indexed keywords

DEPENDENT TYPES; DOMAIN SPECIFIC LANGUAGES; EFFICIENT IMPLEMENTATION; EMBEDDED DOMAINS; EXPERIMENTAL EVIDENCE; PARTIAL EVALUATION; RESIDUAL PROGRAMS; SIMPLE RULES;

COMPUTER SOFTWARE; GRAPHICAL USER INTERFACES; PROBLEM ORIENTED LANGUAGES; QUERY LANGUAGES;

JAVA PROGRAMMING LANGUAGE;

EID: 79551661424     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1932681.1863587     Document Type: Conference Paper

References (43)

1. P. H. Andersen and C. K. Holst. Termination analysis for offline partial evaluation of a higher order functional language. In Proc. SAS'96: Intl. Symp. on Static Analysis, pages 67-82. Springer, 1996.
2. L. Augustsson and M. Carlsson. An exercise in dependent types: A well-typed interpreter. In Workshop on Dependent Types in Programming, Gothenburg, 1999. Available from http://www.cs.chalmers.se/~augustss/cayenne/ interp. ps.
3. L. Augustsson, H. Mansell, and G. Sittampalam. Paradise: a two-stage DSL embedded in Haskell. In Proc. ICFP 2008: International Conf. on Functional Programming, pages 225-228. ACM, 2008.
4. S. Bhatti, E. Brady, K. Hammond, and J. McKinna. Domain specific languages (DSLs) for network protocols. In International Workshop on Next Generation Network Architecture (NGNA 2009), 2009.
5. H.-J. Boehm, A. J. Demers, Xerox Corporation Silicon Graphic, and Hewlett-Packard Company. A garbage collector for C and C++. http://www.hpl.hp. com/personal/Hans-Boehm/gc/, 2001.
6. E. Brady. Practical Implementation of a Dependently Typed Functional Programming Language. PhD thesis, University of Durham, 2005.
7. E. Brady. Ivor, a proof engine. In Implementation and Application of Functional Languages 2006, volume 4449 of LNCS, pages 145-162. Springer, 2007.
8. E. Brady and K. Hammond. A verified staged interpreter is a verified compiler. In Proc. GPCE'06: Conf. on Generative Programming and Component Engineering, 2006.
9. E. Brady, C. McBride, and J. McKinna. Inductive families need not store their indices. In S. Berardi, M. Coppo, and F. Damiani, editors, Types for Proofs and Programs 2003, volume 3085, pages 115-129. Springer, 2004.
10. J. Carette, O. Kiselyov, and C.-C. Shan. Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages. J. Funct. Program., 19(5):509-543, 2009.
11. T. Coquand. An algorithm for type-checking dependent types. Science of Computer Programming, 26 (1-3): 167-177, 1996.
12. S. Debois. Imperative program optimization by partial evaluation. In Proc. PEPM'04: ACM Symp. on Partial Evaluation and Semantics-Based Program Manipulation, pages 113-122. ACM, 2004.
13. B. Delaware and W. R. Cook. Generic operations and partial evaluation using models, 2009. Draft.
14. C. Elliott, S. Finne, and O. De Moor. Compiling embedded languages. J. Funct. Program., 13(3):455-481, 2003.
15. S. Fogarty, E. Pasalic, J. Siek, and W. Taha. Concoqtion: indexed types now! In Proc. PEPM'07: ACM Symp. on Partial Evaluation and Semantics-Based Program Manipulation, pages 112-121, 2007.
16. Y. Futamura. Partial evaluation of computation process - an approach to a compiler-compiler. Systems, Comps., Controls, 2(5):45-50, 1971.
17. A. Gill. Cheap deforestation for non-strict functional languages. PhD thesis, University of Glasgow, January 1996.
18. P. Hancock and A. Setzer. Interactive programs in dependent type theory. In P. Clote and H. Schwichtenberg, editors, Proc. CSL 2000:14th Ann. Conf. of EACSL, Fischbau, Germany, 21-26 Aug. 2000, LNCS 1862, pages 317-331. 2000.
19. P. Hudak. Building domain-specific embedded languages. ACM Computing Surveys, 28 A (4), December 1996.
20. N. Jones, C. Gomard, and P. Sestoft. Partial Evaluation and Automatic Program Generation. Prentice Hall International, 1993.
21. N. D. Jones. Challenging problems in partial evaluation and mixed computation. New Gen. Comput., 6 (2-3): 291-302, 1988.
22. O. Kiselyov and C.-c. Shan. Lightweight monadic regions. In Proc. Haskell'08: ACM SIGPLAN Symp. on Haskell, pages 1-12, 2008.
23. C. Lattner. LLVM: An infrastructure for multi-stage optimization. Master's thesis, Computer Science Dept., University of Illinois at Urbana-Champaign, December 2002.
24. S. Lee, M. M. T. Chakravarty, V. Grover, and G. Keller. GPU kernels as data-parallel array computations in Haskell. In Workshop on Exploiting Parallelism using GPUs and other Hardware-Assisted Methods (EPAHM 2009), 2009.
25. A. Löh, C. McBride, and W. Swierstra. A tutorial implementation of a dependently typed lambda calculus, 2010. To appear in Fundam. Inf.
26. C. McBride and J. McKinna. The view from the left. Journal of Functional Programming, 14(1):69-111, 2004.
27. N. Mitchell. Transformation and Analysis of Functional Programs. PhD thesis, University of York, June 2008.
28. N. Mitchell and C. Runciman. A supercompiler for core Haskell. In Implementation and Application of Functional Languages 2007, volume 5083 of LNCS, pages 147-164. Springer, May 2008.
29. U. Norell. Towards a practical programming language based on dependent type theory. PhD thesis, Department of Computer Science and Engineering, Chalmers University of Technology, SE-412 96 Göteborg, Sweden, September 2007.
30. W. Partain. The nofib benchmark suite of Haskell programs. In J. Launchbury and P. Sansom, editors, Functional Programming, Workshops in Computing, pages 195-202. Springer, 1992.
31. E. Pašalíc, W. Taha, and T. Sheard. Tagless staged interpreters for typed languages. In Proc. 2002 International Conf. on Functional Programming (ICFP 2002). ACM, 2002.
32. S. Peyton Jones and S. Marlow. Secrets of the Glasgow Haskell Compiler inliner. Journal of Functional Programming, 12(4):393-434, September 2002.
33. T. Schrijvers, S. Peyton Jones, M. Chakravarty, and M. Sulzmann. Type checking with open type functions. In International Conf. on Functional Programming (ICFP 2008), pages 51-62, New York, NY, USA, 2008. ACM.
34. S. Seefried, M. Chakravarty, and G. Keller. Optimising embedded DSLs using Template Haskell. In Proc. GPCE'04: Conf. Generative Prog. and Component Eng., LNCS. Springer, 2004.
35. T. Sheard and S. Peyton Jones. Template metaprogramming for Haskell. In ACM Haskell Workshop, pages 1-16, Oct. 2002.
36. K. Swadi, W. Taha, O. Kiselyov, and E. Pasalic. A monadic approach for avoiding code duplication when staging memoized functions. In Proc. PEPM'06: ACM Symp. on Partial Evaluation and Semanticsbased Program Manipulation, pages 160-169, 2006.
37. W. Taha. Multi-stage Programming: Its Theory and Applications. PhD thesis, Oregon Graduate Inst. of Science and Technology, 1999.
38. W. Taha. A Gentle Introduction to Multi-stage Programming, 2003. Available from http://www.cs.rice.edu/~taha.
39. W. Taha and H. Makholm. Tag elimination - or - type specialisation is a type indexed effect. In Subtyping and Dependent Types in Programming, APPSEM Workshop, 2000.
40. W. Taha, H. Makholm, and J. Hughes. Tag elimination and jonesoptimality. In PADO'01: Proceedings of the Second Symposium on Programs as Data Objects, pages 257-275, London, UK, 2001. Springer-Verlag.
41. D. Terei. Low level virtual machine for Glasgow Haskell Compiler. Bachelor's Thesis, Computer Science and Engineering Dept., The University of New South Wales, Sydney, Australia, 2009.
42. A. van Deursen, P. Klint, and J. Visser. Domain-specific languages - an annotated bibliography. http://homepages.cwi.nl/~arie/papers/dslbib/, 2000.
43. P. Wadler. Deforestation: Transforming programs to eliminate trees. Theoretical Computer Science, 73:231-248, 1990.