{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:01:58Z","timestamp":1725487318327},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540404934"},{"type":"electronic","value":"9783540450610"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45061-0_20","type":"book-chapter","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T11:54:04Z","timestamp":1184586844000},"page":"224-238","source":"Crossref","is-referenced-by-count":6,"title":["Mixin Modules and Computational Effects"],"prefix":"10.1007","author":[{"given":"Davide","family":"Ancona","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sonia","family":"Fagorzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugenio","family":"Moggi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elena","family":"Zucca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,18]]},"reference":[{"key":"20_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/10704567_4","volume-title":"Principles and Practice of Declarative Programming, 1999","author":"D. Ancona","year":"1999","unstructured":"D. Ancona and E. Zucca. A primitive calculus for module systems. In G. Nadathur, editor, Principles and Practice of Declarative Programming, 1999, number 1702 in Lecture Notes in Computer Science, pages 62\u201379. Springer Verlag, 1999."},{"issue":"2","key":"20_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1017\/S0956796801004257","volume":"12","author":"D. Ancona","year":"2002","unstructured":"D. Ancona and E. Zucca. A calculus of module systems. Journal of Functional Programming, 12(2):91\u2013132, March 2002.","journal-title":"Journal of Functional Programming"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"G. Bracha and W. Cook. Mixin-based inheritance. In Proc. of the Joint ACM Conf. on Object-Oriented Programming, Systems, Languages and Applications and the European Conference on Object-Oriented Programming, October 1990.","DOI":"10.1145\/97945.97982"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"G. Boudol. The recursive record semantics of objects revisited. To appear in Journal of Functional Programming, 2002.","DOI":"10.1007\/3-540-45309-1_18"},{"key":"20_CR5","unstructured":"G. Bracha. The Programming Language JIGSAW: Mixins, Modularity and Multiple Inheritance. PhD thesis, Department of Comp. Sci., Univ. of Utah, 1992."},{"key":"20_CR6","unstructured":"W.R. Cook. ADenotational Semantics of Inheritance. PhD thesis, Dept. of Computer Science, Brown University, 1989."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"D. Duggan and C. Sourelis. Mixin modules. In Intl. Conf. on Functional Programming, Philadelphia, May 1996. ACM Press.","DOI":"10.1145\/232627.232654"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"L. Erk\u00f6k and J. Launchbury. Recursive monadic bindings. In Intl. Conf. on Functional Programming 2000, pages 174\u2013185, 2000.","DOI":"10.1145\/357766.351257"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"L. Erk\u00f6k and J. Launchbury. A recursive do for Haskell. In Haskell Workshop\u2019 02, pages 29\u201337, 2002.","DOI":"10.1145\/581690.581693"},{"key":"20_CR10","unstructured":"L. Erk\u00f6k, J. Launchbury, and A. Moran. Semantics of fixIO. In FICS\u201901, 2001."},{"issue":"2","key":"20_CR11","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1051\/ita:2002008","volume":"36","author":"L. Erk\u00f6k","year":"2002","unstructured":"L. Erk\u00f6k, J. Launchbury, and A. Moran. Semantics of value recursion for monadic input\/output. Journal of Theoretical Informatics and Applications, 36(2):155\u2013180, 2002.","journal-title":"Journal of Theoretical Informatics and Applications"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"R.B. Findler and M. Flatt. Modular object-oriented programming withunits and mixins. In Intl. Conf. on Functional Programming 1998, September 1998.","DOI":"10.1145\/289423.289432"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"M. Flatt and M. Felleisen. Units: Cool modules for HOT languages. In PLDI\u201998-ACM Conf. on Programming Language Design and Implementation, pages 236\u2013248, 1998.","DOI":"10.1145\/277652.277730"},{"issue":"3","key":"20_CR14","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01211554","volume":"5","author":"A. V. Hense","year":"1993","unstructured":"A. V. Hense. Denotational semantics of an object-oriented programming language with explicit wrappers. Formal Aspects of Computing,5(3):181\u2013207, 1993.","journal-title":"Formal Aspects of Computing"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"R. Harper and M. Lillibridge. A type-theoretic approach to higher-order modules withsh aring. In Conference record of POPL\u2019 94: 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 123\u2013137, 1994.","DOI":"10.1145\/174675.176927"},{"key":"20_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/3-540-45927-8_2","volume-title":"ESOP 2002-Programming Languages and Systems","author":"T. Hirschowitz","year":"2002","unstructured":"T. Hirschowitz and X. Leroy. Mixin modules in a call-by-value setting. In D. Le M\u00e9tayer, editor, ESOP 2002-Programming Languages and Systems, number 2305 in Lecture Notes in Computer Science, pages 6\u201320. Springer Verlag, 2002."},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"X. Leroy. Manifest types, modules and separate compilation. In Proc. 21st ACM Symp. on Principles of Programming Languages, pages 109\u2013122. ACM Press, 1994.","DOI":"10.1145\/174675.176926"},{"key":"20_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/3-540-36576-1_23","volume-title":"Foundations of Software Science and Computational Structures-FOSSACS 2003","author":"E. Moggi","year":"2003","unstructured":"E. Moggi and S. Fagorzi. A Monadic Multi-stage Metalanguage. In A.D. Gordon, editor, Foundations of Software Science and Computational Structures-FOSSACS 2003, volume 2620 of LNCS, pages 358\u2013374. Springer Verlag, 2003."},{"key":"20_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-46425-5_17","volume-title":"ESOP 2000-Programming Languages and Systems","author":"E. Machkasova","year":"2000","unstructured":"E. Machkasova and F.A. Turbak. A calculus for link-time compilation. In G. Smolka, editor, ESOP 2000-Programming Languages and Systems, number 1782 in Lecture Notes in Computer Science, pages 260\u2013274, Berlin, 2000. Springer Verlag."},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"U. S. Reddy. Objects as closures: Abstract semantics of object-oriented languages. In Proc. ACM Conf. on Lisp and Functional Programming, pages 289\u2013297, 1988.","DOI":"10.1145\/62678.62721"},{"issue":"1","key":"20_CR21","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1006\/inco.1994.1093","volume":"115","author":"A. K","year":"1994","unstructured":"Andrew K. Wright and Matthias Felleisen. A syntactic approach to type soundness. Information and Computation, 115(1):38\u201394, 1994.","journal-title":"Information and Computation"},{"key":"20_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/3-540-46425-5_27","volume-title":"ESOP 2000-Programming Languages and Systems","author":"J.B. Wells","year":"2000","unstructured":"J.B. Wells and R. Vestergaard. Equational reasoning for linking with first-class primitive modules. In G. Smolka, editor, ESOP 2000-Programming Languages and Systems, number 1782 in Lecture Notes in Computer Science, pages 412\u2013428, Berlin, 2000. Springer Verlag."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45061-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:14:46Z","timestamp":1556666086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45061-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540404934","9783540450610"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-45061-0_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}