X. Leroy, J. Vouillon, and D. Doligez. The Objective Caml system. Software and documentation available on the Web, http://caml.inria.fr/, 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....8. Extensions to the core language are presented in sections 9 and 10. In section 11, we compare our proposal with other work. 1. An overview of Objective ML Objective ML is a core langage. An extended language based on Objective ML has been implemented on top of the Caml Special Light system [19]. This implementation is called Objective Caml. In this article, we completely formalize the core language, i.e. Objective ML. We also use the name Objective Caml to refer to the implementation, especially when describing minor differences or extension to the core language that have not been fully ....

....been studied in [14] 10.3. Integrating classes and modules Objects and classes of Objective ML are orthogonal to the other extensions of ML. In particular, the module system of ML extends directly to classes and objects [18] Indeed, the implementation of Objective ML, called Objective Caml [19], offers a rich language of both modules and classes. Classes and modules share a lot of properties: they offer some form of abstraction; they also help structuring large applications; and they facilitate reusability of code. In fact, they are quite different. Modules are a very general and ....

Xavier Leroy. The Objective Caml system. Software and documentation available on the Web, http://pauillac.inria.fr/ ocaml/, 1996.

....For simplifying the type system in languages with imperative updates and polymorphism, there is a tendency to restrict polymorphism to bindings of nonside effecting terminating expressions. This tendency is known as the value restriction, which is enforced by both the Objective Caml system [10] and the Standard ML language [11] To simplify the presentation, we do not enforce the value restriction in rule 6. We return to this issue later, in Sect. 8. 5 Dynamic Semantics The dynamic semantics for the language is, as the static semantics, described by a set of inference rules. An ....

Xavier Leroy. The Objective Caml system. Software and documentation available on the Web, 1996.

....together with authentication. Finally, we discuss related work and give concluding remarks. Author s address: Projet Cristal, INRIA Rocquencourt, BP 105, 78153 Le Chesnay, France. E mail: Francois.Rouaix inria.fr 2 Facts about mmm mmm is a Web browser implemented in Caml Special Light[11], using libraries for Unix system calls[9] and for the Tcl Tk toolkit[13] The browser is able to display asynchronously several documents in several windows. mmm implements full HTML 2.0 [2] including forms and in lined images, and supports the applet system described in this paper. The CamlTk ....

Xavier Leroy and Damien Doligez. The Caml Special Light system. Software and documentation available on the Web, !URL:http://pauillac.inria.fr/csl/?, 1995.

....this extra argument, whose presence had no effect on pattern matching itself. The join language [8] is our first prototype. All examples in this paper are in join syntax. The system consists in a bytecode compiler and a bytecode interpreter. Both compiler and interpreter are Objective Caml [9] programs and it is easy to lift Objective Caml data types and functions into join abstract data types and primitives. For instance, join programs easily draw graphics, using the graphics Objective Caml library. As a consequence, join can be seen either as a language of its own, featuring many ....

X. Leroy, J. Vouillon, and D. Doligez. The Objective Caml system. Software and documentation available on the Web, http://pauillac.inria.fr/ocaml/, 1996.

No context found.

X. Leroy, J. Vouillon, and D. Doligez. The Objective Caml system. Software and documentation available on the Web, http://caml.inria.fr/, 1996.

....bear this notice and the full citation on the firstpage. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and or a fee. PPDP 03, August 27 29, 2003, Uppsala, Sweden. Copyright 2003 ACM 1 58113 705 2 03 0008 . 5.00. OCaml [12, 11] allows both # abstractions and limited forms of constructor applications. Several criteria come into play when determining the range of allowed right hand sides. First, languages have to give a status to ill founded definitions such as x = x 1. In a lazy language, this definition can be ....

X. Leroy, D. Doligez, J. Garrigue, and J. Vouillon. The Objective Caml system. Software and documentation available on the Web, http://caml.inria.fr/, 1996.

