| D. Ancona and E. Zucca. An algebra of mixin modules. In F. Parisi-Presicce, editor, Proc. WADT '97 - 12th Workshop on Algebraic Development Techniques, Tarquinia, Italy. Selected Papers, Lecture Notes in Computer Science, Berlin, 1998. Springer Verlag. To appear. |
.... of their MzScheme language with cyclically dependent units [8] Duggan and Sourelis s mixin modules that extend the Standard ML module system with a special mixlink construct for integrating mutually dependent structures [6, 7] and Ancona and Zucca s algebraic forrealism for mixin modules [2]. Each of these proposals seeks to address the problem of cyclic dependencies in a module system, but each does so in a slightly different way. For example, Flatt and Felleisen s formalism does not address the critical issue of controlling propagation of type information across module boundaries. ....
Davide Ancona and Elena Zucca. An algebra of mixin modules. In F. Parisi-Presicce, editor, WADT '97 lth Workshop on Algebraic Development Techniques - Selected Papers, volume 1376 of Lecture Notes in Computer Science, pages 92-106, Berlin, 1997. Springer Verlag.
....by proving the system is confluent. 1.3 A More General Notion of Module. The key to achieving the abovementioned goals in the m calculus is the use of a more general notion of module together with a linking operation. An incomplete or abstract module (introduced as a mixin module or a mixin in [3], formalized in a calculus in [4] and related to the notions of mixin in [16, 17, 12, 11] is a collection of components of which some are exported (externally visible) some are private, and some are declared but not defined. We call the latter deferred components. For example, consider the ....
.... although similar to ours, has a notion of substitution which we believe is less convenient and 13 no published proof of rewriting properties [4] Earlier, Ancona and Zucca also presented an algebra for simplifying module expressions which is not powerful enough to represent general computation [3]. Machkasova and Turbak give a calculus for linking outermost only modules in a call by value language [34] From a non equational reasoning point of view, Flatt and Felleisen give a calculus of modules with similar capabilities to ours [20] Glew and Morrisett present a module calculus tailored ....
D. Ancona and E. Zucca. An algebra of mixin modules. In F. P. Presicce, editor, Recent Trends in Algebraic Development Techniques (12th Int'l Workshop, WADT '97 --- Selected Papers), number 1376 in LNCS, pages 92--106. Springer-Verlag, 1998.
....rules by proving the system is confluent. 1.3 A More General Notion of Module The key to achieving the above mentioned goals in the m calculus is the use of a more general notion of module together with a linking operation. An incomplete or abstract module (called a mixin module or a mixin in [AZ98] and closely related to the notions of mixin in [DS96, DS98, BL92, Bra92] is a collection of components of which some are exported (externally visible) some are private, and some are declared but not defined. We call the latter deferred components. Consider the following example incomplete ....
.... quite similar to ours, but they choose to focus on the simply typed version of it rather than proving properties of the rewriting relation [AZ99] Earlier, Ancona and Zucca also presented an algebra which can simplify module expressions, but is not powerful enough to represent general computation [AZ98]. From a point of view less oriented towards rewriting calculi, Flatt and Felleisen give a calculus of modules with similar capabilities to ours [FF98b] Glew and Morrisett present a module calculus tailored towards dealing with linking of object files containing assembly language level code ....
Davide Ancona and Elena Zucca. An algebra of mixin modules. In F. Parisi Presicce, editor, Recent Trends in Algebraic Development Techniques (12th Int'l Workshop, WADT '97 --- Selected Papers), number 1376 in LNCS, pages 92--106. Springer-Verlag, 1998.
.... of their MzScheme language with cyclically dependent units [6] Duggan and Sourelis s mixin modules that extend the Standard ML module system with a special mixlink construct for integrating mutually dependent structures [4, 5] and Ancona and Zucca s algebraic formalism for mixin modules [2]. Each of these proposals seeks to address the problem of cyclic dependencies in a module system, but each does so in a slightly different way. For example, Flatt and Felleisen s formalism does not address the critical issue of controlling propagation of type information across module boundaries. ....
Davide Ancona and Elena Zucca. An algebra of mixin modules. In F. Parisi-Presicce, editor, WADT '97 12th Workshop on Algebraic Development Techniques -- Selected Papers, volume 1376 of Lecture Notes in Computer Science, pages 92--106, Berlin, 1997. Springer Verlag.
.... of their MzScheme language with cyclically dependent units [8] Duggan and Sourelis s mixin modules that extend the Standard ML module system with a special mixlink construct for integrating mutually dependent structures [6, 7] and Ancona and Zucca s algebraic formalism for mixin modules [2]. Each of these proposals seeks to address the problem of cyclic dependencies in a module system, but each does so in a slightly different way. For example, Flatt and Felleisen s formalism does not address the critical issue of controlling propagation of type information across module boundaries. ....
Davide Ancona and Elena Zucca. An algebra of mixin modules. In F. Parisi-Presicce, editor, WADT '97 12th Workshop on Algebraic Development Techniques -- Selected Papers, volume 1376 of Lecture Notes in Computer Science, pages 92--106, Berlin, 1997. Springer Verlag.
No context found.
D. Ancona and E. Zucca. An algebra of mixin modules. In F. Parisi-Presicce, editor, Proc. WADT '97 - 12th Workshop on Algebraic Development Techniques, Tarquinia, Italy. Selected Papers, Lecture Notes in Computer Science, Berlin, 1998. Springer Verlag. To appear.
....of module components (methods in the object oriented case) in order to formally model this feature it is indeed necessary to keep trace of the mutual dependency between definitions of components, formally to see a module as, roughly speaking, a function from models into models. We refer to [3, 6, 7, 8] for work of the authors devoted to the algebraic modeling of this idea and to the first author s Ph.D. thesis [4] for a comprehensive presentation. 1.4. Summary The paper is organized as follows. In Sect.2 we informally present object signatures and models as semantic counterpart of modules ....
....the same framework. Main.tex; 4 08 1998; 4:12; p.44 45 The most interesting topic for further work is the integration of the work presented in this paper with modeling features of object oriented languages like overriding and dynamic binding. Indeed an overall outcome of our work on module systems [3, 5, 6, 7, 4, 8] is that inheritance in object oriented languages is an overheaded operator, which subsumes in itself different mechanisms of module composition. In this paper (Sect.5) where the focus was on imperative features, we have shown that it is possible to model in our framework class based languages ....
Ancona, D. and E. Zucca: 1998a, `An Algebra of Mixin Modules'. In: F. Parisi-Presicce (ed.): WADT'97 (12th Workshop on Algebraic Development Techniques - Selected Papers), Vol. 1376 of Lecture Notes in Computer Science. Berlin, pp. 92--106.
No context found.
Davide Ancona and Elena Zucca. An algebra of mixin modules. In F. Parisi Presicce, editor, Recent Trends in Algebraic Development Techniques (12th Int'l Workshop, WADT '97 --- Selected Papers), number 1376 in LNCS, pages 92--106. Springer-Verlag, 1998.
No context found.
D. Ancona and E. Zucca. An algebra of mixin modules. In Proc. Recent Trends in Algebraic Development Techniques, 12th Int. Workshop, WADT'97, number 1376 in LNCS, pages 92--
No context found.
D. Ancona and E. Zucca. An algebra of mixin modules. In WADT'97, LNCS 1376. Springer-Verlag, January 1998.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC