{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T17:53:22Z","timestamp":1693850002748},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,11,1]],"date-time":"2011-11-01T00:00:00Z","timestamp":1320105600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Higher-Order Symb Comput"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10990-012-9089-0","type":"journal-article","created":{"date-parts":[[2012,9,30]],"date-time":"2012-09-30T13:36:27Z","timestamp":1349012187000},"page":"341-385","source":"Crossref","is-referenced-by-count":2,"title":["Type-specialized staged programming with process separation"],"prefix":"10.1007","volume":"24","author":[{"given":"Yu David","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Skalka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott F.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,29]]},"reference":[{"key":"9089_CR1","first-page":"163","volume-title":"Conference Record of the Twenty-First Annual ACM Symposium on Principles of Programming Languages","author":"A. Aiken","year":"1994","unstructured":"Aiken, A., Wimmers, E.L., Lakshman, T.K.: Soft typing with conditional types. In: Conference Record of the Twenty-First Annual ACM Symposium on Principles of Programming Languages, pp. 163\u2013173 (1994)"},{"issue":"2","key":"9089_CR2","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1017\/S0956796800020025","volume":"1","author":"H. Barendregt","year":"1991","unstructured":"Barendregt, H.: Introduction to generalized type systems. J. Funct. Program. 1(2), 125\u2013154 (1991)","journal-title":"J. Funct. Program."},{"key":"9089_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-3-642-03359-9_6","volume-title":"Theorem Proving in Higher Order Logics","author":"A. Bove","year":"2009","unstructured":"Bove, A., Dybjer, P., Norell, U.: A brief overview of agda\u2014a functional language with dependent types. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) Theorem Proving in Higher Order Logics. Lecture Notes in Computer Science, vol. 5674, pp. 73\u201378. Springer, Berlin (2009)"},{"key":"9089_CR4","unstructured":"Brady, E.: Irdis: a language with dependent types. http:\/\/www.idris-lang.org (2009)"},{"key":"9089_CR5","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1145\/1173706.1173724","volume-title":"GPCE\u201906: Proceedings of the 5th International Conference on Generative Programming and Component Engineering","author":"E. Brady","year":"2006","unstructured":"Brady, E., Hammond, K.: A verified staged interpreter is a verified compiler. In: GPCE\u201906: Proceedings of the 5th International Conference on Generative Programming and Component Engineering, pp. 111\u2013120. ACM, New York (2006)"},{"key":"9089_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/3-540-45022-X_4","volume-title":"ICALP \u201900: Proceedings of the 27th International Colloquium on Automata, Languages and Programming","author":"C. Calcagno","year":"2000","unstructured":"Calcagno, C., Moggi, E., Taha, W.: Closed types as a simple approach to safe imperative multi-stage programming. In: ICALP \u201900: Proceedings of the 27th International Colloquium on Automata, Languages and Programming, pp. 25\u201336. Springer, London (2000)"},{"key":"9089_CR7","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1145\/263699.263735","volume-title":"Conference Record of POPL\u201997: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"L. Cardelli","year":"1997","unstructured":"Cardelli, L.: Program fragments, linking, and modularization. In: Conference Record of POPL\u201997: The 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 266\u2013277 (1997)"},{"issue":"4","key":"9089_CR8","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1145\/6041.6042","volume":"17","author":"L. Cardelli","year":"1985","unstructured":"Cardelli, L., Wegner, P.: On understanding types, data abstraction, and polymorphism. ACM Comput. Surv. 17(4), 471\u2013523 (1985)","journal-title":"ACM Comput. Surv."},{"key":"9089_CR9","volume-title":"ICFP\u201903","author":"C. Chen","year":"2003","unstructured":"Chen, C., Xi, H.: Meta-programming through typeful code representation. In: ICFP\u201903 (2003)"},{"key":"9089_CR10","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/1086365.1086375","volume-title":"Proceedings of the Tenth ACM SIGPLAN International Conference on Functional Programming, ICFP \u201905","author":"C. Chen","year":"2005","unstructured":"Chen, C., Xi, H.: Combining programming with theorem proving. In: Proceedings of the Tenth ACM SIGPLAN International Conference on Functional Programming, ICFP \u201905, pp. 66\u201377. ACM, New York (2005)"},{"key":"9089_CR11","doi-asserted-by":"crossref","unstructured":"Consel, C., Hornof, L., Marlet, R., Muller, G., Thibault, S., Volanschi, E.-N., Lawall, J., Noy\u00e9, J.: Tempo: specializing systems applications and beyond. ACM Comput. Surv., 19 (1998)","DOI":"10.1145\/289121.289140"},{"issue":"2\u20133","key":"9089_CR12","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0890-5401(88)90005-3","volume":"76","author":"T. Coquand","year":"1988","unstructured":"Coquand, T., Huet, G.: The calculus of constructions. Inf. Comput. 76(2\u20133), 95\u2013120 (1988)","journal-title":"Inf. Comput."},{"key":"9089_CR13","unstructured":"Coquand, T., Huet, G., et\u00a0al.: The Coq proof assistant. http:\/\/coq.inria.fr"},{"issue":"6","key":"9089_CR14","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1017\/S0956796801004282","volume":"12","author":"K. Crary","year":"2002","unstructured":"Crary, K., Weirich, S., Morrisett, G.: Intensional polymorphism in type-erasure semantics. J. Funct. Program. 12(6), 567\u2013600 (2002)","journal-title":"J. Funct. Program."},{"issue":"3","key":"9089_CR15","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/382780.382785","volume":"48","author":"R. Davies","year":"2001","unstructured":"Davies, R., Pfenning, F.: A modal analysis of staged computation. J. ACM 48(3), 555\u2013604 (2001)","journal-title":"J. ACM"},{"key":"9089_CR16","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1145\/964001.964026","volume-title":"Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL \u201904","author":"D. Dreyer","year":"2004","unstructured":"Dreyer, D.: A type system for well-founded recursion. In: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL \u201904, pp. 293\u2013305 (2004)"},{"key":"9089_CR17","series-title":"Electronic Lecture Notes in Computer Science","volume-title":"Mathematical Foundations of Programming Language Semantics (MFPS)","author":"J. Eifrig","year":"1995","unstructured":"Eifrig, J., Smith, S., Trifonov, V.: Type inference for recursively constrained types and its application to OOP. In: Mathematical Foundations of Programming Language Semantics (MFPS). Electronic Lecture Notes in Computer Science, vol. 1 (1995)"},{"key":"9089_CR18","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1145\/277650.277730","volume-title":"Proceedings of the ACM SIGPLAN \u201998 Conference on Programming Language Design and Implementation","author":"M. Flatt","year":"1998","unstructured":"Flatt, M., Felleisen, M.: Units: cool modules for HOT languages. In: Proceedings of the ACM SIGPLAN \u201998 Conference on Programming Language Design and Implementation, pp. 236\u2013248 (1998)"},{"key":"9089_CR19","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1145\/1244381.1244400","volume-title":"Proceedings of the 2007 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM \u201907","author":"S. Fogarty","year":"2007","unstructured":"Fogarty, S., Pasalic, E., Siek, J., Taha, W.: Concoqtion: indexed types now! In: Proceedings of the 2007 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM \u201907, pp. 112\u2013121. ACM, New York (2007)"},{"key":"9089_CR20","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/507635.507646","volume-title":"ICFP\u201901: Proceedings of the Sixth ACM SIGPLAN International Conference on Functional Programming","author":"S.E. Ganz","year":"2001","unstructured":"Ganz, S.E., Sabry, A., Taha, W.: Macros as multi-stage computations: type-safe, generative, binding macros in MacroML. In: ICFP\u201901: Proceedings of the Sixth ACM SIGPLAN International Conference on Functional Programming, pp. 74\u201385. ACM, New York (2001)"},{"key":"9089_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/781131.781133","volume-title":"PLDI\u201903: Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation","author":"D. Gay","year":"2003","unstructured":"Gay, D., Levis, P., von Behren, R., Welsh, M., Brewer, E., Culler, D.: The nesC language: a holistic approach to networked embedded systems. In: PLDI\u201903: Proceedings of the ACM SIGPLAN 2003 Conference on Programming Language Design and Implementation, pp. 1\u201311. ACM, New York (2003)"},{"issue":"1\u20132","key":"9089_CR22","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0304-3975(96)00300-3","volume":"193","author":"G. Ghelli","year":"1998","unstructured":"Ghelli, G., Pierce, B.: Bounded existentials and minimal typing. Theor. Comput. Sci. 193(1\u20132), 75\u201396 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"9089_CR23","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/1328408.1328416","volume-title":"Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM \u201908","author":"J. Gillenwater","year":"2008","unstructured":"Gillenwater, J., Malecha, G., Salama, C., Zhu, A.Y., Taha, W., Grundy, J., O\u2019Leary, J.: Synthesizable high level hardware descriptions: using statically typed two-level languages to guarantee verilog synthesizability. In: Proceedings of the 2008 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM \u201908, pp. 41\u201350. ACM, New York (2008)"},{"key":"9089_CR24","first-page":"341","volume-title":"Seventeenth ACM Symposium on Principles of Programming Languages","author":"R. Harper","year":"1990","unstructured":"Harper, R., Mitchell, J.C., Moggi, E.: Higher-order modules and the phase distinction. In: Seventeenth ACM Symposium on Principles of Programming Languages, pp. 341\u2013354. ACM Press, New York (1990)"},{"key":"9089_CR25","first-page":"130","volume-title":"Twenty-Second ACM Symposium on Principles of Programming Languages","author":"R. Harper","year":"1995","unstructured":"Harper, R., Morrisett, G.: Compiling polymorphism using intensional type analysis. In: Twenty-Second ACM Symposium on Principles of Programming Languages, pp. 130\u2013141. ACM Press, New York (1995)"},{"key":"9089_CR26","first-page":"93","volume-title":"Architectural Support for Programming Languages and Operating Systems","author":"J. Hill","year":"2000","unstructured":"Hill, J., Szewczyk, R., Woo, A., Hollar, S., Culler, D.E., Pister, K.S.J.: System architecture directions for networked sensors. In: Architectural Support for Programming Languages and Operating Systems, pp. 93\u2013104 (2000)"},{"key":"9089_CR27","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1006\/inco.1995.1077","volume":"119","author":"F. Honsell","year":"1993","unstructured":"Honsell, F., Mason, I.A., Smith, S., Talcott, C.: A variable typed logic of effects. Inf. Comput. 119, 55\u201390 (1993)","journal-title":"Inf. Comput."},{"key":"9089_CR28","first-page":"111","volume-title":"PEPM\u201909: Proceedings of the 2009 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation","author":"Y. Kameyama","year":"2009","unstructured":"Kameyama, Y., Kiselyov, O., Shan, C.-c.: Shifting the stage: staging with delimited control. In: PEPM\u201909: Proceedings of the 2009 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, pp. 111\u2013120. ACM, New York (2009)"},{"key":"9089_CR29","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1145\/1017753.1017794","volume-title":"Proceedings of the 4th ACM International Conference on Embedded Software, EMSOFT \u201904","author":"O. Kiselyov","year":"2004","unstructured":"Kiselyov, O., Swadi, K.N., Taha, W.: A methodology for generating verified combinatorial circuits. In: Proceedings of the 4th ACM International Conference on Embedded Software, EMSOFT \u201904, pp. 249\u2013258. ACM, New York (2004)"},{"key":"9089_CR30","series-title":"Lecture Notes in Computer Science","first-page":"105","volume-title":"International Symposium on Generative and Component-Based Software Engineering","author":"S. Krishnamurthi","year":"1999","unstructured":"Krishnamurthi, S., Felleisen, M., Duba, B.F.: From macros to reusable generative programming. In: International Symposium on Generative and Component-Based Software Engineering. Lecture Notes in Computer Science, vol. 1799, pp. 105\u2013120. Springer, Berlin (1999)"},{"key":"9089_CR31","first-page":"142","volume-title":"POPL","author":"X. Leroy","year":"1995","unstructured":"Leroy, X.: Applicative functors and fully transparent higher-order modules. In: POPL, pp. 142\u2013153 (1995)"},{"issue":"3","key":"9089_CR32","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1017\/S0956796800003683","volume":"10","author":"X. Leroy","year":"2000","unstructured":"Leroy, X.: A modular module system. J. Funct. Program. 10(3), 269\u2013303 (2000)","journal-title":"J. Funct. Program."},{"key":"9089_CR33","volume-title":"Workshop on Generic Programming (WGP 09)","author":"Y.D. Liu","year":"2009","unstructured":"Liu, Y.D., Skalka, C., Smith, S.: Type-specialized staged programming with process separation. In: Workshop on Generic Programming (WGP 09), Edinburgh, Scotland (2009)"},{"key":"9089_CR34","first-page":"409","volume-title":"Proceedings of ACM Conference on Lisp and Functional Programming","author":"D. MacQueen","year":"1984","unstructured":"MacQueen, D.: Modules for standard ML. In: Proceedings of ACM Conference on Lisp and Functional Programming, pp. 409\u2013423 (1984)"},{"issue":"SI","key":"9089_CR35","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1145\/844128.844142","volume":"36","author":"S. Madden","year":"2002","unstructured":"Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: a Tiny AGgregation service for ad-hoc sensor networks. SIGOPS Oper. Syst. Rev. 36(SI), 131\u2013146 (2002)","journal-title":"SIGOPS Oper. Syst. Rev."},{"key":"9089_CR36","volume-title":"13th ACM SIGPLAN International Conference on Functional Programming (ICFP 2008)","author":"G. Mainland","year":"2008","unstructured":"Mainland, G., Morrisett, G., Welsh, M.: Flask: staged functional programming for sensor networks. In: 13th ACM SIGPLAN International Conference on Functional Programming (ICFP 2008), September (2008)"},{"key":"9089_CR37","first-page":"73","volume-title":"Logic Colloquium \u201973","author":"P. Martin-L\u00f6f","year":"1973","unstructured":"Martin-L\u00f6f, P.: An intuitionistic theory of types: predicative part. In: Rose, H.F., Shepherdson, J.C. (eds.) Logic Colloquium \u201973, pp. 73\u2013118. North-Holland, Amsterdam (1973)"},{"key":"9089_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/3-540-36576-1_23","volume-title":"FoSSaCS","author":"E. Moggi","year":"2003","unstructured":"Moggi, E., Fagorzi, S.: A monadic multi-stage metalanguage. In: Gordon, A.D. (ed.) FoSSaCS. Lecture Notes in Computer Science, vol. 2620, pp. 358\u2013374. Springer, Berlin (2003)"},{"key":"9089_CR39","first-page":"193","volume-title":"European Symposium on Programming (ESOP)","author":"E. Moggi","year":"1999","unstructured":"Moggi, E., Taha, W., El abidine Benaissa, Z., Sheard, T.: An idealized MetaML: simpler, and more expressive. In: European Symposium on Programming (ESOP), pp. 193\u2013207. Springer, Berlin (1999)"},{"issue":"3","key":"9089_CR40","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1017\/S0956796802004616","volume":"13","author":"S. Monnier","year":"2003","unstructured":"Monnier, S., Shao, Z.: Inlining as staged computation. J. Funct. Program. 13(3), 647\u2013676 (2003)","journal-title":"J. Funct. Program."},{"key":"9089_CR41","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1109\/LICS.2004.1319623","volume-title":"LICS \u201904: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science","author":"T. Murphy VII","year":"2004","unstructured":"Murphy VII, T., Crary, K., Harper, R., Pfenning, F.: A symmetric modal lambda calculus for distributed computing. In: LICS \u201904: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, pp. 286\u2013295. IEEE Computer Society, Washington (2004)"},{"key":"9089_CR42","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1145\/581478.581498","volume-title":"ICFP\u201902: Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming","author":"A. Nanevski","year":"2002","unstructured":"Nanevski, A.: Meta-programming with names and necessity. In: ICFP\u201902: Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming pp. 206\u2013217. ACM, New York (2002)"},{"key":"9089_CR43","volume-title":"ICFP \u201908: Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming","author":"A. Nanevski","year":"2008","unstructured":"Nanevski, A., Morrisett, G., Shinnar, A., Govereau, P., Birkedal, L.: Ynot: dependent types for imperative programs. In: ICFP \u201908: Proceedings of the 13th ACM SIGPLAN International Conference on Functional Programming (2008)"},{"key":"9089_CR44","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1145\/1236360.1236422","volume-title":"IPSN\u201907: Proceedings of the 6th International Conference on Information Processing in Sensor Networks","author":"R. Newton","year":"2007","unstructured":"Newton, R., Morrisett, G., Welsh, M.: The regiment macroprogramming system. In: IPSN\u201907: Proceedings of the 6th International Conference on Information Processing in Sensor Networks, pp. 489\u2013498 (2007)"},{"key":"9089_CR45","first-page":"218","volume-title":"The International Conference on Functional Programming (ICFP\u201902)","author":"E. Pasalic","year":"2002","unstructured":"Pasalic, E., Taha, W., Sheard, T., Tim, S.: Tagless staged interpreters for typed languages. In: The International Conference on Functional Programming (ICFP\u201902), pp. 218\u2013229. ACM, New York (2002)"},{"issue":"4","key":"9089_CR46","first-page":"312","volume":"7","author":"F. Pottier","year":"2000","unstructured":"Pottier, F.: A versatile constraint-based type inference system. Nord. J. Comput. 7(4), 312\u2013347 (2000)","journal-title":"Nord. J. Comput."},{"key":"9089_CR47","first-page":"121","volume-title":"Proceedings of the 2009 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM\u201909","author":"C. Salama","year":"2009","unstructured":"Salama, C., Malecha, G., Taha, W., Grundy, J., O\u2019Leary, J.: Static consistency checking for verilog wire interconnects: using dependent types to check the sanity of verilog descriptions. In: Proceedings of the 2009 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, PEPM\u201909, pp. 121\u2013130. ACM, New York (2009)"},{"issue":"10","key":"9089_CR48","doi-asserted-by":"crossref","first-page":"1056","DOI":"10.1109\/TPDS.2002.1041881","volume":"13","author":"C. Schurgers","year":"2002","unstructured":"Schurgers, C., Kulkarni, G., Srivastava, M.B.: Distributed on-demand address assignment in wireless sensor networks. IEEE Trans. Parallel Distrib. Syst. 13(10), 1056\u20131065 (2002)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9089_CR49","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1145\/1173706.1173743","volume-title":"GPCE\u201906: Proceedings of the 5th International Conference on Generative Programming and Component Engineering","author":"R. Shi","year":"2006","unstructured":"Shi, R., Chen, C., Xi, H.: Distributed meta-programming. In: GPCE\u201906: Proceedings of the 5th International Conference on Generative Programming and Component Engineering, pp. 243\u2013248 (2006)"},{"key":"9089_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/978-3-540-25935-0_3","volume-title":"Domain-Specific Program Generation","author":"W. Taha","year":"2004","unstructured":"Taha, W.: A gentle introduction to multi-stage programming. In: Lengauer, C., Batory, D., Consel, C., Odersky, M. (eds.) Domain-Specific Program Generation. Lecture Notes in Computer Science, vol. 3016, pp. 30\u201350. Springer, Berlin (2004). doi: 10.1007\/978-3-540-25935-03"},{"key":"9089_CR51","series-title":"Lecture Notes in Computer Science","first-page":"38","volume-title":"ICESS","author":"W. Taha","year":"2004","unstructured":"Taha, W.: Resource-aware programming. In: Wu, Z., Chen, C., Guo, M., Bu, J. (eds.) ICESS. Lecture Notes in Computer Science, vol. 3605, pp. 38\u201343. Springer, Berlin (2004)"},{"key":"9089_CR52","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1007\/BFb0055113","volume-title":"25th International Colloquium on Automata, Languages, and Programming","author":"W. Taha","year":"1998","unstructured":"Taha, W., El-abidine Benaissa, Z., Sheard, T.: Multi-stage programming: axiomatization and type safety (extended abstract). In: 25th International Colloquium on Automata, Languages, and Programming, pp. 918\u2013929. Springer, Berlin (1998)"},{"key":"9089_CR53","first-page":"340","volume-title":"EMSOFT","author":"W. Taha","year":"2003","unstructured":"Taha, W., Ellner, S., Xi, H.: Generating heap-bounded programs in a functional setting. In: EMSOFT, pp. 340\u2013355. Springer, Berlin (2003)"},{"key":"9089_CR54","unstructured":"Taha, W., et\u00a0al.: MetaOCaml: a compiled, type-safe multi-stage programming language. http:\/\/www.metaocaml.org\/"},{"key":"9089_CR55","volume-title":"POPL\u201903","author":"W. Taha","year":"2003","unstructured":"Taha, W., Nielsen, M.F.: Environment classifiers. In: POPL\u201903 (2003)"},{"key":"9089_CR56","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1145\/258993.259019","volume-title":"PEPM \u201997: Proceedings of the 1997 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation","author":"W. Taha","year":"1997","unstructured":"Taha, W., Sheard, T.: Multi-stage programming with explicit annotations. In: PEPM \u201997: Proceedings of the 1997 ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pp. 203\u2013217 (1997)"},{"key":"9089_CR57","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1145\/349299.349331","volume-title":"PLDI \u201900: Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation","author":"Z. Wan","year":"2000","unstructured":"Wan, Z., Hudak, P.: Functional reactive programming from first principles. In: PLDI \u201900: Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation, pp. 242\u2013252. ACM, New York (2000)"},{"key":"9089_CR58","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/604131.604150","volume-title":"POPL\u201903: Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"H. Xi","year":"2003","unstructured":"Xi, H., Chen, C., Chen, G.: Guarded recursive datatype constructors. In: POPL\u201903: Proceedings of the 30th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 224\u2013235. ACM, New York (2003)"},{"key":"9089_CR59","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/292540.292560","volume-title":"Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL\u201999","author":"H. Xi","year":"1999","unstructured":"Xi, H., Pfenning, F.: Dependent types in practical programming. In: Proceedings of the 26th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL\u201999, pp. 214\u2013227. ACM, New York (1999)"}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-012-9089-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-012-9089-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-012-9089-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T09:13:51Z","timestamp":1562231631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-012-9089-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":59,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9089"],"URL":"https:\/\/doi.org\/10.1007\/s10990-012-9089-0","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"value":"1388-3690","type":"print"},{"value":"1573-0557","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11]]}}}