J. Courant. An applicative module calculus. In M. Bidoit and M. Dauchet, editors, Proc. TAPSOFT '97: Theory and Practice of Software Development, number 1217 in Lecture Notes in Computer Science, pages 622--636. Springer Verlag, April 1997.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....their practical success, Leroy s proposals do have some theoretical weaknesses. The syntactic restrictions on paths, which are not closed under substitution of module terms for module identifiers, means that it is di#cult to give a substitution based dynamic semantics for his calculi. Courant [14] studies the failure of subject reduction for Leroy s module terms and proposes a variant calculus that admits a simple definition of module reduction. Courant s modifications allow him to state and prove a subject reduction theorem. His proposal, however, introduces a dependency of type checking ....

....greatly extend them. Unfortunately, the metatheoretic properties of the languages are less pleasing: we mention the absence of principal types for the calculi of Harper, Lillibridge and Leroy, and the need to blur the phase distinction of Leroy s calculus in order to prove subject reduction 59 [14]. The second approach, the one taken in this thesis, is to retain the use of semantic objects, but to palliate their deficiencies by placing them on a more type theoretic footing. This is particularly important because the current choice of semantic objects in Standard ML appears ad hoc and the ....

[Article contains additional citation context not shown here]

Judicael Courant. An applicative module calculus. In TAPSOFT'97,LNCS. Springer-Verlag, April 1997.

.... terminology introduced with Standard ML [36] This point of view of considering a module language as a small programming language of its own, which can be in principle instantiated over different core languages, has recently become very popular in the programming languages community (see, e.g. [33, 32, 19] and [34] for an effective demonstration) The fact that there are well defined composition operators at the level of single models is also important for the above mentioned integration with a specification level, since that often ensures that analogous operators at the level of specifications ....

