{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:43:42Z","timestamp":1742921022356,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540008972"},{"type":"electronic","value":"9783540365761"}],"license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36576-1_23","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T02:42:17Z","timestamp":1181616137000},"page":"358-374","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A Monadic Multi-stage Metalanguage"],"prefix":"10.1007","author":[{"given":"Eugenio","family":"Moggi","sequence":"first","affiliation":[]},{"given":"Sonia","family":"Fagorzi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S1571-0661(05)80280-4","volume":"26","author":"Nick Benton","year":"1999","unstructured":"N. Benton and A. Kennedy. Monads, effects and transformations. In Proceedings of the Third International Workshop on Higher Order Operational Techniques in Semantics (HOOTS-99), volume 26 of Electronic Notes in Theoretical Computer Science, Paris, September 1999. Elsevier.","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"23_CR2","first-page":"81","volume-title":"The chemical abstract machine","author":"G. Berry","year":"1990","unstructured":"G. Berry and G. Boudol. The chemical abstract machine. In Conf. Record 17th ACM Symp. on Principles of Programmming Languages, POPL\u201990, San Francisco, CA, USA, 17\u201319 Jan. 1990, pages 81\u201394. ACM Press, New York, 1990."},{"key":"23_CR3","unstructured":"C. Calcagno, E. Moggi, and T. Sheard. Closed types for a safe imperativeMetaML. Journal of Functional Programming, to appear."},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"R. Davies. A temporal-logic approach to binding-time analysis. In the Symposium on Logic in Computer Science (LICS\u2019 96), pages 184\u2013195, New Brunswick, 1996. IEEE Computer Society Press.","DOI":"10.1109\/LICS.1996.561317"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"R. Davies and F. Pfenning. A modal analysis of staged computation. In the Symposium on Principles of Programming Languages (POPL\u2019 96), pages 258\u2013270, St. Petersburg Beach, 1996.","DOI":"10.1145\/237721.237788"},{"key":"23_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/3-540-45413-6_15","volume-title":"Normalization by evaluation for the computational lambda-calculus","author":"A. Filinski","year":"2001","unstructured":"A. Filinski. Normalization by evaluation for the computational lambda-calculus.In Samson Abramsky, editor, Proc. of 5th Int. Conf. on Typed Lambda Calculi and Applications, TLCA\u201901, Krakow, Poland, 2\u20135 May 2001, volume 2044 of Lecture Notes in Computer Science, pages 151\u2013165. Springer-Verlag, Berlin, 2001."},{"key":"23_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BFb0026825","volume-title":"Programming Languages: Implementations, Logics and Programs (PLILP\u201995)","author":"R. Gl\u00fcck","year":"1995","unstructured":"R. Gl\u00fcck and J. J\u00f8rgensen. Efficient multi-level generating extensions for program specialization. In S. D. Swierstra and M. Hermenegildo, editors, Programming Languages: Implementations, Logics and Programs (PLILP\u201995), volume 982 of Lecture Notes in Computer Science, pages 259\u2013278. Springer-Verlag, 1995."},{"key":"23_CR8","unstructured":"J. W. Klop. Combinatory Reduction Systems. PhD thesis, University of Utrecht, 1980. Published as Mathematical Center Tract 129."},{"key":"23_CR9","unstructured":"The MetaML Home Page, 2000. Provides source code and documentation online at http:\/\/www.cse.ogi.edu\/PacSoft\/projects\/metaml\/index.html."},{"issue":"9","key":"23_CR10","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1145\/583852.581498","volume":"37","author":"Aleksandar Nanevski","year":"2002","unstructured":"A. Nanevski. Meta-programming with names and necessity. In Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP-02), ACM SIGPLAN notices, New York, October 2002. ACM Press.","journal-title":"ACM SIGPLAN Notices"},{"key":"23_CR11","unstructured":"M. F. Nielsen and W. Taha. Environment classifiers. In Proceedings of the ACM Symposium on Principles of Programming Languages (POPL), N.Y., January 15\u201317 2003. ACM Press."},{"key":"23_CR12","unstructured":"S. P. Jones, J. Hughes, L. Augustsson, D. Barton, and et. al. Haskell 1.4: A non-strict, purely functional language. Technical Report YALEU\/DCS\/RR-1106, Department of Computer Science, Yale University, Mar 1997. World Wide Web version at http:\/\/haskell.cs.yale.edu\/haskell-report."},{"key":"23_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/10722010_15","volume-title":"Mathematics of Programme Construction","author":"A. M. Pitts","year":"2000","unstructured":"A. M. Pitts and M. J. Gabbay. A metalanguage for programming with bound names modulo renaming. In Mathematics of Programme Construction, volume 1837 of Lecture Notes in Computer Science, pages 230\u2013255. Springer-Verlag, 2000."},{"key":"23_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/3-540-44806-3_2","volume-title":"Accomplishments and research challenges in meta-programming","author":"T. Sheard","year":"2001","unstructured":"T. Sheard. Accomplishments and research challenges in meta-programming. In W. Taha, editor, Proc. of the Int. Work. on Semantics, Applications, and Implementations of Program Generation (SAIG), volume 2196 of LNCS, pages 2\u201346. Springer-Verlag, 2001."},{"key":"23_CR15","unstructured":"W. Taha. Multi-Stage Programming: Its Theory and Applications. PhD thesis, Oregon Graduate Institute of Science and Technology, 1999. Available from ftp:\/\/cse.ogi.edu\/pub\/tech-reports\/README.html."},{"issue":"1-2","key":"23_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(00)00053-0","volume":"248","author":"Walid Taha","year":"2000","unstructured":"W. Taha and T. Sheard.MetaML: Multi-stage programming with explicit annotations. Theoretical Computer Science, 248(1\u20132), 2000.","journal-title":"Theoretical Computer Science"},{"key":"23_CR17","unstructured":"P. Thiemann and D. Dussart. Partial evaluation for higher-order languages with state, 1999. Available from http:\/\/www.informatik.uni-freiburg.de\/~thiemann\/papers\/index.html"},{"issue":"1","key":"23_CR18","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/291251.289429","volume":"34","author":"Philip Wadler","year":"1999","unstructured":"P. Wadler. The marriage of effects and monads. In the International Conference on Functional Programming (ICFP\u2019 98), volume 34(1) of ACM SIGPLAN Notices, pages 63\u201374. ACM, June 1999.","journal-title":"ACM SIGPLAN Notices"},{"issue":"1","key":"23_CR19","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/inco.1994.1093","volume":"115","author":"A. K. Wright","year":"1994","unstructured":"A. K. Wright and M. Felleisen. A syntactic approach to type soundness. Information and Computation, 115(1):38\u201394, 1994.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36576-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:54:14Z","timestamp":1737093254000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-36576-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540008972","9783540365761"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-36576-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]},"assertion":[{"value":"28 February 2003","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}