{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T11:14:40Z","timestamp":1724152480689},"publisher-location":"New York, NY, USA","reference-count":80,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,10,10]]},"DOI":"10.1145\/1868294.1868314","type":"proceedings-article","created":{"date-parts":[[2010,10,12]],"date-time":"2010-10-12T15:38:31Z","timestamp":1286897911000},"update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":179,"title":["Lightweight modular staging"],"prefix":"10.1145","author":[{"given":"Tiark","family":"Rompf","sequence":"first","affiliation":[{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), Lausanne, Switzerland"}]},{"given":"Martin","family":"Odersky","sequence":"additional","affiliation":[{"name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), Lausanne, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2010,10,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/97945.97982"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"}}\n C.\n Calcagno E.\n Moggi and \n W.\n Taha\n . \n Closed types as a simple approach to safe imperative multi-stage programming\n . In U. Montanari J. D. P. Rolim and E. Welzl editors ICALP volume \n 1853\n of \n Lecture Notes in Computer Science pages \n 25\n --\n 36\n . \n Springer 2000\n . }}C. Calcagno E. Moggi and W. Taha. Closed types as a simple approach to safe imperative multi-stage programming. In U. Montanari J. D. P. Rolim and E. Welzl editors ICALP volume 1853 of Lecture Notes in Computer Science pages 25--36. Springer 2000.","DOI":"10.1007\/3-540-45022-X_4"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"}}\n C.\n Calcagno W.\n Taha L.\n Huang and \n X.\n Leroy\n . \n Implementing multi-stage languages using asts gensym and reflection\n . In F. Pfenning and Y. Smaragdakis editors GPCE volume \n 2830\n of \n Lecture Notes in Computer Science pages \n 57\n --\n 76\n . \n Springer 2003\n . }}C. Calcagno W. Taha L. Huang and X. Leroy. Implementing multi-stage languages using asts gensym and reflection. In F. Pfenning and Y. Smaragdakis editors GPCE volume 2830 of Lecture Notes in Computer Science pages 57--76. Springer 2003.","DOI":"10.1007\/978-3-540-39815-8_4"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2005.10.012"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561347_18"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"}}\n J.\n Carette O.\n Kiselyov and \n C.\n chieh Shan. Finally tagless partially evaluated\n . In Z. Shao editor APLAS volume \n 4807\n of \n Lecture Notes in Computer Science pages \n 222\n --\n 238\n . \n Springer 2007\n . }}J. Carette O. Kiselyov and C. chieh Shan. Finally tagless partially evaluated. In Z. Shao editor APLAS volume 4807 of Lecture Notes in Computer Science pages 222--238. Springer 2007.","DOI":"10.1007\/978-3-540-76637-7_15"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796809007205"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1869459.1869527"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2005.10.013"},{"key":"e_1_3_2_1_10_1","series-title":"Lecture Notes in Computer Science","first-page":"51","volume-title":"Domain-Specific Program Generation, International Seminar","author":"Czarnecki K.","year":"2003","unstructured":"}} K. Czarnecki , J. T. O'Donnell , J. Striegnitz , and W. Taha . Dsl implementation in metaocaml, template haskell, and c++ . In Domain-Specific Program Generation, International Seminar , Dagstuhl Castle , Germany, March 23--28, 2003 , Revised Papers, volume 3016 of Lecture Notes in Computer Science , 2004, Springer , pages 51 -- 72 . }}K. Czarnecki, J. T. O'Donnell, J. Striegnitz, and W. Taha. Dsl implementation in metaocaml, template haskell, and c++. In Domain-Specific Program Generation, International Seminar, Dagstuhl Castle, Germany, March 23--28, 2003, Revised Papers, volume 3016 of Lecture Notes in Computer Science, 2004, Springer, pages 51--72."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561347_19"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00354-007-0020-x"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"}}\n C.\n Elliott S.\n Finne and \n O.\n de Moor\n .\n Compiling embedded languages\n . In W. Taha editor SAIG volume \n 1924\n of \n Lecture Notes in Computer Science pages \n 9\n --\n 27\n . \n Springer 2000\n . }}C. Elliott S. Finne and O. de Moor. Compiling embedded languages. In W. Taha editor SAIG volume 1924 of Lecture Notes in Computer Science pages 9--27. Springer 2000.","DOI":"10.1007\/3-540-45350-4_5"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0956796802004574"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"}}\n B.\n Emir M.\n Odersky and \n J.\n Williams\n . \n Matching objects with patterns\n . In E. Ernst editor ECOOP volume \n 4609\n of \n Lecture Notes in Computer Science pages \n 273\n --\n 298\n . \n Springer 2007\n . }}B. Emir M. Odersky and J. Williams. Matching objects with patterns. In E. Ernst editor ECOOP volume 4609 of Lecture Notes in Computer Science pages 273--298. Springer 2007.","DOI":"10.1007\/978-3-540-73589-2_14"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1173706.1173748"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/155090.155113"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/507635.507646"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328408.1328416"},{"key":"e_1_3_2_1_20_1","volume-title":"Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, PEPM 2008","author":"Gl\u00fcck R.","year":"2008","unstructured":"}} R. Gl\u00fcck and O. de Moor , editors. Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, PEPM 2008 , San Francisco, California, USA, January 7--8 , 2008 , 2008. ACM. }}R. Gl\u00fcck and O. de Moor, editors. Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, PEPM 2008, San Francisco, California, USA, January 7--8, 2008, 2008. ACM."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561347"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028664.1028687"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"}}\n W. L.\n Harrison\n and \n S. N.\n Kamin\n . \n Metacomputation-based compiler architecture\n . In R. C. Backhouse and J. N. Oliveira editors MPC volume \n 1837\n of \n Lecture Notes in Computer Science pages \n 213\n --\n 229\n . \n Springer 2000\n . }}W. L. Harrison and S. N. Kamin. Metacomputation-based compiler architecture. In R. C. Backhouse and J. N. Oliveira editors MPC volume 1837 of Lecture Notes in Computer Science pages 213--229. Springer 2000.","DOI":"10.1007\/10722010_14"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1449913.1449935"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375592"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11561347_21"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/242224.242477"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/551789.853532"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/512644.512652"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328408.1328430"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480945.1480962"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/776261.776266"},{"key":"e_1_3_2_1_33_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/b101929","volume-title":"GPCE","author":"Karsai G.","year":"2004","unstructured":"}} G. Karsai and E. Visser , editors . Generative Programming and Component Engineering: Third International Conference , GPCE 2004 , Vancouver, Canada, October 24--28, 2004. Proceedings, volume 3286 of Lecture Notes in Computer Science , 2004. Springer . }}G. Karsai and E. Visser, editors. Generative Programming and Component Engineering: Third International Conference, GPCE 2004, Vancouver, Canada, October 24--28, 2004. Proceedings, volume 3286 of Lecture Notes in Computer Science, 2004. Springer."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1291151.1291179"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535409_71"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1017753.1017794"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/331960.331977"},{"key":"e_1_3_2_1_38_1","series-title":"Lecture Notes in Computer Science","volume-title":"Domain-Specific Program Generation","author":"Lengauer C.","year":"2003","unstructured":"}} C. Lengauer , D. S. Batory , C. Consel , and M. Odersky , editors . Domain-Specific Program Generation , International Seminar, Dagstuhl Castle , Germany, March 23--28, 2003 , Revised Papers, volume 3016 of Lecture Notes in Computer Science , 2004. Springer . }}C. Lengauer, D. S. Batory, C. Consel, and M. Odersky, editors. Domain-Specific Program Generation, International Seminar, Dagstuhl Castle, Germany, March 23--28, 2003, Revised Papers, volume 3016 of Lecture Notes in Computer Science, 2004. Springer."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"crossref","unstructured":"}}\n N.\n Linger\n and \n T.\n Sheard\n . \n Binding-time analysis for metaml via type inference and constraint solving\n . In K. Jensen and A. Podelski editors TACAS volume \n 2988\n of \n Lecture Notes in Computer Science pages \n 266\n --\n 279\n . \n Springer 2004\n . }}N. Linger and T. Sheard. Binding-time analysis for metaml via type inference and constraint solving. In K. Jensen and A. Podelski editors TACAS volume 2988 of Lecture Notes in Computer Science pages 266--279. Springer 2004.","DOI":"10.1007\/978-3-540-24730-2_22"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"crossref","unstructured":"}}\n E.\n Moggi W.\n Taha Z.-E.-A.\n Benaissa and \n T.\n Sheard\n . \n An idealized metaml: Simpler and more expressive\n . In S. D. Swierstra editor ESOP volume \n 1576\n of \n Lecture Notes in Computer Science pages \n 193\n --\n 207\n . \n Springer 1999\n . }}E. Moggi W. Taha Z.-E.-A. Benaissa and T. Sheard. An idealized metaml: Simpler and more expressive. In S. D. Swierstra editor ESOP volume 1576 of Lecture Notes in Computer Science pages 193--207. Springer 1999.","DOI":"10.1007\/3-540-49099-X_13"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1449764.1449798"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30175-2_9"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2006.05.002"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1094811.1094815"},{"key":"e_1_3_2_1_45_1","volume-title":"Proc. FOOL","author":"Odersky M.","year":"2005","unstructured":"}} M. Odersky and M. Zenger . Independently extensible solutions to the expression problem . In Proc. FOOL 12, Jan. 2005 . http:\/\/homepages.inf.ed.ac.uk\/wadler\/foo. }}M. Odersky and M. Zenger. Independently extensible solutions to the expression problem. In Proc. FOOL 12, Jan. 2005. http:\/\/homepages.inf.ed.ac.uk\/wadler\/foo."},{"key":"e_1_3_2_1_46_1","volume-title":"PPL'01: JSSST Workshop on Programming and Programming Languages","author":"Oiwa Y.","year":"2001","unstructured":"}} Y. Oiwa , H. Masuhara , and A. Yonezawa . Dynjava: Type safe dynamic code generation in java . In PPL'01: JSSST Workshop on Programming and Programming Languages , 2001 . }}Y. Oiwa, H. Masuhara, and A. Yonezawa. Dynjava: Type safe dynamic code generation in java. In PPL'01: JSSST Workshop on Programming and Programming Languages, 2001."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03013-0_13"},{"key":"e_1_3_2_1_48_1","first-page":"136","volume-title":"GPCE","author":"Pasalic E.","year":"2004","unstructured":"}} E. Pasalic and N. Linger . Meta-programming with typed object-language representations . In GPCE , 2004 , pages 136 -- 167 . }}E. Pasalic and N. Linger. Meta-programming with typed object-language representations. In GPCE, 2004, pages 136--167."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/581478.581499"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/316686.316697"},{"key":"e_1_3_2_1_51_1","volume-title":"Proceedings of the 2009 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, PEPM 2009","author":"Puebla G.","year":"2009","unstructured":"}} G. Puebla and G. Vidal , editors . Proceedings of the 2009 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, PEPM 2009 , Savannah, GA, USA, January 19--20 , 2009 , 2009. ACM. }}G. Puebla and G. Vidal, editors. Proceedings of the 2009 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-based Program Manipulation, PEPM 2009, Savannah, GA, USA, January 19--20, 2009, 2009. ACM."},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542509"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480945.1480963"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/778559.778561"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30175-2_10"},{"key":"e_1_3_2_1_56_1","unstructured":"}}P. Sestoft. Runtime code generation with jvm and clr. http:\/\/www.itu.dk\/people\/sestoft\/rtcg\/rtcg.pdf 2002. }}P. Sestoft. Runtime code generation with jvm and clr. http:\/\/www.itu.dk\/people\/sestoft\/rtcg\/rtcg.pdf 2002."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"crossref","unstructured":"}}\n T.\n Sheard\n .\n Accomplishments and research challenges in meta-programming\n . In W. Taha editor SAIG volume \n 2196\n of \n Lecture Notes in Computer Science pages \n 2\n --\n 44\n . \n Springer 2001\n . }}T. Sheard. Accomplishments and research challenges in meta-programming. In W. Taha editor SAIG volume 2196 of Lecture Notes in Computer Science pages 2--44. Springer 2001.","DOI":"10.1007\/3-540-44806-3_2"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/636517.636528"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2007.11.012"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/331960.331975"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/1706356.1706358"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1007\/11785477_19"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1017\/S095679680200463X"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111542.1111570"},{"key":"e_1_3_2_1_65_1","doi-asserted-by":"publisher","DOI":"10.1145\/328690.328697"},{"key":"e_1_3_2_1_66_1","series-title":"Lecture Notes in Computer Science","first-page":"30","volume-title":"Domain-Specific Program Generation, International Seminar","author":"Taha W.","year":"2003","unstructured":"}} W. Taha . A gentle introduction to multi-stage programming. In Domain-Specific Program Generation, International Seminar , Dagstuhl Castle , Germany, March 23--28, 2003 , Revised Papers, volume 3016 of Lecture Notes in Computer Science , 2004, Springer , pages 30 -- 50 . }}W. Taha. A gentle introduction to multi-stage programming. In Domain-Specific Program Generation, International Seminar, Dagstuhl Castle, Germany, March 23--28, 2003, Revised Papers, volume 3016 of Lecture Notes in Computer Science, 2004, Springer, pages 30--50."},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/11535409_6"},{"key":"e_1_3_2_1_68_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88643-3_6"},{"key":"e_1_3_2_1_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/604131.604134"},{"key":"e_1_3_2_1_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/258948.258990"},{"key":"e_1_3_2_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/258993.259019"},{"key":"e_1_3_2_1_72_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00053-0"},{"key":"e_1_3_2_1_73_1","doi-asserted-by":"crossref","unstructured":"}}\n W.\n Taha Z.-E.-A.\n Benaissa and \n T.\n Sheard\n . \n Multi-stage programming: Axiomatization and type safety\n . In K. G. Larsen S. Skyum and G. Winskel editors ICALP volume \n 1443\n of \n Lecture Notes in Computer Science pages \n 918\n --\n 929\n . \n Springer 1998\n . }}W. Taha Z.-E.-A. Benaissa and T. Sheard. Multi-stage programming: Axiomatization and type safety. In K. G. Larsen S. Skyum and G. Winskel editors ICALP volume 1443 of Lecture Notes in Computer Science pages 918--929. Springer 1998.","DOI":"10.1007\/BFb0055113"},{"key":"e_1_3_2_1_74_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/978-3-540-24851-4_6","volume-title":"ECOOP","author":"Torgersen M.","year":"2004","unstructured":"}} M. Torgersen . The expression problem revisited. In M. Odersky, editor, ECOOP , volume 3086 of Lecture Notes in Computer Science , pages 123 -- 143 . Springer , 2004 . }}M. Torgersen. The expression problem revisited. In M. Odersky, editor, ECOOP, volume 3086 of Lecture Notes in Computer Science, pages 123--143. Springer, 2004."},{"key":"e_1_3_2_1_75_1","volume-title":"C++ Templates: The Complete Guide","author":"Vandevoorde D.","year":"2002","unstructured":"}} D. Vandevoorde and N. M. Josuttis . C++ Templates: The Complete Guide . Addison-Wesley Longman Publishing Co., Inc. , Boston, MA, USA , 2002 . }}D. Vandevoorde and N. M. Josuttis. C++ Templates: The Complete Guide. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2002."},{"key":"e_1_3_2_1_76_1","volume-title":"Indiana University Computer Science","author":"Veldhuizen T. L.","year":"2004","unstructured":"}} T. L. Veldhuizen . Active Libraries and Universal Languages. PhD thesis , Indiana University Computer Science , May 2004 . }}T. L. Veldhuizen. Active Libraries and Universal Languages. PhD thesis, Indiana University Computer Science, May 2004."},{"key":"e_1_3_2_1_77_1","volume-title":"The expression problem. Posted on the Java Genericity mailing list","author":"Wadler P.","year":"1998","unstructured":"}} P. Wadler . The expression problem. Posted on the Java Genericity mailing list , 1998 . }}P. Wadler. The expression problem. Posted on the Java Genericity mailing list, 1998."},{"key":"e_1_3_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806642"},{"key":"e_1_3_2_1_79_1","series-title":"Lecture Notes in Computer Science","volume-title":"First International Conference, ICESS","author":"Wu Z.","year":"2004","unstructured":"}} Z. Wu , C. Chen , M. Guo , and J. Bu , editors . Embedded Software and Systems , First International Conference, ICESS 2004 , Hangzhou, China, December 9--10, 2004, Revised Selected Papers, volume 3605 of Lecture Notes in Computer Science , 2005. Springer . }}Z. Wu, C. Chen, M. Guo, and J. Bu, editors. Embedded Software and Systems, First International Conference, ICESS 2004, Hangzhou, China, December 9--10, 2004, Revised Selected Papers, volume 3605 of Lecture Notes in Computer Science, 2005. Springer."},{"key":"e_1_3_2_1_80_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30175-2_1"}],"event":{"name":"GPCE'10: Generative Programming and Component Engineering","location":"Eindhoven The Netherlands","acronym":"GPCE'10","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the ninth international conference on Generative programming and component engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1868294.1868314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T19:04:23Z","timestamp":1693854263000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1868294.1868314"}},"subtitle":["a pragmatic approach to runtime code generation and compiled DSLs"],"short-title":[],"issued":{"date-parts":[[2010,10,10]]},"references-count":80,"alternative-id":["10.1145\/1868294.1868314","10.1145\/1868294"],"URL":"https:\/\/doi.org\/10.1145\/1868294.1868314","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1942788.1868314","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,10,10]]},"assertion":[{"value":"2010-10-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}