{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:14:56Z","timestamp":1775873696139,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319479576","type":"print"},{"value":"9783319479583","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-47958-3_15","type":"book-chapter","created":{"date-parts":[[2016,10,8]],"date-time":"2016-10-08T13:40:52Z","timestamp":1475934052000},"page":"271-291","source":"Crossref","is-referenced-by-count":17,"title":["Refined Environment Classifiers"],"prefix":"10.1007","author":[{"given":"Oleg","family":"Kiselyov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yukiyoshi","family":"Kameyama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuto","family":"Sudo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,9]]},"reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/3-540-45022-X_4","volume-title":"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: Montanari, U., Rolim, J.D.P., Welzl, E. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 25\u201336. Springer, Heidelberg (2000). doi: 10.1007\/3-540-45022-X_4"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-39815-8_4","volume-title":"Generative Programming and Component Engineering","author":"C Calcagno","year":"2003","unstructured":"Calcagno, C., Taha, W., Huang, L., Leroy, X.: Implementing multi-stage languages using ASTs, gensym, and reflection. In: Pfenning, F., Smaragdakis, Y. (eds.) GPCE 2003. LNCS, vol. 2830, pp. 57\u201376. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-39815-8_4"},{"issue":"6","key":"15_CR3","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1017\/S0956796805005617","volume":"15","author":"C Chen","year":"2005","unstructured":"Chen, C., Xi, H.: Meta-programming through typeful code representation. J. Funct. Program. 15(6), 797\u2013835 (2005)","journal-title":"J. Funct. Program."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Davies, R.: A temporal logic approach to binding-time analysis. In: LICS, pp. 184\u2013195 (1996)","DOI":"10.1109\/LICS.1996.561317"},{"issue":"4\u20135","key":"15_CR5","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1017\/S095679680600596X","volume":"16","author":"M Fluet","year":"2006","unstructured":"Fluet, M., Morrisett, J.G.: Monadic regions. J. Funct. Program. 16(4\u20135), 485\u2013545 (2006)","journal-title":"J. Funct. Program."},{"key":"15_CR6","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1016\/j.scico.2015.08.007","volume":"112","author":"Y Kameyama","year":"2015","unstructured":"Kameyama, Y., Kiselyov, O., Shan, C.: Combinators for impure yet hygienic code generation. Sci. Comput. Program. 112, 120\u2013144 (2015)","journal-title":"Sci. Comput. Program."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Kim, I.S., Yi, K., Calcagno, C.: A polymorphic modal type system for lisp-like multi-staged languages. In: POPL, pp. 257\u2013268 (2006)","DOI":"10.1145\/1111037.1111060"},{"key":"15_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-319-07151-0_6","volume-title":"Functional and Logic Programming","author":"O Kiselyov","year":"2014","unstructured":"Kiselyov, O.: The design and implementation of BER MetaOCaml. In: Codish, M., Sumii, E. (eds.) FLOPS 2014. LNCS, vol. 8475, pp. 86\u2013102. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-07151-0_6"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Le Botlan, D., R\u00e9my, D.: ML $$^{\\rm F}$$ : raising ML to the power of system F. In: ICFP, pp. 27\u201338 (2003)","DOI":"10.1145\/944746.944709"},{"issue":"3","key":"15_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1352582.1352591","volume":"9","author":"A Nanevski","year":"2008","unstructured":"Nanevski, A., Pfenning, F., Pientka, B.: Contextual modal type theory. Trans. Comput. Logic 9(3), 1\u201349 (2008)","journal-title":"Trans. Comput. Logic"},{"key":"15_CR11","unstructured":"POPL 2003: Conference Record of the Annual ACM Symposium on Principles of Programming Languages (2003)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Pottier, F.: Static name control for FreshML. In: LICS, pp. 356\u2013365. IEEE Computer Society (2007)","DOI":"10.1109\/LICS.2007.44"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Pouillard, N., Pottier, F.: A fresh look at programming with names and binders. In: ICFP, pp. 217\u2013228. ACM, New York (2010)","DOI":"10.1145\/1863543.1863575"},{"key":"15_CR14","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/s10990-013-9096-9","volume":"25","author":"T Rompf","year":"2013","unstructured":"Rompf, T., Amin, N., Moors, A., Haller, P., Odersky, M.: Scala-virtualized: linguistic reuse for deep embeddings. High. Order Symbolic Comput. 25, 165\u2013207 (2013)","journal-title":"High. Order Symbolic Comput."},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Taha, W., Nielsen, M.F.: Environment classifiers. In: POPL [11], pp. 26\u201337","DOI":"10.1145\/604131.604134"},{"issue":"5","key":"15_CR16","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1017\/S0956796899003469","volume":"9","author":"P Thiemann","year":"1999","unstructured":"Thiemann, P.: Combinators for program generation. J. Funct. Program. 9(5), 483\u2013525 (1999)","journal-title":"J. Funct. Program."},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Westbrook, E., Ricken, M., Inoue, J., Yao, Y., Abdelatif, T., Taha, W.: Mint: Java multi-stage programming using weak separability. In: PLDI 2010. ACM, New York (2010)","DOI":"10.1145\/1806596.1806642"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Xi, H., Chen, C., Chen, G.: Guarded recursive datatype constructors. In: POPL [11], pp. 224\u2013235","DOI":"10.1145\/604131.604150"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-47958-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T11:31:01Z","timestamp":1568460661000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-47958-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319479576","9783319479583"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-47958-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}