{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:27:04Z","timestamp":1725460024418},"publisher-location":"Boston","reference-count":15,"publisher":"Kluwer Academic Publishers","isbn-type":[{"type":"print","value":"1402081405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/1-4020-8141-3_33","type":"book-chapter","created":{"date-parts":[[2006,2,21]],"date-time":"2006-02-21T15:15:11Z","timestamp":1140534911000},"page":"423-436","source":"Crossref","is-referenced-by-count":1,"title":["A Calculus with Lazy Module Operators"],"prefix":"10.1007","author":[{"given":"Davide","family":"Ancona","sequence":"first","affiliation":[]},{"given":"Sonia","family":"Fagorzi","sequence":"additional","affiliation":[]},{"given":"Elena","family":"Zucca","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Martin Abadi, Goerges Gonthier, and Benjamin Werner. Choice in dynamic linking. In FOSSACS\u201904-Foundations of Software Science and Computation Structures 2004, Lecture Notes in Computer Science. Springer, 2004.","DOI":"10.1007\/978-3-540-24727-2_3"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"D. Ancona, S. Fagorzi, E. Moggi, and E. Zucca. Mixin modules and computational effects. In Jos C. M. Baeten et al., editors, International Colloquium on Automata, Languages and Programming 2003, number 2719 in Lecture Notes in Computer Science, pages 224\u2013238. Springer, 2003.","DOI":"10.1007\/3-540-45061-0_20"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"D. Ancona, S. Fagorzi, and E. Zucca. A calculus for dynamic linking. In C. Blundo and C. Laneve, editors, Italian Conf. on Theoretical Computer Science 2003, number 2841 in Lecture Notes in Computer Science, pages 284\u2013301, 2003.","DOI":"10.1007\/978-3-540-45208-9_23"},{"issue":"4","key":"33_CR4","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1017\/S0960129598002576","volume":"8","author":"D. Ancona","year":"1998","unstructured":"D. Ancona and E. Zucca. A theory of mixin modules: Basic and derived operators. Mathematical Structures in Computer Science, 8(4):401\u2013446, August 1998.","journal-title":"Mathematical Structures in Computer Science"},{"issue":"2","key":"33_CR5","doi-asserted-by":"crossref","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. Journ. of Functional Programming, 12(2):91\u2013132, 2002.","journal-title":"Journ. of Functional Programming"},{"issue":"3","key":"33_CR6","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1017\/S0956796897002724","volume":"7","author":"Z. M. Ariola","year":"1997","unstructured":"Z. M. Ariola and M. Felleisen. The call-by-need lambda calculus. Journ. of Functional Programming, 7(3):265\u2013301, 1997.","journal-title":"Journ. of Functional Programming"},{"key":"33_CR7","unstructured":"G. Bierman, M. Hicks, P. Sewell, and G. Stoyle. Formalizing dynamic software updating (Extended Abstract). In USE\u201903 Workshop on Unexpected Software Evolution, 2003."},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"L. Cardelli. Program fragments, linking, and modularization. In ACM Symp. on Principles of Programming Languages 1997, pages 266\u2013277. ACM Press, 1997.","DOI":"10.1145\/263699.263735"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"S. Drossopoulou. Towards an abstract model of Java dynamic linking and verfication. In R. Harper, editor, TIC\u201900-Third Workshop on Types in Compilation (Selected Papers), volume 2071 of Lecture Notes in Computer Science, pages 53\u201384. Springer, 2001.","DOI":"10.1007\/3-540-45332-6_3"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"S. Drossopoulou, G. Lagorio, and S. Eisenbach. Flexible models for dynamic linking. In Pierpaolo Degano, editor, ESOP 2003-European Symposium on Programming 2003, pages 38\u201353, April 2003.","DOI":"10.1007\/3-540-36575-3_4"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"S. Fagorzi, E. Zucca, and D. Ancona. Modeling multiple class loaders by a calculus for dynamic linking. In ACM Symp. on Applied Computing (SAC 2004), Special Track on Object-Oriented Programming Languages and Systems. ACM Press, 2004. To appear.","DOI":"10.1145\/967900.968161"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"T. Hirschowitz and X. Leroy. Mixin modules in a call-by-value setting. In D. Le M\u00e9tayer, editor, ESOP 2002-European Symposium on Programming 2002, number 2305 in Lecture Notes in Computer Science, pages 6\u201320. Springer, 2002.","DOI":"10.1007\/3-540-45927-8_2"},{"issue":"3","key":"33_CR13","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1017\/S0956796800003683","volume":"10","author":"X. Leroy","year":"2000","unstructured":"X. Leroy. A modular module system. Journal of Functional Programming, 10(3):269\u2013303, May 2000.","journal-title":"Journal of Functional Programming"},{"key":"33_CR14","unstructured":"Tom Mens and Guenther Kniesel. Workshop on foundations of unanticipated software evolution. ETAPS 2004, http:\/\/joint.org\/fuse2004\/ , 2004."},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"J.B. Wells and R. Vestergaard. Confluent equational reasoning for linking with first-class primitive modules. In ESOP 2000-European Symposium on Programming 2000, number 1782 in Lecture Notes in Computer Science, pages 412\u2013428. Springer 2000.","DOI":"10.1007\/3-540-46425-5_27"}],"container-title":["IFIP International Federation for Information Processing","Exploring New Frontiers of Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/1-4020-8141-3_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:28:17Z","timestamp":1619555297000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/1-4020-8141-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402081405"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/1-4020-8141-3_33","relation":{},"subject":[]}}