{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:24:38Z","timestamp":1725549878779},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291312"},{"type":"electronic","value":"9783540319399"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561163_10","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T10:54:31Z","timestamp":1127818471000},"page":"222-250","source":"Crossref","is-referenced-by-count":0,"title":["Program Generation and Components"],"prefix":"10.1007","author":[{"given":"D.","family":"Ancona","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E.","family":"Moggi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1-3","key":"10_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":"10_CR2","doi-asserted-by":"crossref","unstructured":"Ancona, D., Moggi, E.: A fresh calculus for names management. In: Karsai and Visser [KV04],","DOI":"10.1007\/978-3-540-30175-2_11"},{"key":"10_CR3","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":"10_CR4","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":"10_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Generative Programming and Component Engineering","year":"2002","unstructured":"Batory, D., Consel, C., Taha, W. (eds.): Generative Programming and Component Engineering. LNCS, vol.\u00a02487. Springer, Heidelberg (2002)"},{"key":"10_CR6","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":"10_CR7","volume-title":"Generative Programming: Methods, Tools, and Applications","author":"K. Czarnecki","year":"2000","unstructured":"Czarnecki, K., Eisenecker, U.: Generative Programming: Methods, Tools, and Applications. Addison-Wesley, Reading (2000)"},{"key":"10_CR8","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. MIT Press, Cambridge (1994)"},{"issue":"3","key":"10_CR9","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":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-24725-8_7","volume-title":"Programming Languages and Systems","author":"C. Calcagno","year":"2004","unstructured":"Calcagno, C., Moggi, E., Taha, W.: ML-like inference for classifiers. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol.\u00a02986, pp. 79\u201393. Springer, Heidelberg (2004)"},{"key":"10_CR11","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.\u00a02830, pp. 57\u201376. Springer, Heidelberg (2003)"},{"key":"10_CR12","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":"10_CR13","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":"10_CR14","unstructured":"Programming Languages & Systems, 9th European Symp. Programming. LNCS, vol.\u00a01782. Springer, Heidelberg (2000)"},{"key":"10_CR15","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., July 1999, pp. 214\u2013224 (1999)","DOI":"10.1109\/LICS.1999.782617"},{"key":"10_CR16","volume-title":"Software Factories: Assembling Applications with Patterns, Models, Frameworks and Tools","author":"J. Greenfield","year":"2004","unstructured":"Greenfield, J., Short, K.: Software Factories: Assembling Applications with Patterns, Models, Frameworks and Tools. Wiley Publishing Inc, Chichester (2004)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/3-540-36575-3_20","volume-title":"Programming Languages and Systems","author":"C. Haack","year":"2003","unstructured":"Haack, C., Wells, J.B.: Type error slicing in implicitly typed higher-order languages. In: Degano, P. (ed.) ESOP 2003. LNCS, vol.\u00a02618, pp. 284\u2013301. Springer, Heidelberg (2003); Superseded by [HW04]"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/j.scico.2004.01.004","volume":"50","author":"C. Haack","year":"2004","unstructured":"Haack, C., Wells, J.B.: Type error slicing in implicitly typed, higher-order languages. Sci. Comput. Programming\u00a050, 189\u2013224 (2004) (Supersedes [HW03])","journal-title":"Sci. Comput. Programming"},{"key":"10_CR19","unstructured":"Karsai, G., Visser, E. (eds.) GPCE 2004. LNCS, vol.\u00a03286. Springer, Heidelberg (2004)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Lengauer, C., Batory, D., Consel, C., Odersky, M. (eds.) Domain-Specific Program Generation. LNCS, vol.\u00a03016. Springer, Heidelberg (2004)","DOI":"10.1007\/b98156"},{"key":"10_CR21","unstructured":"MetaOCaml: A compiled, type-safe multi-stage programming language (2001), Available online from http:\/\/www.cs.rice.edu\/~taha\/MetaOCaml\/"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","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, pp. 358\u2013374. Springer, Heidelberg (2003)"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-46425-5_17","volume-title":"Programming Languages and Systems","author":"E. Machkasova","year":"2000","unstructured":"Machkasova, E., Turbak, F.A.: A calculus for link-time compilation. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol.\u00a01782, pp. 260\u2013274. Springer, Heidelberg (2000)"},{"key":"10_CR24","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), New York, October 2002. ACM SIGPLAN notices, ACM Press, New York (2002)"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Nanevski, A., Pfenning, F.: Staged computations with names and necessity. J. Funct. Programming (to appear)","DOI":"10.1017\/S095679680500568X"},{"key":"10_CR26","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":"10_CR27","series-title":"Lecture Notes in Computer Science","volume-title":"Generative Programming and Component Engineering","year":"2003","unstructured":"Pfenning, F., Smaragdakis, Y. (eds.): GPCE 2003. LNCS, vol.\u00a02830. Springer, Heidelberg (2003)"},{"key":"10_CR28","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":"10_CR29","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":"10_CR30","volume-title":"Component Software: Beyond Object-Oriented Programming","author":"C. Szyperski","year":"2002","unstructured":"Szyperski, C.: Component Software: Beyond Object-Oriented Programming, 2nd edn. Addison Wesley, Reading (2002)","edition":"2"},{"key":"10_CR31","unstructured":"Taha, W.: Multi-Stage Programming: Its Theory and Applications. PhD thesis, Oregon Graduate Inst. of Science and Technology (1999), Available from ftp:\/\/cse.ogi.edu\/pub\/tech-reports\/README.html"},{"key":"10_CR32","doi-asserted-by":"crossref","unstructured":"Taha, W., Nielsen, M.F.: Environment classifiers. In: The Symposium on Principles of Programming Languages (POPL 2003), New Orleans (2003)","DOI":"10.1145\/604131.604134"},{"key":"10_CR33","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1145\/258993.259019","volume-title":"Proceedings of the Symposium on Partial Evaluation and Semantic-Based Program Manipulation(PEPM)","author":"W. Taha","year":"1997","unstructured":"Taha, W., Sheard, T.: Multi-stage programming with explicit annotations. In: Proceedings of the Symposium on Partial Evaluation and Semantic-Based Program Manipulation(PEPM), Amsterdam, pp. 203\u2013217. ACM Press, New York (1997)"},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Wells, J.B.: Ren\u00e9 Vestergaard. Confluent equational reasoning for linking with first-class primitive modules (long version). A short version is [WV00]. Full paper, 3 appendices of proofs (August 1999)","DOI":"10.1007\/3-540-46425-5_27"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Wells, J.B., Vestergaard, R.: Equational reasoning for linking with first-class primitive modules. In ESOP 2000 [ESOP00], pp. 412\u2013428. A long version is [WV99]","DOI":"10.1007\/3-540-46425-5_27"}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Components and Objects"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561163_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T19:14:11Z","timestamp":1586459651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561163_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291312","9783540319399"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/11561163_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}