{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:06:36Z","timestamp":1725566796278},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540235804"},{"type":"electronic","value":"9783540301752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30175-2_11","type":"book-chapter","created":{"date-parts":[[2010,9,23]],"date-time":"2010-09-23T15:34:58Z","timestamp":1285256098000},"page":"206-224","source":"Crossref","is-referenced-by-count":11,"title":["A Fresh Calculus for Name Management"],"prefix":"10.1007","author":[{"given":"Davide","family":"Ancona","sequence":"first","affiliation":[]},{"given":"Eugenio","family":"Moggi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-3","key":"11_CR1","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0168-0072(01)00104-X","volume":"117","author":"Z.M. Ariola","year":"2002","unstructured":"Ariola, Z.M., Blom, S.: Skew confluence and the lambda calculus with letrec. Annals of pure and applied logic\u00a0117(1-3), 95\u2013178 (2002)","journal-title":"Annals of pure and applied logic"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/10704567_4","volume-title":"Principles and Practice of Declarative Programming","author":"D. Ancona","year":"1999","unstructured":"Ancona, D., Zucca, E.: A primitive calculus for module systems. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol.\u00a01702, pp. 62\u201379. Springer, Heidelberg (1999)"},{"issue":"2","key":"11_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1017\/S0956796801004257","volume":"12","author":"D. Ancona","year":"2002","unstructured":"Ancona, D., Zucca, E.: A calculus of module systems. J. Funct. Programming\u00a012(2), 91\u2013132 (2002); Extended version of [AZ99]","journal-title":"J. Funct. Programming"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Cardelli, L.: Program fragments, linking, and modularization. In: Conf. Rec. POPL 1997: 24th ACM Symp. Princ. of Prog. Langs., pp. 266\u2013277 (1997)","DOI":"10.1145\/263699.263735"},{"key":"11_CR5","first-page":"295","volume-title":"Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design","author":"L. Cardelli","year":"1994","unstructured":"Cardelli, L., Mitchell, J.C.: Operations on records. In: Gunter, C.A., Mitchell, J.C. (eds.) Theoretical Aspects of Object-Oriented Programming: Types, Semantics, and Language Design, pp. 295\u2013350. The MIT Press, Cambridge (1994)"},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1017\/S0956796802004598","volume":"13","author":"C. Calcagno","year":"2003","unstructured":"Calcagno, C., Moggi, E., Sheard, T.: Closed types for a safe imperative MetaML. J. Funct. Programming\u00a013(3), 545\u2013571 (2003)","journal-title":"J. Funct. Programming"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1109\/LICS.1996.561317","volume-title":"The Symposium on Logic in Computer Science (LICS 1996)","author":"R. Davies","year":"1996","unstructured":"Davies, R.: A temporal-logic approach to binding-time analysis. In: The Symposium on Logic in Computer Science (LICS 1996), New Brunswick, pp. 184\u2013195. IEEE Computer Society Press, Los Alamitos (1996)"},{"issue":"3","key":"11_CR8","doi-asserted-by":"publisher","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. Journal of the ACM\u00a048(3), 555\u2013604 (2001)","journal-title":"Journal of the ACM"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Gabbay, M.J., Pitts, A.M.: A new approach to abstract syntax involving binders. In: Proc. 14th Ann. IEEE Symp. Logic in Comput. Sci., pp. 214\u2013224 (July 1999)","DOI":"10.1109\/LICS.1999.782617"},{"key":"11_CR10","volume-title":"Partial Evaluation and Automatic Program Generation","author":"N.D. Jones","year":"1993","unstructured":"Jones, N.D., Gomard, C.K., Sestoft, P.: Partial Evaluation and Automatic Program Generation. Prentice Hall, Englewood Cliffs (1993)"},{"key":"11_CR11","series-title":"Sigplan Notices","first-page":"36","volume-title":"ACM Symp. on Object-Oriented Programming: Systems, Languages and Applications 1998","author":"S. Liang","year":"1998","unstructured":"Liang, S., Bracha, G.: Dynamic class loading in the Java Virtual Machine. In: ACM Symp. on Object-Oriented Programming: Systems, Languages and Applications 1998, October 1998. Sigplan Notices, vol.\u00a033(10), pp. 36\u201344. ACM Press, New York (1998)"},{"key":"11_CR12","series-title":"The Java Series","volume-title":"The Java Virtual Machine Specification","author":"T. Lindholm","year":"1999","unstructured":"Lindholm, T., Yellin, F.: The Java Virtual Machine Specification, 2nd edn. The Java Series. Addison-Wesley, Reading (1999)","edition":"2"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36576-1_23","volume-title":"Foundations of Software Science and Computational Structures","author":"E. Moggi","year":"2003","unstructured":"Moggi, E., Fagorzi, S.: A monadic multi-stage metalanguage. In: Gordon, A.D. (ed.) FOSSACS 2003. LNCS, vol.\u00a02620, Springer, Heidelberg (2003)"},{"key":"11_CR14","series-title":"ACM SIGPLAN notices","volume-title":"Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP 2002)","author":"A. Nanevski","year":"2002","unstructured":"Nanevski, A.: Meta-programming with names and necessity. In: Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming (ICFP 2002), October 2002. ACM SIGPLAN notices, ACM Press, New York (2002)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Nanevski, A., Pfenning, F.: Meta-programming with names and necessity (2003) (submitted)","DOI":"10.1145\/581478.581498"},{"key":"11_CR16","unstructured":"Oregon Graduate Institute Technical Reports. P.O. Box 91000, Portland, OR 97291-1000, USA, Available online from ftp:\/\/cse.ogi.edu\/pub\/tech-reports\/README.html"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/10722010_15","volume-title":"Mathematics of Program Construction","author":"A.M. Pitts","year":"2000","unstructured":"Pitts, A.M., Gabbay, M.J.: A metalanguage for programming with bound names modulo renaming. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol.\u00a01837, pp. 230\u2013255. Springer, Heidelberg (2000)"},{"key":"11_CR18","volume-title":"Theoretical Aspects Of Object-Oriented Programming: Types, Semantics and Language Design","author":"D. R\u00e9my","year":"1993","unstructured":"R\u00e9my, D.: Type inference for records in a natural extension of ML. In: Gunter, C.A., Mitchell, J.C. (eds.) Theoretical Aspects Of Object-Oriented Programming: Types, Semantics and Language Design, MIT Press, Cambridge (1993)"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-44806-3_2","volume-title":"Semantics, Applications, and Implementation of Program Generation","author":"T. Sheard","year":"2001","unstructured":"Sheard, T.: Accomplishments and research challenges in meta-programming. In: Taha, W. (ed.) SAIG 2001. LNCS, vol.\u00a02196, pp. 2\u201346. Springer, Heidelberg (2001)"},{"key":"11_CR20","volume-title":"Proc. 8th Int\u2019l Conf. Functional Programming","author":"M.R. Shinwell","year":"2003","unstructured":"Shinwell, M.R., Pitts, A.M., Gabbay, M.J.: Freshml: Programming with binders made simple. In: Proc. 8th Int\u2019l Conf. Functional Programming, ACM Press, New York (2003)"},{"key":"11_CR21","unstructured":"Taha, W.: Multi-Stage Programming: Its Theory and Applications. PhDthesis, Oregon Graduate Inst. of Science and Technology, Available from [Ore] (1999)"}],"container-title":["Lecture Notes in Computer Science","Generative Programming and Component Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30175-2_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:45:10Z","timestamp":1605743110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30175-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540235804","9783540301752"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30175-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}