{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T23:09:42Z","timestamp":1693868982725},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2003,1,17]],"date-time":"2003-01-17T00:00:00Z","timestamp":1042761600000},"content-version":"unspecified","delay-in-days":47,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Struct. Comp. Sci."],"published-print":{"date-parts":[[2002,12]]},"abstract":"<jats:p>Mixins are modules that may contain deferred components, that is, components not defined \nin the module itself; moreover, in contrast to parameterised modules (like ML functors), \nthey can be mutually dependent and allow their definitions to be overridden. In a preceding \npaper we defined a syntax and denotational semantics of a kernel language of mixin \nmodules. Here, we take instead an axiomatic approach, giving a set of algebraic laws \nexpressing the expected properties of a small set of primitive operators on mixins. \nInterpreting axioms as rewriting rules, we get a reduction semantics for the language and \nprove the existence of normal forms. Moreover, we show that the model defined in the \nearlier paper satisfies the given axiomatisation.<\/jats:p>","DOI":"10.1017\/s0960129502003687","type":"journal-article","created":{"date-parts":[[2003,2,7]],"date-time":"2003-02-07T09:15:20Z","timestamp":1044609320000},"page":"701-737","source":"Crossref","is-referenced-by-count":5,"title":["A theory of mixin modules: algebraic laws and reduction semantics"],"prefix":"10.1017","volume":"12","author":[{"given":"DAVIDE","family":"ANCONA","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ELENA","family":"ZUCCA","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2003,1,17]]},"container-title":["Mathematical Structures in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0960129502003687","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T20:09:09Z","timestamp":1557173349000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0960129502003687\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":0,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S0960129502003687"],"URL":"https:\/\/doi.org\/10.1017\/s0960129502003687","relation":{},"ISSN":["0960-1295","1469-8072"],"issn-type":[{"value":"0960-1295","type":"print"},{"value":"1469-8072","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}