10 citations found. Retrieving documents...
D. Remy and J. Vouillon. Objective ML: An effective object-oriented extension to ML. Theory And Practice of Object Systems, 4(1):27--50, 1998. A preliminary version appeared in the proceedings of the 24 ACM Conference on Principles of Programming Languages, 1997.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Type Inference for First-Class Messages with Feature Constraints - Müller, al.   (Correct)

....fields is difficult for an analogous reason: both message or record field identifiers may be bound to varying values depending on the execution. Neither first class messages nor first class record fields are not supported in statically typed languages such as Standard ML [20] Objective Caml [35], or Haskell [30] There is a type system for extensible records with first class record fields by Gaster [14] but it is restrictive in not allowing a single record field type to mention varying record fields. Recently, the second author has proposed an extension to the ML type system that can ....

....of OF constraints. Remark. In general, type inference requires that constraints representing a type must be compactly presented in order to make them easily digestible by programmers. The use of a term notation is crucial here, even though it is not during type inference. But, as the OCaml [35] experience shows, terms do not suffice. In OCaml an additional abbreviation mechanism for object types is provided which usually grow rather large. Corresponding mechanisms seem to be in place when putting our system into practice. As a first example, the statement let o1 = fsucc(x) x 1, ....

[Article contains additional citation context not shown here]

D. Remy and J. Vouillon. Objective ML: An effective object-oriented extension to ML. Theory And Practice of Object Systems, 4(1):27--50, 1998. A preliminary version appeared in the proceedings of the 24 ACM Conference on Principles of Programming Languages, 1997.


Modular Typechecking for Hierarchically Extensible.. - Millstein, Bleckner.. (2002)   (2 citations)  (Correct)

....to existing classes requires access to the source code for those classes (since methods cannot be added to existing classes without modifying them in place) There have been several recent research efforts to integrate the benefits of the functional and OO styles in the context of ML. OCaml [24] adds OO features including class and method definitions to ML. The OO constructs essentially form their own sub language which is largely separate from the existing ML datatype and fun constructs. Adding a set of new constructs has the advantage that existing language constructs are minimally ....

....any) concatenated with the type in the of clause in C s declaration. For example, the representation type of CListSet is list,count:int , since ListSet s representation type is list . Each class declaration also implicitly declares a constructor, similar to constructor declarations in OCaml [24] and XMOC [12] a core language for Moby [11] For example, the CListSet constructor expects arguments es of type int list and c of type int, initializes inherited instance variables via the call ListSet(es) to the superclass constructor, and initializes the new count instance variable to c. In ....

D. Remy and J. Vouillon. Objective ML: An effective object-oriented extension of ML. Theory and Practice of Object Systems, 4(1):27--52, 1998.


A Calculus for Compiling and Linking Classes - Fisher, Reppy, Riecke (2000)   (18 citations)  (Correct)

