4 citations found. Retrieving documents...
LEROY, X. Applicative functions and fully transparent higher-order modules. In Proc. ACM Symposium on Principles of Programming Languages (1995.

 Home/Search   Document Not in Database   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Units: Cool Modules for HOT Languages - Flatt, Felleisen (1998)   (79 citations)  (Correct)

.... and te and te ti tdez tdiUtde2 tail F I compound import ti: ni xi: i export t: e xe: e link e I with twl : wl Xwl :Twl provides tpl : tpl Xpl :Tpl and c2 with tw2: w2 Xw2:Tw2 provides tp2: p2 Xp2:Tp2 : sig[i, e, di, de, be] Figure 19: Type checking for UNIT, Consider the example in Figure 21. The Environment unit is linked with the Letrec unit, allowing the latter to exploit the implementation of environments as procedures. In contrast, other clients shotfid not be allowed to exploit the implementation of environments. Hence, the type of environments shotfid be opaque outside the ....

....exploit the implementation of environments as procedures. In contrast, other clients shotfid not be allowed to exploit the implementation of environments. Hence, the type of environments shotfid be opaque outside the compound unit RecEnv, which combines Environment and Letrec. As shown in Figure 21, information about RecEnv s exports can be restricted via exphcit signatures and an extended subtype relation. The extended relation allows a subtype signature to contain an extra exported type variable (e.g. env in place of an abbreviation in the supertype 246 fun extend env n v . env ....

[Article contains additional citation context not shown here]

LEROY, X. Applicative functions and fully transparent higher-order modules. In Proc. ACM Symposium on Principles of Programming Languages (1995.


Programming Languages for Reusable Software Components - Flatt (1999)   (10 citations)  (Correct)

....3.1, our unit model incorporates ideas from distinct language communities, particularly those using packages and ML style modules. The Scheme and ML communities have produced a large body of work exploring variations on the standard module system, especially variations for higher order modules [6, 15, 33, 39, 50, 53, 54, 57, 82]. Duggan and Sourelis [18] have investigated mixin modules for specifying recursive and extensible definitions across modules; their approach is 65 different from ours in its emphasis on extensible datatypes. Crary, Harper, and Puri [14] model an extension of ML functors that allows mutually ....

Leroy, X. Applicative functions and fully transparent higher-order modules. In Proc. ACM Symposium on Principles of Programming Languages, pages 142--153, Janurary 1995.


Programming Languages for Reusable Software Components - Flatt (1999)   (10 citations)  (Correct)

....3.1, our unit model incorporates ideas from distinct language communities, particularly those using packages and ML style modules. The Scheme and ML communities have produced a large body of work exploring variations on the standard module system, especially variations for higher order modules [6, 15, 33, 39, 50, 53, 54, 57, 82]. Duggan and Sourelis [18] have investigated mixin modules for specifying recursive and extensible definitions across modules; their approach is 65 different from ours in its emphasis on extensible datatypes. Crary, Harper, and Puri [14] model an extension of ML functors that allows mutually ....

Leroy, X. Applicative functions and fully transparent higher-order modules. In Proc. ACM Symposium on Principles of Programming Languages, pages 142--153, Janurary 1995.


Units: Cool Modules for HOT Languages - Flatt, Felleisen (1998)   (79 citations)  (Correct)

....2, our unit model incorporates ideas from distinct language communities, particularly those using packages and ML style modules. The Scheme and ML communities have produced a large body of work exploring variations on the standard module system, especially variations for higher order modules [2, 4, 12, 16, 18, 20, 21, 23, 29]. Duggan and Sourelis [5] have investigated mixin modules for specifying recursive and extensible definitions across modules; their work and ours have no overlap. Cardelli [3] anticipated the unit language s emphasis on module linking as well as module definition. Our unit model is more concrete ....

Leroy, X. Applicative functions and fully transparent higher-order modules. In Proc. ACM Symposium on Principles of Programming Languages (1995), pp. 142-- 153.

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