{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:22:05Z","timestamp":1725560525883},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540213130"},{"type":"electronic","value":"9783540247258"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24725-8_6","type":"book-chapter","created":{"date-parts":[[2010,7,28]],"date-time":"2010-07-28T00:15:44Z","timestamp":1280276144000},"page":"64-78","source":"Crossref","is-referenced-by-count":7,"title":["Call-by-Value Mixin Modules"],"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"}]},{"given":"J. B.","family":"Wells","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Ancona, D., Fagorzi, S., Moggi, E., Zucca, E.: Mixin modules and computational effects. In: Int\u2019l Col. on Automata, Lang. and Progr. (2003)","DOI":"10.1007\/3-540-45061-0_20"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Ancona, D., Zucca, E.: A calculus of module systems. J. Func. Progr.\u00a012(2) (2002)","DOI":"10.1017\/S0956796801004257"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/3-540-48743-3_3","volume-title":"ECOOP \u201999 - Object-Oriented Programming","author":"V. Bono","year":"1999","unstructured":"Bono, V., Patel, A., Shmatikov, V.: A core calculus of classes and mixins. In: Guerraoui, R. (ed.) ECOOP 1999. LNCS, vol.\u00a01628, p. 43. Springer, Heidelberg (1999)"},{"key":"6_CR4","unstructured":"Bracha, G.: The Programming Language Jigsaw: Mixins, Modularity and Multiple Inheritance. PhD thesis, University of Utah (1992)"},{"key":"6_CR5","volume-title":"24th symp. Principles of Progr. Lang.","author":"L. Cardelli","year":"1997","unstructured":"Cardelli, L.: Program fragments, linking, and modularization. In: 24th symp. Principles of Progr. Lang. ACM Press, New York (1997)"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Cook, W.R.: A Denotational Semantics of Inheritance. PhD thesis, Department of Computer Science, Brown University (1989)","DOI":"10.1145\/74877.74922"},{"key":"6_CR7","volume-title":"Prog. Lang. Design and Impl.","author":"K. Crary","year":"1999","unstructured":"Crary, K., Harper, R., Puri, S.: What is a recursive module? In: Prog. Lang. Design and Impl. ACM Press, New York (1999)"},{"key":"6_CR8","volume-title":"31st symp. Principles of Progr. Lang.","author":"D. Dreyer","year":"2004","unstructured":"Dreyer, D.: A type system for well-founded recursion. In: 31st symp. Principles of Progr. Lang. ACM Press, New York (2004) (to appear)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Dreyer, D.R., Harper, R., Crary, K.: Toward a practical type theory for recursive modules. Technical Report CMU-CS-01-112, Carnegie Mellon University, Pittsburgh, PA (2001)","DOI":"10.21236\/ADA460172"},{"key":"6_CR10","volume-title":"Int. Conf. on Functional Progr.","author":"D. Duggan","year":"1996","unstructured":"Duggan, D., Sourelis, C.: Mixin modules. In: Int. Conf. on Functional Progr. ACM Press, New York (1996)"},{"key":"6_CR11","volume-title":"Int. Conf. on Functional Progr.","author":"R.B. Findler","year":"1998","unstructured":"Findler, R.B., Flatt, M.: Modular object-oriented programming with units and mixins. In: Int. Conf. on Functional Progr. ACM Press, New York (1998)"},{"key":"6_CR12","volume-title":"Prog. Lang. Design and Impl.","author":"M. Flatt","year":"1998","unstructured":"Flatt, M., Felleisen, M.: Units: cool modules for HOT languages. In: Prog. Lang. Design and Impl. ACM Press, New York (1998)"},{"key":"6_CR13","volume-title":"25th symp. Principles of Progr. Lang.","author":"M. Flatt","year":"1998","unstructured":"Flatt, M., Krishnamurthi, S., Felleisen, M.: Classes and mixins. In: 25th symp. Principles of Progr. Lang. ACM Press, New York (1998)"},{"key":"6_CR14","volume-title":"21st symp. Principles of Progr. Lang.","author":"R. Harper","year":"1994","unstructured":"Harper, R., Lillibridge, M.: A type-theoretic approach to higher-order modules with sharing. In: 21st symp. Principles of Progr. Lang. ACM Press, New York (1994)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Harper, R., Pierce, B.: A record calculus based on symmetric concatenation. In: 18th symp. Principles of Progr. Lang., Orlando, Florida (1991)","DOI":"10.1145\/99583.99603"},{"key":"6_CR16","unstructured":"Hirschowitz, T.: Modules mixins, modules et r\u00e9cursion \u00e9tendue en appel par valeur. PhD thesis, University of Paris VII (2003)"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/3-540-45927-8_2","volume-title":"Programming Languages and Systems","author":"T. Hirschowitz","year":"2002","unstructured":"Hirschowitz, T., Leroy, X.: Mixin modules in a call-by-value setting. In: Le M\u00e9tayer, D. (ed.) ESOP 2002. LNCS, vol.\u00a02305, pp. 6\u201320. Springer, Heidelberg (2002)"},{"key":"6_CR18","volume-title":"Princ. and Practice of Decl. Prog.","author":"T. Hirschowitz","year":"2003","unstructured":"Hirschowitz, T., Leroy, X., Wells, J.B.: Compilation of extended recursion in callby- value functional languages. In: Princ. and Practice of Decl. Prog. ACM Press, New York (2003)"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Hirschowitz, T., Leroy, X., Wells, J.B.: A reduction semantics for call-by-value mixin modules. Research report RR-4682, Inria (2003)","DOI":"10.1007\/978-3-540-24725-8_6"},{"key":"6_CR20","volume-title":"21st symp. Principles of Progr. Lang.","author":"X. Leroy","year":"1994","unstructured":"Leroy, X.: Manifest types, modules, and separate compilation. In: 21st symp. Principles of Progr. Lang. ACM Press, New York (1994)"},{"key":"6_CR21","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, p. 260. Springer, Heidelberg (2000)"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Moon, D.A.: Object-oriented programming with Flavors. In: OOPSLA (1986)","DOI":"10.1145\/28697.28698"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Odersky, M., Cremet, V., R\u00f6ckl, C., Zenger, M.: A nominal theory of objects with dependent types. In: FOOL 2003 (2003)","DOI":"10.1007\/978-3-540-45070-2_10"},{"key":"6_CR24","unstructured":"Pottier, F.: A versatile constraint-based type inference system. Nordic Journal of Computing\u00a07(4) (2000)"},{"key":"6_CR25","volume-title":"Int. Conf. on Functional Progr.","author":"C.V. Russo","year":"2001","unstructured":"Russo, C.V.: Recursive structures for Standard ML. In: Int. Conf. on Functional Progr. ACM Press, New York (2001)"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/3-540-46425-5_27","volume-title":"Programming Languages and Systems","author":"J.B. Wells","year":"2000","unstructured":"Wells, J.B., Vestergaard, R.: Equational reasoning for linking with first-class primitive modules. In: Smolka, G. (ed.) ESOP 2000. LNCS, vol.\u00a01782, p. 412. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24725-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T02:42:24Z","timestamp":1578537744000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24725-8_6"}},"subtitle":["Reduction Semantics, Side Effects, Types"],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540213130","9783540247258"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24725-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}