....or not . In section 4, we develop one such efficient implementation of weak symbolic reduction, as an abstract machine and its associated compilation scheme. The abstract machine is a minor extension of the ZAM abstract machine [16] that is at the heart of the Objective Caml bytecode interpreter [17], and reuses all the work that has been expended in making the latter efficient. Both the abstract machine and its compilation scheme have been proved correct with respect to the weak reduction semantics, and the proof was mechanically checked by Coq; section 5 reports on this proof development. ....

....is itself in normal form. 4 An Abstract Machine for Weak Symbolic Reduction We now turn to implementing weak symbolic reduction by compilation to a suitable abstract machine. This abstract machine is a slight extension of the ZAM, which underlies the bytecode interpreter of Objective Caml [16, 17], In the terminology of [20] the ZAM is an environment and closure based abstract machine following the push enter model, and implementing a call by value evaluation strategy. The purpose of this section is to demonstrate that minor modifications of an existing abstract machine for weak ....

X. Leroy, D. Doligez, J. Garrigue, and J. Vouillon. The Objective Caml system. Software and documentation available on the Web, http://caml.inria.fr/, 1996.

No context found.

Xavier Leroy, J'erome Vouillon, Damien Doligez, et al. The Objective Caml system. Software and documentation available on the Web, http://pauillac.inria.fr/ocaml/, 1996.

....specialized to the subtyping problems that arise in the XML domain. This section describes some of these techniques. The techniques are categorized into lowlevel, representational techniques and higher level heuristics inspired by set theoretic observations. Our implementation is written in O Caml [17]. 5.1 Low level Optimizations In order to make subtyping faster, it is crucial to minimize the number of internal types translated from the external types. Observing that semantically equal external types can be translated to the same internal type, we exploit the properties of alternation and ....

X. Leroy, J. Vouillon, D. Doligez, et al. The Objective Caml system. Software and documentation available on the Web, http://pauillac.inria.fr/ocaml/, 1996.

....prove correct the security techniques used in MMM. This section presents the main techniques used in the MMM safe execution environment for applets, and relates them with the formal results we have obtained in this paper. 7. 1 Type safe dynamic linking The MMM browser is written in Objective Caml [24] and compiled to bytecode by the Caml bytecode compiler. The bytecode is then executed by the Caml virtual machine. Applets are also compiled to Caml bytecode, then loaded in memory and linked with the browser by the Caml dynamic linker (the Dynlink library) The dynamic linker can be configured ....

X. Leroy, J. Vouillon, D. Doligez, et al. The Objective Caml system. Software and documentation available on the Web, http://caml.inria.fr/ocaml/, 1996.

....correct the security techniques used in MMM. This section 21 presents the main techniques used in the MMM safe execution environment for applets, and relates them with the formal results we have obtained in this paper. 7. 1 Type safe dynamic linking The MMM browser is written in Objective Caml [24] and compiled to bytecode by the Caml bytecode compiler. The bytecode is then executed by the Caml virtual machine. Applets are also compiled to Caml bytecode, then loaded in memory and linked with the browser by the Caml dynamic linker (the Dynlink library) The dynamic linker can be con gured ....

X. Leroy, J. Vouillon, D. Doligez, et al. The Objective Caml system. Software and documentation available on the Web, http://caml.inria.fr/ocaml/, 1996.

.... may help in understanding all the issues involved [1, 22] For these two purposes, the implementation presented in this paper has been simplified as much as possible, but no more (to quote Einstein out of context) The implementation presented in this paper is written in Caml Special Light [14], an extension of the Caml dialect of ML [27] with a module system extremely close to the one that is described here. The code itself exemplifies the module language that it implements, RR n2866 4 Xavier Leroy in particular, the systematic use of functors in the established tradition of ....

Xavier Leroy. The Caml Special Light system. Software and documentation available on the Web, http://pauillac.inria.fr/csl/, 1995.

