Leroy, X. 2000. A modular module system. Journal of Functional Programming 10, 3. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents
A Formal Specification of the Haskell 98 Module System - Iavor Diatchki Mark (2002) (Correct)
....handling. We omit the implementation of these practical details from this presentation. 10 8 Related work We are aware of at least two attempts to formalize the static semantics of Haskell, but neither of them fully specifies the module system. In the static semantics by Peyton Jones and Wadler [6], the specification of imports was left as future work. The authors rated it as one of the highest priority items on their todo list. More recently, Faxen also worked on the static semantics of Haskell [3] In this work, he gave semantics to some parts of the module system, but also deviated from ....
X. Leroy. A modular module system. Journal of Functional Programming, 10(3):269--303, 2000.
A Type System for Higher-Order Modules - Dreyer, Crary, Harper (2001) (12 citations) (Correct)
....USA. Copyright 2003 ACM 1 58113 628 5 03 0001 . 5.00 the desire to separate program components into relatively independent parts and the need to integrate these parts to form a coherent whole. To some extent the design of modularity mechanisms is independent of the underlying language [17], but to a large extent the two are inseparable. For example, languages with polymorphism, generics, or type abstraction require far more complex module mechanisms than those without them. Much work has been devoted to the design of modular programming languages. Early work on CLU [19] and the ....
Xavier Leroy. A modular module system. Journal of Functional Programming, 10(3):269--303, 2000.
A Type System for Higher-Order Modules (Expanded Version) - Dreyer, Crary, Harper (2002) (Correct)
....delicate and complex. There is a fundamental tension between the desire to separate program components into relatively independent parts and the need to integrate these parts to form a coherent whole. To some extent the design of modularity mechanisms is independent of the underlying language [15], but to a large extent the two are inseparable. For example, languages with polymorphism, generics, or type abstraction require far more complex module mechanisms than those that do not. Much work has been devoted to the design of modular programming languages. Early work on CLU [17] and the ....
Xavier Leroy. A modular module system. Journal of Functional Programming, 10(3):269--303, 2000.
A Type System for Higher-Order Modules - Dreyer, Crary, Harper (2001) (12 citations) (Correct)
....delicate and complex. There is a fundamental tension between the desire to separate program components into relatively independent parts and the need to integrate these parts to form a coherent whole. To some extent the design of modularity mechanisms is independent of the underlying language [16], but to a large extent the two are inseparable. For example, languages with polymorphism, generics, or type abstraction require far more complex module mechanisms than those without them. Much work has been devoted to the design of modular programming languages. Early work on CLU [18] and the ....
Xavier Leroy. A modular module system. Journal of Functional Programming, 10(3):269--303, 2000.
A Type System for Higher-Order Modules - Dreyer, Crary, Harper (2003) (12 citations) (Correct)
....USA. Copyright 2003 ACM 1 58113 628 5 03 0001 . 5.00 the desire to separate program components into relatively independent parts and the need to integrate these parts to form a coherent whole. To some extent the design of modularity mechanisms is independent of the underlying language [17], but to a large extent the two are inseparable. For example, languages with polymorphism, generics, or type abstraction require far more complex module mechanisms than those without them. Much work has been devoted to the design of modular programming languages. Early work on CLU [19] and the ....
Xavier Leroy. A modular module system. Journal of Functional Programming, 10(3):269--303, 2000.
Compiling R: A Preliminary Report - Tierney (2001) (Correct)
....To avoid this form of name clash among global variables it would be useful to develop some form of name space management system for R. Most languages now include some form of name space mechanism. Java, Perl and Tcl [27] have fairly simple systems. The ML language family has a very rich mechanism [14]. The Scheme48 [21] and MzScheme [9, 10, 8] module systems (MzScheme calls them units) are somewhere in between. These should provide a basis for designing a name space mechanism for R. Providing mechanisms for sealing environments and name space management will make it easier to compile R code ....
Xavier Leroy. A modular module system. Journal of Functional Programming, 10(3), 2000.
Sound and Complete Elimination of Singleton Kinds - Crary (2000) (Correct)
....in Section 2.1. Translucent sums are employed in the type theoretic definition of Standard ML given by Harper and Stone [9] currently the only formal account of an entire practical programming language in type theory) and manifest types are similarly employed (somewhat less formally) by Leroy [12] for Objective CAML. In this paper I consider a type theory based on singleton kinds [21] a variant of the translucent sum manifest type formalism. The singleton kind calculus differs from the standard accounts in that it separates the module system from the mechanisms for type abbreviations and ....
Xavier Leroy. A modular module system. Journal of Functional Programming, 2000. To appear.
Sound and Complete Elimination of Singleton Kinds - Crary (2005) (Correct)
No context found.
Leroy, X. 2000. A modular module system. Journal of Functional Programming 10, 3.
A Type System for Higher-Order Modules - Dreyer, Crary, Harper (2001) (12 citations) (Correct)
No context found.
Xavier Leroy. A modular module system. Journal of Functional Programming, 10(3):269--303, 2000.
A Calculus for Dynamic Linking - Ancona, Fagorzi, Zucca (2003) (4 citations) (Correct)
No context found.
X. Leroy. A modular module system. Journal of Functional Programming, 10(3):269--303, May 2000.
Computation in Space and Space in Computation - Giavitto, Michel, Cohen, Spicher (2004) (Correct)
No context found.
X. Leroy. A modular module system. Journal of Functional Programming, 10(3):269--303, 2000.
Modular Formal Frameworks for Module Systems - Ancona (1998) (5 citations) (Correct)
No context found.
X. Leroy. A modular module system. Technical Report 2866, INRIA, April 1996.
Sound and Complete Inter-Checking - The very essence of.. - Ancona, Zucca (Correct)
No context found.
X. Leroy. A modular module system. Journal of Functional Programming, 10(3):269--303, May 2000.
Using, Understanding, and Unraveling - The OCaml Language - From.. - Remy (Correct)
No context found.
Xavier Leroy. A modular module system. Journal of Functional Programming, 10(3):269-303, 2000.
A Calculus with Lazy Module Operators - Ancona, Fagorzi, Zucca (2 citations) (Correct)
No context found.
X. Leroy. A modular module system. Journal of Functional Programming, 10(3):269-- 303, May 2000.
Reuse of SML module system for the B language - Petit, Poirriez, Mariano (2003) (Correct)
No context found.
LEROY, X. A modular module system. Journal of Functional Programming 10, 3 (2000), 269--303.
Computation in Space and Space in Computation - Giavitto, Michel, Cohen, Spicher (2004) (Correct)
No context found.
X. Leroy. A modular module system. Journal of Functional Programming, 10(3):269--303, 2000.
Approximating Module Semantics with Constraints - Logozzo (2004) (Correct)
No context found.
X. Leroy. A modular module system. Journal of Functional Programming, 10(3):269--303, 2000.
A Calculus with Lazy Module Operators - Ancona, Fagorzi, Zucca (2 citations) (Correct)
No context found.
X. Leroy. A modular module system. Journal of Functional Programming, 10(3):269--303, May 2000.
A Calculus for Dynamic Linking - Ancona, Fagorzi, Zucca (2003) (4 citations) (Correct)
No context found.
X. Leroy. A modular module system. Journal of Functional Programming, 10(3):269--303, May 2000.
Functors for Proofs and Programs - Filliatre, Letouzey (2003) (Correct)
No context found.
Xavier Leroy. A modular module system. Journal of Functional Programming, 10(3):269303, 2000.
Program Fragments, Linking, and Modularization - Cardelli (1997) (Correct)
No context found.
Leroy, X., A modular module system. Research report 2866, INRIA. April 1996.
A Calculus for Link-time Compilation - Machkasova, Turbak (2000) (23 citations) (Correct)
No context found.
X. Leroy. A modular module system. Tech. Rep. 2866, INRIA, Apr. 1996.
A Computationally Sound Call-by-Value Module Calculus - Machkasova, Turbak (2001) (Correct)
No context found.
X. Leroy. A modular module system. Tech. Rep. 2866, INRIA, Apr. 1996.
Sound and Complete Elimination of Singleton Kinds - Crary (2000) (Correct)
No context found.
Xavier Leroy. A modular module system. Journal of Functional Programming, 2000. To appear.
First 50 documents
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