[Caml-list] ocamlbuild and packs

Hi all, I've got a source tree with the following patterns : A/a.ml (defines 'let x = 1') B/a.ml (use A.x and defines 'let y = 2') B/b.ml B/b.mlpack (contains 'A B') C/a.ml (use A.x) C/b.ml (use B.A.y) C/c.mlpack (contains 'A B') Is there any way with ocamlbuild to build that tree (if

[Caml-list] ocamlbuild and packs

Hi all, I've got a source tree with the following patterns : A/a.ml (defines 'let x = 1') B/a.ml (use A.x and defines 'let y = 2') B/b.ml B/b.mlpack (contains 'A B') C/a.ml (use A.x) C/b.ml (use B.A.y) C/c.mlpack (contains 'A B') Is there any way with ocamlbuild to build that tree (if

Re: [Caml-list] Option functions (or lack thereof) + operator for composition

Hi, I found it weird to be forced to use match expressions in my code for doing that, e.g.: * let curSelectedRow = ref None in * let updateButtonsStatus () = * button_remove#misc#set_sensitive * (match !curSelectedRow with None - false | _ - true) * in * ... You

Re: [Caml-list] why is the forward pipe operator (|) so little used?

I believe it is considered as good practice in F# to use the forward type operator, only because of visual-studio intellisense, ie. tab completion using types information available at write-time. So suppose you a variable x already typed in your environment, if you write : $ x | map (fun elt -

Re: [Caml-list] Compiling Ocaml sources to c sources

Hi Vincent! you can try camloo [1] which compiles (old-syntax) caml-light to bigloo, which is a scheme to C compiler. I reckon it would be quite easy to update it to parse the ocaml syntax if you don't use functors/objects/variants/labels/thread (ie. if you use only what is available in

Re: [Caml-list] [Camlp4] Quotation expander with OCaml syntax

Are you trying to the same thing as HOP [1] ? What kind of restrictions do you impose on the expressions you can transfer from the server to the client (only non-functional values) ? How do you ensure them in your program ? Are you sure splitting the code into two parts is sufficient ? How will

[Caml-list] [ANN] ORM-0.5 and Dyntype-0.7

of manipulating types and values at run-time without having to dive into camlp4. It is described more fully in a WGT2010 paper at: http://www.cl.cam.ac.uk/research/srg/netos/papers/2010-dyntype-wgt.pdf Thomas Gazagnaire Anil Madhavapeddy ___ Caml-list mailing

[Caml-list] Re: [ANN] ORM-0.5 and Dyntype-0.7

You can obtain the ORM from Github at http://github.com/mirage/orm , and GODI packages and MacPorts will be available shortly. Normally, the packages are now available in GODI. Please report any issues that you can have with these to mir...@recoil.org. - Thomas

[Caml-list] another camlp4 question

Dear camlp4 gurus, I am looking to extend the ocaml syntax to add some keyword to module signatures (in a similar way the type-conv module does for type definition). However I am stuck with a very basic example. Can anyone tell me what's wrong here ? It seems that my extension clashes with

[Caml-list] [ANN] open-sourcing of the XAPI toolstack

We are pleased to announce the open-sourcing of the XAPI toolstack, written in OCaml, as used in the Citrix XenServer product line. The XAPI toolstack is licensed under the LGPL v2.1 with a special static linking exception. **context** Xen [1] is an open-source type 1 hypervisor, providing the

[Caml-list] Employment opportunity at Citrix Systems

Position Summary XenClient – Developer / API The Citrix XenClient product is a virtualization platform for mobile end users. Using XenClient will allow Corporate IT departments to securely separate Personal and Corporate Desktop environments while providing the same user experience to the end

Re: [Caml-list] questions

I have also learned ocaml with Le Langage Caml and I really enjoyed this book (it was one of the first book on language programming that I rode). It might a be a good idea to update the content of this book and to translate it into ocaml/english :-) Thomas 2009/3/31 Martin Jambon

Re: [Caml-list] Defining type that requires hashtables with recursive definition

or if you really want to define your own equality, you can use recursive modules: module rec H : Hashtbl.HashedType = struct type node = | Node of node J.t | Leaf of int type t = node let equal (e1:node) (e2:node) = (==) e1 e2 let hash (e:node) = Hashtbl.hash e

[Caml-list] annotate a .ml file with type information

Hi all, I would like to write a camlp4 extension which use infered-type information. To do that, I can see two ways: * either calling an type-inference function of the compiler, giving it an AST and a context associating identifiers to types which seems to me a bit complicated (and maybe

Re: [Caml-list] What does Jane Street use/want for an IDE? What about you?

I would prefer to not have an editor which modify completely the file I am working on (ie. automatically replace tab by spaces). When working on big project, you cannot assume that everybody use spaces-based editor, and you still want to minimize the diff size of your patches. Thomas 2008/10/23

Re: [Caml-list] What does Jane Street use/want for an IDE? What about you?

What are killer features you dream of? Clearly, the ability to click on a function to go to the place where it is defined is the only reason why I switched from emacs to Eclipse ... And I would be very happy to switch to a faster IDE because Eclipse is so slow on big project. Thomas