....or presence variable v not used as a fresh variable by algorithm W . The algorithm W is shown in appendix B. 4 Extension to the full Objective Caml language In this section, we discuss the main issues in extending the analysis presented in section 3 to deal with the whole Objective Caml language [14]. 4.1 Datatypes User de ned datatypes (sum types) can be approximated in several dioeerent ways, depending on the desired trade ooe between precision and speed of the analysis. We have considered the four approaches listed below (from most precise to least precise) 4.1.1 Full approximation of ....

Xavier Leroy, J#r#me Vouillon, Damien Doligez, et al. The Objective Caml system. Software and documentation available on the Web, http://caml.inria.fr/ocaml/, 1996.

....is marked as raw data for the garbage collector) but a block containing a float string holds two pointers, the float being allocated separately. Both SML NJ and Objective Caml go even further and flatten only records of floating point numbers, keeping everything else boxed inside heap blocks [15, 5]. The second direction is to allow mixed heap blocks, but group all pointers at the beginning of the block. The garbage collector is then instructed to follow the first N fields as pointers, with N possibly null or smaller than the actual size of the block. This greatly complicates access to ....

....copying collector. Gallium 2, briefly described in [19] also uses coercion based unboxing, but adds a better, more portable code generator, a two generation copying collector, as well as tag based unboxing of floats in arrays (as described in section 2) The Objective Caml native code compiler [5, 7] abandons coercion based unboxing and uses conventional, mostly tagged data representations in combination with local unboxing of floats (as described in section 4.1) multiple entry points to uncurried and curried functions (section 4.2) and tag based handling of unboxed float arrays (section ....

X. Leroy, J. Vouillon, and D. Doligez. The Objective Caml system. Software and documentation available on the Web, http:// pauillac.inria.fr/ocaml/, 1996.

....creation, scheduling, termination, no communication primitives, no shared memory, no notion of being executing a program onto a parallel architecture at all. All these details relative to parallel execution are actually dealt with by the skeleton compiler and or run time system. Objective Caml [13] (abbreviated ocaml in the sequel) is a functional language from the ML family [15] It supports functions as first class values: not only code pointers, but full mathematical functions, which may contain free variables. It is not a purely functional language, in that it is also equipped with full ....

Xavier Leroy, Jerome Vouillon, and Damien Doligez. The Objective Caml system. Software and documentation available on the Web, http://pauillac.inria.fr/ocaml/, 1996.

....presence variable v not used as a fresh variable by algorithm W . The algorithm W is shown in appendix B. 4 Extension to the full Objective Caml language In this section, we discuss the main issues in extending the analysis presented in section 3 to deal with the whole Objective Caml language [15]. 4.1 Datatypes User defined datatypes (sum types) can be approximated in several different ways, depending on the desired trade off between precision and speed of the analysis. We have considered the four approaches listed below (from most precise to least precise) 4.1.1 Full approximation of ....

X. Leroy, J. Vouillon, D. Doligez, et al. The Objective Caml system. Software and documentation available on the Web, http://caml.inria.fr/ocaml/, 1996.

No context found.

X. Leroy, J. Vouillon, D. Doligez, et al. The Objective Caml system. Software and documentation available on the web, http://caml.inria.fr/, 1996.

No context found.

Xavier Leroy, Damien Doligez, Jacques Garrigue, and Jrme Vouillon. The Objective Caml system. Software and documentation available on the Web, http://caml.inria.fr/, 1996.

No context found.

Xavier Leroy, Jer^ome Vouillon, Damien Doligez, et al. The Objective Caml system. Software and documentation available on the Web, http:// pauillac.inria.fr/ocaml/, 1996.

No context found.

Xavier Leroy, J'erome Vouillon, Damien Doligez, et al. The Objective Caml system. Software and documentation available on the Web, http://pauillac.inria.fr/ocaml/, 1996. 23

No context found.

Xavier Leroy, Jer^ome Vouillon, Damien Doligez, et al. The Objective Caml system. Software and documentation available on the Web, http://pauillac.inria.fr/ocaml/, 1996.

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