{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:31:42Z","timestamp":1725492702026},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433637"},{"type":"electronic","value":"9783540459279"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45927-8_2","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T09:39:04Z","timestamp":1192786744000},"page":"6-20","source":"Crossref","is-referenced-by-count":22,"title":["Mixin Modules in a Call-by-Value Setting"],"prefix":"10.1007","author":[{"given":"Tom","family":"Hirschowitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Leroy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"2_CR1","unstructured":"D. Ancona. Modular formal frameworks for module systems. PhD thesis, Universita di Pisa, 1998."},{"key":"2_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/10704567_4","volume-title":"Princ. and Practice of Decl. Prog.","author":"D. Ancona","year":"1999","unstructured":"D. Ancona and E. Zucca. A primitive calculus for module systems. In G. Nadathur, editor, Princ. and Practice of Decl. Prog., volume 1702 of LNCS, pages 62\u201379. Springer-Verlag, 1999."},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"D. Ancona and E. Zucca. A calculus of module systems. Journal of functional programming, 2001. To appear.","DOI":"10.1017\/S0956796801004257"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Z. Ariola and S. Blom. Skew confluence and the lambda calculus with letrec. Annals of pure and applied logic, 2001. To appear.","DOI":"10.1016\/S0168-0072(01)00104-X"},{"issue":"4","key":"2_CR5","doi-asserted-by":"crossref","first-page":"325","DOI":"10.3233\/FI-1999-38401","volume":"38","author":"V. Bono","year":"1999","unstructured":"V. Bono, M. Bugliesi, M. Dezani-Ciancaglini, and L. Liquori. Subtyping for extensible, incomplete objects. Fundamenta Informaticae, 38(4):325\u2013364, 1999.","journal-title":"Fundamenta Informaticae"},{"key":"2_CR6","series-title":"Lect Notes Comput Sci","volume-title":"The recursive record semantics of objects revisited","author":"G. Boudol","year":"2001","unstructured":"G. Boudol. The recursive record semantics of objects revisited. Research report 4199, INRIA, 2001. Preliminary version presented at ESOP\u201901, LNCS 2028."},{"key":"2_CR7","unstructured":"G. Bracha. The programming language Jigsaw: mixins, modularity and multiple inheritance. PhD thesis, University of Utah, 1992."},{"issue":"10","key":"2_CR8","first-page":"303","volume":"25","author":"G. Bracha","year":"1990","unstructured":"G. Bracha and W. Cook. Mixin-based inheritance. In OOPSLA90, volume 25(10) of SIGPLAN Notices, pages 303\u2013311. ACM Press, 1990.","journal-title":"OOPSLA90"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"L. Cardelli. Program fragments, linking, and modularization. In 24th symp. Principles of Progr. Lang, pages 266\u2013277. ACM Press, 1997.","DOI":"10.1145\/263699.263735"},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0167-6423(87)90020-7","volume":"8","author":"G. Cousineau","year":"1987","unstructured":"G. Cousineau, P.-L. Curien, and M. Mauny. The categorical abstract machine. Science of Computer Programming, 8(2):173\u2013202, 1987.","journal-title":"Science of Computer Programming"},{"key":"2_CR11","unstructured":"K. Crary, R. Harper, and S. Puri. What is a recursive module? In Prog. Lang. Design and Impl. 1999, pages 50\u201363. ACM Press, 1999."},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"D. Dreyer, K. Crary, and R. Harper. Toward a practical type theory for recursive modules. Technical Report CMU-CS-01-112, Carnegie Mellon University, 2001.","DOI":"10.21236\/ADA460172"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"D. Duggan and C. Sourelis. Mixin modules. In Int. Conf. on Functional Progr. 96, pages 262\u2013273. ACM Press, 1996.","DOI":"10.1145\/232627.232654"},{"key":"2_CR14","unstructured":"D. Duggan and C. Sourelis. Recursive modules and mixin-based inheritance. Unpublished draft, 2001."},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"M. Flatt and M. Felleisen. Units: cool modules for HOT languages. In Prog. Lang. Design and Impl. 1998, pages 236\u2013248. ACM Press, 1998.","DOI":"10.1145\/277650.277730"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"R. Harper and M. Lillibridge. A type-theoretic approach to higher-order modules with sharing. In 21st symp. Principles of Progr. Lang, pages 123\u2013137. ACM Press, 1994.","DOI":"10.1145\/174675.176927"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"T. Hirschowitz and X. Leroy. Mixin modules in a call-by-value setting (long version). Available at http:\/\/pauillac.inria.fr\/~hirschow , 2001.","DOI":"10.1007\/3-540-45927-8_2"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"X. Leroy. Manifest types, modules, and separate compilation. In 21st symp. Principles of Progr. Lang, pages 109\u2013122. ACM Press, 1994.","DOI":"10.1145\/174675.176926"},{"key":"2_CR19","unstructured":"M. Lillibridge. Translucent sums: a foundation for higher-order module systems. PhD thesis, School of Computer Science, Carnegie Mellon University, 1997."},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"C. Russo. Recursive structures for Standard ML. In Int. Conf. on Functional Progr. 01, pages 50\u201361, 2001.","DOI":"10.1145\/507635.507644"},{"key":"2_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1007\/3-540-46425-5_27","volume-title":"Equational reasoning for linking with first-class primitive modules","author":"J. Wells","year":"2000","unstructured":"J. Wells and R. Vestergaard. Equational reasoning for linking with first-class primitive modules. In Programming Languages and Systems, 9th European Symp. Programming, volume 1782 of LNCS, pages 412\u2013428. Springer-Verlag, 2000."}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45927-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,27]],"date-time":"2020-04-27T08:01:09Z","timestamp":1587974469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45927-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433637","9783540459279"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-45927-8_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}