....(i.e. languages where subclass compilation requires the superclass representation, as is the case in C [Str97] and JAVA [AG98] representing code fragments and linkage information is straightforward. But for languages that allow classes as module parameters, such as MOBY [FR99a] and OCAML [RV98,Ler98] or languages that have classes as first class values, such as LOOM [BFP97] the design of an IR becomes trickier (Section 2 illustrates the complications) We are interested in a compiler IR that can handle inheritance from non manifest base classes. In addition, the IR should satisfy a ....

Remy, D. and J. Vouillon. Objective ML: An effective object-oriented extension to ML. TAPOS, 4, 1998, pp. 27--50.


Foundations for MOBY Classes - Fisher, Reppy (1998)   (Correct)

.... Drossopoulou and Eisenbach have developed a semantics for a significant fragment of JAVA and used this to prove type safety [DE97] A more modest example of language formalization is the work of Remy and Vouillon, who have formalized a small language that models many of the features of O CAML [RV98]. Our work is most similar to Remy and Vouillon s in its scope (their language is roughly equivalent to MICROMOBY in size) but is more closely related to Harper and Stone s in its technical style, since we both use a two level approach (i.e. EL to IL translation) Harper and Stone formalize the ....

Remy, D. and J. Vouillon. Objective ML: An effective object-oriented extension to ML. Theory and Practice of Object Systems, 4(1), 1998, pp. 27--50.


A Calculus for Compiling and Linking Classes - Fisher, Reppy, Riecke (2000)   (18 citations)  (Correct)

....can express a wide range of class based object oriented language features, such as class construction and various forms of method dispatch. Second, it allows the compiler to specify class linking directly in ink . In particular, the calculus can model the class systems of MOBY [FR99a] OCAML [RV98,Ler98] and LOOM [BFP97] where subclasses may be derived from unknown base classes, or just in time linking schemes like that of JAVA [AG98] where an application loads and links classes dynamically. 1 Introduction Class based object oriented languages provide mechanisms for factoring ....

....(i.e. languages where subclass compilation requires the superclass representation, as is the case in C [Str97] and JAVA [AG98] representing code fragments and linkage information is straightforward. But for languages that allow classes as module parameters, such as MOBY [FR99a] and OCAML [RV98,Ler98] or languages that have classes as first class values, such as LOOM [BFP97] the design of an IR becomes less clear. This paper introduces an untyped IR for these languages, called ink , describes how to translate languages into the IR, presents theorems about linking, and discusses ....

Remy, D. and J. Vouillon. Objective ML: An effective object-oriented extension to ML. TAPOS, 4, 1998, pp. 27--50.


A Calculus for Compiling and Linking Classes - Fisher, Reppy, Riecke (1999)   (18 citations)  (Correct)

....forms of method dispatch. Second, it allows the compiler to specify class linking directly in ink . An important property of ink is that it can handle class systems where subclasses may be derived from unknown base classes, a situation which arises in languages like MOBY [FR99a] and OCAML [RV98, Ler98] that provide both classes and parameterized modules. While the design of ink was motivated by the needs of compiling, linking, and optimizing MOBY classes [FR99a] it is applicable to the implementation of other class mechanisms, such as those of JAVA [AG98] OCAML [RV98, Ler98] and ....

....and OCAML [RV98, Ler98] that provide both classes and parameterized modules. While the design of ink was motivated by the needs of compiling, linking, and optimizing MOBY classes [FR99a] it is applicable to the implementation of other class mechanisms, such as those of JAVA [AG98] OCAML [RV98, Ler98] and LOOM [BFP97] Furthermore, because we have the flexibility to handle unknown base classes, our calculus can express just in time linking schemes, where an application loads and links classes dynamically. 1 Introduction Class based object oriented languages provide mechanisms for ....

[Article contains additional citation context not shown here]

Remy, D. and J. Vouillon. Objective ML: An effective object-oriented extension to ML. TAPOS, 4, 1998, pp. 27--50.


Type Inference for Recursive Definitions - Kfoury, Pericas-Geertsen (1999)   (1 citation)  (Correct)

No context found.

D. Remy and J. Vouillon. Objective ml: An effective objectoriented extension to ml. Theory and Practice of Object


Type Inference for Recursive Definitions - Kfoury, Pericas-Geertsen (2000)   (1 citation)  (Correct)

No context found.

D. Remy and J. Vouillon. Objective ml: An effective object-oriented extension to ml. Theory and Practice of Object


Depth Subtyping and Type Inference for Object Calculi - Bugliesi, Pericas-Geertsen (2000)   (3 citations)  (Correct)

No context found.

D. Remy and J. Vouillon. Objective ml: An effective object-oriented extension to ml. Theory and Practice of Object Systems, 1998.


Type Inference for Recursive Definitions - Kfoury, Pericás-Geertsen (2000)   (1 citation)  (Correct)

No context found.

D. Remy and J. Vouillon. Objective ml: An effective object-oriented extension to ml. Theory and Practice of Object

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