|
491
|
The Definition of Standard ML (Revised
– Milner, Tofte, et al.
- 1997
|
|
336
|
Explicit substitutions
– Abadi, Cardelli, et al.
- 1990
|
|
332
|
W.: Mixin-Based Inheritance
– Bracha, Cook
- 1990
|
|
259
|
A type-theoretic approach to higher-order modules with sharing
– Harper, Lillibridge
|
|
205
|
Manifest types, modules, and separate compilation
– Leroy
|
|
152
|
Units: Cool modules for HOT languages
– Flatt, Felleisen
|
|
131
|
The Programming Language Jigsaw: Mixins, Modularity and Multiple Inheritance
– Bracha
- 1992
|
|
129
|
Program fragments, linking, and modularization
– CARDELLI
- 1997
|
|
117
|
The categorical abstract machine
– Cousineau, Curien, et al.
- 1985
|
|
91
|
A calculus of module systems
– ANCONA, ZUCCA
- 2002
|
|
88
|
Modularity meets inheritance
– Bracha, Lindstrom
- 1992
|
|
62
|
A record calculus based on symmetric concatenation
– Harper, Pierce
- 1991
|
|
45
|
Mixin modules in a call-by-value setting
– HIRSCHOWITZ, X
|
|
41
|
Types for Modules
– Russo
- 1998
|
|
30
|
A Versatile Constraint-Based Type Inference System. Nordic
– Pottier
- 2000
|
|
26
|
The recursive record semantics of objects revisited
– Boudol
|
|
24
|
Modeling sharing and recursion for weak reduction strategies using explicit substitution
– Benaissa, Lescanne, et al.
- 1996
|
|
24
|
Explicit cyclic substitutions
– Rose
- 1992
|
|
20
|
Programming Languages for Reusable Software Components
– Flatt
- 1999
|
|
12
|
and Constantinos Sourelis. Mixin modules
– Duggan
- 1996
|
|
11
|
A reduction semantics for call-by-value mixin modules. Research report RR-4682, Inria
– Hirschowitz, Leroy, et al.
- 2003
|
|
3
|
Recursion in the call-by-value lambda-calculus
– Boudol, Zimmer
- 2002
|
|
2
|
The OCaml 3.06 reference manual, 2002. Available at http://caml.inria.fr
– Leroy, Doligez, et al.
|
|
1
|
Skew conuence and the lambda calculus with letrec. Annals of pure and applied logic
– Ariola, Blom
- 2002
|
|
1
|
The Objective Caml system. Logiciel et documentation disponibles sur le Web
– Leroy, Doligez, et al.
- 1996
|
|
1
|
Equational reasoning for linking with rst-class primitive modules. In Programming Languages and Systems, 9th European Symp. Programming, volume 1782 of LNCS, pages 412428
– Wells, Vestergaard
- 2000
|
