Finally tagless, partially evaluated: Tagless staged interpreters for simpler typed languages

Journal of Functional Programming

Volumn 19, Issue 5, 2009, Pages 509-543

  Carette, Jacques ^a   Kiselyov, Oleg ^b   Shan, Chung Chieh ^c  

^a MCMASTER UNIVERSITY   (Canada)

^b FNMOC ^*  (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC DATA-TYPES; CALL-BY-NAME; COALGEBRAIC STRUCTURES; CONTINUATION-PASSING STYLE; DEPENDENT TYPES; HIGHER-ORDER ABSTRACT SYNTAX; INITIAL ALGEBRAS; PARTIAL EVALUATION;

ALGEBRA;

ENCODING (SYMBOLS);

EID: 74149083935     PISSN: 09567968     EISSN: 14697653     Source Type: Journal    
DOI: 10.1017/S0956796809007205     Document Type: Article

References (43)

1. Ariola, Zena M., Felleisen, Matthias, Maraist, John, Odersky, Martin & Wadler, Philip (1995) The call-by-need lambda calculus. In POPL 95: Conference Record of the Annual ACM Symposium on Principles of Programming Languages. New York: ACM, pp. 233-246.
2. Asai, Kenichi (2001) Binding-time analysis for both static and dynamic expressions. New Generation Comput. 20(1), 27-52.
3. Baars, Arthur I. & Swierstra, S. Doaitse (2002) Typing dynamic typing. In ICFP 2002; Proceedings of the ACM International Conference on Functional Programming. New York: ACM, pp. 157-166.
4. Balat, Vincent, Di Cosmo, Roberto & Fiore, Marcelo P. (2004) Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums. In POPL 04: Conference Record of the Annual ACM Symposium on Principles of Programming Languages. New York: ACM, pp. 64-76.
5. Bawden, Alan (1999). Quasiquotation in Lisp. In Proceedings of the 1999 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation, Olivier Danvy (ed). pp. 4-12. Note NS-99-1, University of Aarhus: BRICS.
6. Benton, Nick. P. (2005) Embedded interpreters. J. Func. Prog. 15(4), 503-542.
7. Berarducci, Alessandro (1996) Infinite lambda-calculus and non-sensible models. In Logic and Algebra, A. Ursini & P. Aglianò (eds), vol.180. Marcel Dekker, pp. 339-378.
8. Birkedal, Lars & Welinder, Morten (1993) Partial evaluation of Standard ML. Master's Thesis, DIKU, University of Copenhagen, Denmark. DIKU Research Report 93/22.
9. Bjesse, Per, Claessen, Koen, Sheeran, Mary & Singh, Satnam (1998) Lava: Hardware design in Haskell. In ICFP Proceedings of the ACM International Conference on Functional Programming, vol.34(1) of ACM SIGPLAN Notices. New York: ACM, 1998: pp. 174-184.
10. B̈ohm, Corrado & Berarducci, Alessandro (1985) Automatic synthesis of typed δ-programs on term algebras. Theor. Comp. Sci. 39, 135-154.
11. Bondorf, Anders & Danvy, Olivier (1991) Automatic autoprojection of recursive equations with global variables and abstract data types. Sci. Comp. Prog. 16(2), 151-195.
12. Calcagno, Cristiano, Moggi, Eugenio & Taha, Walid (2004)ML-like inference for classifiers. In Programming Languages and Systems: Proceedings of ESOP 2004, 13th European Symposium on Programming, David A. Schmidt (ed.). Lecture Notes in Computer Science 2986, Berlin: Springer-Verlag, pp. 79-93.
13. Carette, Jacques & Kiselyov, Oleg (2005) Multi-stage programming with Functors and Monads: Eliminating abstraction overhead from generic code. In Generative Programming and Component Engineering GPCE, Estonia, Lecture Notes in Computer Science, pp. 256-274.
14. Carette, Jacques, Kiselyov, Oleg & Shan, Chung-chieh (2007) Finally tagless, partially evaluated. In APLAS, Zhong Shao (ed.), vol.4807. Lecture Notes in Computer Science. Springer, pp. 222-238.
15. Chen, Chiyan & Xi, Hongwei (2003) Implementing typeful program transformations. In Proceedings of the 2003 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation. New York: ACM, pp. 20-28.
16. Consel, Charles (1993) A tour of Schism: A partial evaluation system for higher-order applicative languages. In Proceedings of the 1993 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation. New York: ACM, pp. 145-154.
17. Danvy, Olivier (1996) Type-directed partial evaluation. In POPL 96: Conference record of the Annual ACM Symposium on Principles of Programming Languages. New York: ACM, pp. 242-257.
18. Danvy, Olivier (1998) A simple solution to type specialization. In Proceedings of ICALP 98: 25th International Colloquium on Automata, Languages, and Programming, Kim Guldstrand Larsen, Sven Skyum & Glynn Winskel (ed.). Lecture Notes in Computer Science, vol.1443. Berlin: Springer-Verlag, pp. 908-917.
19. Danvy, Olivier & Filinski, Andrzej (1992) Representing control: A study of the CPS transformation. Math. Struct. Comp. Sci. 2(4), 361-391.
20. Danvy, Olivier & López, Pablo E.Mart́inez (2003) Tagging, encoding, and Jones optimality. In Programming Languages and Systems: Proceedings of ESOP 2003, 12th European Symposium on Programming, Pierpaolo Degano (ed.). Lecture Notes in Computer Science, vol.2618, Berlin: Springer-Verlag, pp. 335-347.
21. Davies, Rowan & Pfenning, Frank (2001) A modal analysis of staged computation. J. ACM 48(3), 555-604.
22. Filinski, Andrzej (1994) Representing monads. In POPL '94: Conference Record of the Annual ACM Symposium on Principles of Programming Languages. New York: ACM, pp. 446-457.
23. Fiore, Marcelo P. (2002) Semantic analysis of normalisation by evaluation for typed lambda calculus. In Proceedings of the 4th International Conference on Principles and Practice of Declarative Programming. New York: ACM, pp 26-37.
24. Fogarty, Seth, Pasalic, Emir, Siek, Jeremy & Taha, Walid (2007) Concoqtion: Indexed types now! In Proceedings of the 2007 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-Based Program Manipulation. New York: ACM.
25. Futamura, Yoshihiko (1971) Partial evaluation of computation process-An approach to a compiler-compiler. Sys. Comp. Controls 2(5), 45-50. Reprinted with revisions in Higher-Order Symbol. Comput. 12(4), 381-391.
26. Gomard, Carsten K. & Jones, Neil D. (1991) A partial evaluator for the untyped lambda calculus. J. Funct. Prog. 1(1), 21-69.
27. Guillemette, Louis-Julien & Monnier, Stefan (2006) Statically verified type-preserving code transformations in Haskell. In PLPV 2006: Programming Languages Meets Program Verification. Aaron Stump and Hongwei Xi. (eds.) Electronic Notes in Theoretical Computer Science, vol.174(7). Amsterdam: Elsevier Science, pp. 40-53.
28. Harper, Robert & Morrisett, J. Gregory (1995) Compiling polymorphism using intensional type analysis. In POPL 95: Conference Record of the Annual ACM Symposium on Principles of Programming Languages. New York: ACM, pp. 130-141.
29. Hindley, J. Roger (1969) The principal type-scheme of an object in combinatory logic. Trans. Am. Math. Soc. 146, 29-60.
30. Hinze, Ralf, Jeuring, Johan & L̈oh, Andres (2004) Type-indexed data types. Sci. Comp. Prog. 51(1-2), 117-151.
31. Hofer, Christian, Ostermann, Klaus, Rendel, Tillmann & Moors, Adriaan (2008) Polymorphic embedding of DSLs. In ACM Conference on Generative Programming and Component Engineering GPCE, Nashville, ACM.
32. Holst, Carsten Kehler (1988) Language triplets: The AMIX approach. In Partial Evaluation and Mixed Computation. Dines Bjorner, Andrei P. Ershov and Neil D. Jones (eds), Amsterdam: North-Holland, pp. 167-186.
33. Honsell, Furio & Lenisa, Marina (1995) Final semantics for untyped lambda-calculus. In TLCA 95: Proceedings of the 2nd International Conference on Typed Lambda Calculi and Applications, Mariangiola Dezani-Ciancaglini and Gordon D. Plotkin (eds), Lecture Notes in Computer Science, vol.902, Berlin: Springer-Verlag, pp. 249-265.
34. Honsell, Furio & Lenisa, Marina (1999) Coinductive characterizations of applicative structures. Math. Struct. Comp. Sci. 9(4), 403-435.
35. Hudak, Paul (1996) Building domain-specific embedded languages. ACM Comput. Surv. 28(4es), 196.
36. Hughes, John (1998) Type specialization. ACM Comput. Surv. 30(3es:14), 1-6.
37. Jacobs, Bart (2007) Introduction to coalgebra: Towards mathematics of states and observations. http://www.cs.ru.nl/B.Jacobs/CLG/JacobsCoalgebraIntro. pdf. Draft book.
38. Jones, Neil D., Gomard, Carsten K. & Sestoft, Peter (1993) Partial Evaluation and Automatic Program Generation. Englewood Cliffs, NJ: Prentice-Hall.
39. Jones, Neil D. & Nielson, Flemming (1994) Abstract interpretation: A semantics-based tool for program analysis. In Handbook of Logic in Computer Science. Oxford University Press, pp. 527-629.
40. Jones, Neil D., Sestoft, Peter & Sondergaard, Harald (1989) Mix: A self-applicable partial evaluator for experiments in compiler generation. Lisp Symbol. Comput. 2(1), 9-50.
41. Landin, Peter J. (1966) The next 700 programming languages. Commun. ACM 9(3), 157-166.
42. L̈aufer, Konstantin & Odersky, Martin (1993) Self-interpretation and reflection in a statically typed language. In Proceedings of the 4th Annual OOPSLA/ECOOP Workshop on Object-Oriented Reflection and Metalevel Architectures, Washington, ACM.
43. Makholm, Henning (2000) On Jones-optimal specialization for strongly typed languages. In Semantics, Applications and Implementation of Program Generation, Walid Taha (ed). Lecture Notes in Computer Science, vol.1924 Montreal, Canada: Springer-Verlag, pp. 129-148.