Courant, J.: 1997, `An Applicative Module Calculus'. In: TAPSOFT '97: Theory and Practice of Software Development.

....as much sharing as in the MacQueen Tofte system. Leroy [20] proposed to use applicative semantics to model full transparency, but his signature calculus is not fully syntactic since it only handles limited forms of functor expressions; this limitation was lifted in Courant s recent proposal [7], but only at the expense of putting arbitrary module implementation code into the interfaces, which in turn compromises the very benefits of modularization and makes interface checking much harder. The main challenge is thus to design a module language that satisfies all of the following ....

J. Courant. An applicative module calculus. In M. Bidoit and M. Dauchet, editors, TAPSOFT'97: Theory and Practice of Software Development: LNCS Vol 1214, pages 622--636, New York, 1997. Springer-Verlag.

....Introduction Modularization has been considered since the early 70s an essential principle for managing the complex task of software development [29] Nowadays there exist many modular programming languages offering rather advanced features for modularization. Nevertheless, many recent papers [21,22,6,12,19,20,24,9,10] have shown that many of the modular mechanisms provided by them turn out to be inadequate in the light of the new software technology. Object oriented and distributed programming have promoted a stronger demand for more flexible modularization mechanisms able to face the problem of software ....

J. Courant. An applicative module calculus. In M. Bidoit and M. Dauchet, editors, Proc. TAPSOFT '97: Theory and Practice of Software Development, number 1217 in Lecture Notes in Computer Science, pages 622--636. Springer Verlag, April 1997.

....first order only. These problems were heavily researched [HL94, Ler94, Ler95, Lil97, Tof92, MT94, Jon96] and mostly resolved in SML 97 [MTHM97] The main remaining issue is with the design of higher order modules, with proposals ranging from fully transparent ones [MT94] to applicative functors [Ler95, Cou97], or abstract functors [HL94, Ler94, Lil97] Fully transparent modules are most expressive, but it is not clear whether they are absolutely necessary; they also interact poorly with true separate compilation [Ler94] This paper shows that at least from the implementation point of view, full ....

....original phase splitting algorithm [HMM90] to SML [MTHM97] since it does not support type abbreviations in signatures. As a result, the TIL compiler today is still using an intermediate language with dependent singleton kinds rather than the plain F calculus. functor arguments only; Courant [Cou97] s semantics does not have such restriction, but he did not give a translation of his calculus into the F calculus. Our static semantics for higher order modules is based on the the same stamp based approach used in the official definitions for SML 90 [MTH90, MT91] and SML 97 [MTHM97] The ....

Judicael Courant. An applicative module calculus. In Michel Bidoit and Max Dauchet, editors, TAPSOFT '97: Theory and Practice of Software Development: LNCS Vol 1214, pages 622--636, New York, 1997. Springer-Verlag.

....has been considered since the early 70s an essential principle for managing the complex task of software development [30] Nowadays there exist many programming languages supporting the notion of module and offering rather advanced features for modularization. Nevertheless, many recent papers [22,23,6,12,19,20,25,9,10] have shown that many of the modular mechanisms provided by them turn out to be inadequate in the light of the new software technology. Object oriented programming and distributed systems have promoted a stronger demand for more flexible modularization mechanisms able to face the problem of ....

J. Courant. An applicative module calculus. In M. Bidoit and M. Dauchet, editors, Proc. TAPSOFT '97: Theory and Practice of Software Development, number 1217 in Lecture Notes in Computer Science, pages 622--636. Springer Verlag, April 1997.

....signatures, but fails to propagate as much sharing as in the MacQueen Tofte system. Leroy [17] proposed to use applicative semantics to model full transparency, but his signature calculus only handles limited forms of functor arguments; this limitation was lifted in Courant s recent proposal [6], but only at the expense of putting arbitrary module implementation code into the interfaces, which in turn compromises the very benefits of modularization and makes interface checking much harder. The main challenge is thus to design a module language that satisfies all of the following ....

....signatures, but fails to propagate as much sharing as in the MacQueen Tofte system. Leroy [17] also proposed to use applicative semantics to model full transparency, but his signature calculus only handles limited forms of functor arguments; this limitation was lifted in Courant s recent proposal [6], but only at the expense of putting arbitrary module implementation code into the interfaces (which in turn compromises the very benefits of modularization and makes interface checking much harder) Parameterized signatures was first proposed by Jones [14] to capture the essence of various ....

J. Courant. An applicative module calculus. In M. Bidoit and M. Dauchet, editors, TAPSOFT'97: Theory and Practice of Software Development: LNCS Vol 1214, pages 622--636, New York, 1997. Springer-Verlag.

....depending on the translation from the programming language to the calculus. In the context of ML2000, our work may be understood as giving a better understanding of possible mechanisms in a semantic framework for objects in ML, similar to work in type theory to explain module systems for ML [23, 31, 34, 36, 43]. There is some evidence to believe that type reconstruction and objects will interact well together [33] but clearly the integration of objects into ML is a large project that will require considerable research. Our study does introduce some ideas that could be relevant to studying ....

J. Courant. An applicative module calculus. In Theory and Practice of Software Development 97, Lecture Notes in Computer Science. Springer--Verlag, Apr. 1997.

....supported, and modules are firstorder only. These problems were heavily researched [11, 19, 20, 23, 39, 25, 16] and mostly resolved in SML 97 [27] The main remaining issue is with the design of higher order modules, with proposals ranging from fully transparent ones [25] to applicative functors [20, 7], or abstract functors [11, 19, 23] Fully transparent modules are most expressive, but it is not clear whether they are absolutely necessary; they also interact poorly with true separate compilation [19] This paper shows that at least from the implementation point of view, full transparency is ....

....type constructors, instead, he has to encode certain type constructors of kind Omega using higher order types; this significantly complicates his semantics. Finally, Leroy [20] uses applicative functors to achieve full transparency, but his approach handles limited functor arguments only; Courant [7] s semantics does not have such restriction, but he did not give a translation of his calculus into the F calculus. Both Lillibridge [23] and Leroy [21] discussed how to add value identities to their module interfaces though neither of them gave any actual algorithm. Blume and Appel [5] proposed ....

J. Courant. An applicative module calculus. In M. Bidoit and M. Dauchet, editors, TAPSOFT'97: Theory and Practice of Software Development: LNCS Vol 1214, pages 622--636, New York, 1997. Springer-Verlag.

....like restrict . Anyway, the idea of defining a module system as a small language of its own constructed on top of the base language, on which as few as possible assumptions are made, is now becoming a standard approach, see, e.g. some recent work on type theoretic foundations of SML like modules [27, 32, 33, 28, 17, 18]. A paper which can be taken as representative of this point of view, summarized as a slogan in the title ( A modular module system ) is [33] whose aim is to give a constructive proof of the validity of the idea. To this end, it presents (the implementation by an SML functor of) a transformation ....

J. Courant. An applicative module calculus. In M. Bidoit and M. Dauchet, editors, Proc. TAPSOFT '97: Theory and Practice of Software Development, Lecture Notes in Computer Science, pages 622--636. Springer Verlag, April 1997.

....property. This property is critical for reasoning about a module system. Without it, there is little hope one can give a little step reduction semantics for modules. We rst tried to x this problem by giving an SML like module system for programming languages that enjoys this property [Cou97a] This system is not satisfying for programming languages as it blurs the phase distinction [HMM90] hence equality of code has to be tested by the proof checker. Of course, this test is undecidable in usual programming languages. On the contrary, its adaptation to proof systems seems really ....

Judicael Courant. An applicative module calculus. In Theory and Practice of Software Development 97, Lecture Notes in Computer Science, Lille, France, April 1997. Springer-Verlag.

No context found.

J. Courant. An applicative module calculus. In M. Bidoit and M. Dauchet, editors, Proc. TAPSOFT '97: Theory and Practice of Software Development, number 1217 in Lecture Notes in Computer Science, pages 622--636. Springer Verlag, April 1997.

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