Xavier Leroy. Objective Caml, 2000. Available from http://caml.inria.fr/ocaml/. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Dependency-style Generic Haskell - Loh, Clarke, Jeuring (2003) (6 citations) (Correct)
....Peyton Jones explore an extension, following Hinze s earlier ideas [15] which integrated generics with Haskell s type class system [20] This system su#ers from some limitations due to the interaction with the type class system. G Caml [9, 10] presents a generic programming extension for O Caml [26]. The proposal does not aim to cover all datatypes, and as such can be seen as a way of achieving Haskell style overloading in O Caml. The generic extension for Clean is also based on Hinze s work [1] This proposal is more closely integrated with the type class system, but does not include any of ....
Xavier Leroy et al. The Objective Caml system release 3.02, Documentation and user's manual, December 2001. Available from http://caml.inria.fr/ocaml/htmlman/.
Automating Type Soundness Proofs via Decision Procedures and.. - Syme, Gordon (Correct)
....The purpose of the Spark veri er is to rule out any method whose execution could lead to an untrapped error. 2. 2 The Speci cation of Spark We describe execution and veri cation of Spark programs by programming transition functions over data structures in a version of the Caml dialect of ML [7]. Our descriptions of Spark avoid all the imperative features of ML and use no recursion. Hence, we can directly interpret our ML data structures and procedures as mathematical sets and total functions, respectively. We have built a tool that imports our ML de nitions into the DECLARE theorem ....
Xavier Leroy. The Objective Caml system, documentation and user's guide. INRIA, Rocquencourt, 1999. Available from http://caml.inria.fr.
No-Longer-Foreign: Teaching an ML compiler to speak C "natively" - Blume (2001) (9 citations) (Correct)
....writes a specification of the interface and uses a special In some cases it might be possible to use SML NJ s CleanUp facility to save and restore certain C data structures. compiler to generate glue code on both the C and the high level language side. Examples include H Direct [6] and Camlidl [11]. Our approach also falls in here: the IDL is C, and C side stub generation is trivial. Much closer in spirit as well as implementation is the work on data level interoperability for Moby [7] Moby takes a less ambitious approach to modelling the full C type system. In particular, an older ....
Xavier Leroy. CamlIDL user's manual. available from http://caml.inria.fr/camlidl/, March 1999.
Automating Type Soundness Proofs via Decision Procedures and.. - Syme, Gordon (Correct)
....our techniques to substantially automate type soundness proofs. A larger case study is discussed in x4.2. Our example is motivated by the instruction set of the CLR [8] and is called Spark. We describe execution and veri cation of Spark programs by programming functions in the Caml dialect of ML [7]. Our code avoids all the imperative features of ML and use no recursion. Hence, we can directly interpret our ML data structures and procedures as mathematical sets and total functions, respectively. We import our code into the DECLARE theorem prover [15] interpreting the ML de nitions as ....
Xavier Leroy. The Objective Caml system, documentation and user's guide. INRIA, Rocquencourt, 1999. Available from http://caml.inria.fr.
Local CPS conversion - Reppy (2001) (Correct)
....uses CPS as a representation. Tarditi s thesis [Tar96] is probably the most detailed description of a DS based optimizer for strict functional languages, but he does not collapse nested loops. We are not aware of any direct style compiler that implements the LCPS transformation (the OCAML [Ler00] TIL [TMC 96, Tar96] and RML [OT98] compilers do not) Kelsey describes a technique for combining functions in a CPS based framework [Kel95] In his framework, he annotates abstractions with either proc, cont, or jump, where jump is used to mark control transfers that occur within the ....
Leroy, X. The Objective Caml System (release 3.00), April 2000. Available from http://caml.inria.fr.
A Framework for Interoperability - Fisher, Pucella, al. (2001) (Correct)
....implementations provide some mechanism for connecting with C code. Often, this mechanism requires hand written stub functions to translate between the high level and C representations. Examples of languages with such mechanisms include JAVA (the JAVA Native Interface) Lia99] SML NJ, and OCAML [Ler00]. Our framework also supports hand written stubs. Such stubs and free to manage the temporary storage needed for the results of the gettimeofday call. 12 The slight performance advantage that MOBY has in this benchmark is most likely a result of a slightly more efficient argument passing ....
Leroy, X. The Objective Caml System (release 3.00), April 2000. Available from http://caml.inria.fr.
Implementing Multi-stage Languages Using ASTs, Gensym.. - Calcagno, Taha, Huang, .. Self-citation (Leroy) (Correct)
No context found.
Leroy, X. Objective Caml, 2000. Available from http://caml.inria.fr/ocaml/.
Implementing Multi-stage Languages Using ASTs, Gensym.. - Calcagno, Taha, Huang, .. Self-citation (Leroy) (Correct)
No context found.
Leroy, X. Objective Caml, 2000. Available from http://caml.inria.fr/ocaml/.
Implementing Multi-stage Languages Using ASTs, Gensym.. - Calcagno, Taha, Huang, .. Self-citation (Leroy) (Correct)
No context found.
Leroy, X. Objective Caml, 2000. Available from http://caml.inria.fr/ocaml/.
A Methodology for Generating Verified Combinatorial Circuits - Kiselyov, Swadi, Taha (2004) (1 citation) (Correct)
No context found.
Xavier Leroy. Objective Caml, 2000. Available from http://caml.inria.fr/ocaml/.
Staging Dynamic Programming Algorithms - Kedar Swadi Kswadi (2005) (Correct)
No context found.
Xavier Leroy. Objective Caml, 2000. Available from http://caml.inria.fr/ocaml/.
Relating FFTW and Split-Radix - Kiselyov, Taha (2004) (Correct)
No context found.
Xavier Leroy. Objective Caml, 2000. Available from http://caml.inria.fr/ocaml/.
Dependency-style Generic Haskell - Löh, Clarke, Jeuring (2003) (Correct)
No context found.
Xavier Leroy et al. The Objective Caml system release 3.02, Documentation and user's manual, December 2001. Available from http://caml.inria.fr/ocaml/htmlman/.
Inferring Type Isomorphisms Generically - Atanassow, Jeuring (Correct)
No context found.
Xavier Leroy et al. The Objective Caml system release 3.07, Documentation and user's manual, December 2003. Available from http://caml.inria.fr/ocaml/ htmlman/.
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