{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:36Z","timestamp":1772164056052,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T00:00:00Z","timestamp":1380067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,9,25]]},"DOI":"10.1145\/2500365.2500575","type":"proceedings-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T09:13:17Z","timestamp":1380100397000},"page":"73-86","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Typed syntactic meta-programming"],"prefix":"10.1145","author":[{"given":"Dominique","family":"Devriese","sequence":"first","affiliation":[{"name":"iMinds -- DistriNet, KU Leuven, Leuven, Belgium"}]},{"given":"Frank","family":"Piessens","sequence":"additional","affiliation":[{"name":"iMinds -- DistriNet, KU Leuven, Leuven, Belgium"}]}],"member":"320","published-online":{"date-parts":[[2013,9,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1987171.1987178"},{"key":"e_1_3_2_1_2_1","volume-title":"C++ template metaprogramming: Concepts, tools, and techniques from Boost and beyond","author":"Abrahams D.","year":"2004","unstructured":"D. Abrahams and A. Gurtovoy . C++ template metaprogramming: Concepts, tools, and techniques from Boost and beyond . Addison-Wesley , 2004 . D. Abrahams and A. Gurtovoy. C++ template metaprogramming: Concepts, tools, and techniques from Boost and beyond. Addison-Wesley, 2004."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/647100.717294"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/645869.668533"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1173706.1173724"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863587"},{"key":"e_1_3_2_1_8_1","volume-title":"ASM: a code manipulation tool to implement adaptable systems. Adaptable and extensible component systems","author":"Bruneton E.","year":"2002","unstructured":"E. Bruneton , R. Lenglet , and T. Coupaye . ASM: a code manipulation tool to implement adaptable systems. Adaptable and extensible component systems , 2002 . E. Bruneton, R. Lenglet, and T. Coupaye. ASM: a code manipulation tool to implement adaptable systems. Adaptable and extensible component systems, 2002."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.12.114"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863547"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/944705.944730"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1411204.1411226"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806612"},{"key":"e_1_3_2_1_14_1","volume-title":"online","author":"Chlipala A.","year":"2012","unstructured":"A. Chlipala . Certified programming with dependent types. online , 2012 . URL http:\/\/adam.chlipala.net\/cpdt\/. A. Chlipala. Certified programming with dependent types. online, 2012. URL http:\/\/adam.chlipala.net\/cpdt\/."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1789277.1789284"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2364527.2364546"},{"key":"e_1_3_2_1_17_1","volume-title":"The Agda standard library","author":"Danielsson N. A.","year":"2009","unstructured":"N. A. Danielsson and many others. The Agda standard library , 2009 . N. A. Danielsson and many others. The Agda standard library, 2009."},{"key":"e_1_3_2_1_18_1","series-title":"Lecture Notes in Computer Science","first-page":"80","volume-title":"Implementation and Application of Functional Languages","author":"Danielsson N. A.","year":"2008","unstructured":"N. A. Danielsson and U. Norell . Parsing mixfix operators . In Implementation and Application of Functional Languages , volume 5836 of Lecture Notes in Computer Science , pages 80 -- 99 . Springer , 2008 . N. A. Danielsson and U. Norell. Parsing mixfix operators. In Implementation and Application of Functional Languages, volume 5836 of Lecture Notes in Computer Science, pages 80--99. Springer, 2008."},{"key":"e_1_3_2_1_19_1","volume-title":"JSR 269: Pluggable annotation processing API","author":"Darcy J.","year":"2011","unstructured":"J. Darcy . JSR 269: Pluggable annotation processing API , 2011 . URL http:\/\/jcp.org\/en\/jsr\/detail?id=269. J. Darcy. JSR 269: Pluggable annotation processing API, 2011. URL http:\/\/jcp.org\/en\/jsr\/detail?id=269."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1765236.1765246"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01211308"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/645894.671773"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1244381.1244400"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01700692"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11780274_27"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2034773.2034798"},{"key":"e_1_3_2_1_27_1","volume-title":"How to make ad hoc proof automation less ad hoc. technical appendix","author":"Gonthier G.","year":"2011","unstructured":"G. Gonthier , B. Ziliani , A. Nanevski , and D. Dreyer . How to make ad hoc proof automation less ad hoc. technical appendix , 2011 . URL http:\/\/www.mpi-sws.org\/ beta\/lessadhoc\/appendix.pdf. G. Gonthier, B. Ziliani, A. Nanevski, and D. Dreyer. How to make ad hoc proof automation less ad hoc. technical appendix, 2011. URL http:\/\/www.mpi-sws.org\/ beta\/lessadhoc\/appendix.pdf."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/645892.671442"},{"key":"e_1_3_2_1_29_1","volume-title":"UNIX Programmer's Manual, 2b","author":"Johnson S. C.","year":"1979","unstructured":"S. C. Johnson . YACC. UNIX Programmer's Manual, 2b , 1979 . S. C. Johnson. YACC. UNIX Programmer's Manual, 2b, 1979."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1086365.1086390"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/604174.604179"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/178243.178246"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863523.1863529"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863523.1863533"},{"key":"e_1_3_2_1_35_1","volume-title":"Haskell 2010 language report. online","author":"Marlow S.","year":"2010","unstructured":"S. Marlow . Haskell 2010 language report. online , 2010 . URL http:\/\/www.haskell.org\/onlinereport\/haskell2010\/. S. Marlow. Haskell 2010 language report. online, 2010. URL http:\/\/www.haskell.org\/onlinereport\/haskell2010\/."},{"key":"e_1_3_2_1_36_1","volume-title":"An intuitionistic theory of types. draft","author":"Martin-L\u00f6f P.","year":"1972","unstructured":"P. Martin-L\u00f6f . An intuitionistic theory of types. draft , 1972 . URL http:\/\/cs.ioc.ee\/ james\/ITT9200\/martinlof72.ps. P. Martin-L\u00f6f. An intuitionistic theory of types. draft, 1972. URL http:\/\/cs.ioc.ee\/ james\/ITT9200\/martinlof72.ps."},{"key":"e_1_3_2_1_37_1","volume-title":"Type-preserving renaming and substitution. draft","author":"McBride C.","year":"2005","unstructured":"C. McBride . Type-preserving renaming and substitution. draft , 2005 . URL http:\/\/strictlypositive.org\/ren-sub.pdf. C. McBride. Type-preserving renaming and substitution. draft, 2005. URL http:\/\/strictlypositive.org\/ren-sub.pdf."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863495.1863497"},{"key":"e_1_3_2_1_39_1","volume-title":"Chalmers","author":"Norell U.","year":"2007","unstructured":"U. Norell . Towards a practical programming language based on dependent type theory. PhD thesis , Chalmers , 2007 . U. Norell. Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers, 2007."},{"key":"e_1_3_2_1_40_1","volume-title":"Java core reflection. online","year":"1996","unstructured":"Oracle. Java core reflection. online , 1996 . URL http:\/\/docs.oracle.com\/javase\/1.5.0\/docs\/guide\/reflection\/spec\/java-reflectionTOC.doc.html. Oracle. Java core reflection. online, 1996. URL http:\/\/docs.oracle.com\/javase\/1.5.0\/docs\/guide\/reflection\/spec\/java-reflectionTOC.doc.html."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380250705"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30175-2_8"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389449.1389469"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792878.1792887"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.5555\/2032497.2032503"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596550.1596585"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-011-9077-9"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/581690.581691"},{"key":"e_1_3_2_1_49_1","volume-title":"International Workshop on Logical Frameworks and Meta-Languages","author":"Sheard T.","year":"2004","unstructured":"T. Sheard and E. Pasalic . Meta-programming with built-in type equality . In International Workshop on Logical Frameworks and Meta-Languages , 2004 . T. Sheard and E. Pasalic. Meta-programming with built-in type equality. In International Workshop on Logical Frameworks and Meta-Languages, 2004."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/1863543.1863591"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/2103656.2103690"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00053-0"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993498.1993514"},{"key":"e_1_3_2_1_54_1","volume-title":"November","year":"2012","unstructured":"Wikipedia. G\u00f6del's incompleteness theorems , November 2012 . URL http:\/\/en.wikipedia.org\/wiki\/Goedels_incompleteness_theorems. Wikipedia. G\u00f6del's incompleteness theorems, November 2012. URL http:\/\/en.wikipedia.org\/wiki\/Goedels_incompleteness_theorems."}],"event":{"name":"ICFP'13: ACM SIGPLAN International Conference on Functional Programming","location":"Boston Massachusetts USA","acronym":"ICFP'13","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","Northeastern University"]},"container-title":["Proceedings of the 18th ACM SIGPLAN international conference on Functional programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2500365.2500575","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2500365.2500575","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:34:32Z","timestamp":1750217672000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2500365.2500575"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,25]]},"references-count":53,"alternative-id":["10.1145\/2500365.2500575","10.1145\/2500365"],"URL":"https:\/\/doi.org\/10.1145\/2500365.2500575","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2544174.2500575","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2013,9,25]]},"assertion":[{"value":"2013-09-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}