Re: Value types (Was: [Caml-list] ocamlopt LLVM support)

2010-12-13 Thread Alain Frisch
On 12/12/2010 08:09 PM, Benedikt Meurer wrote: The boxing involved is relevant, but boxing in general is not the issue. In this special case, the "let nlen, n = if..." code requires heap allocation, because of the way the pattern is compiled. This could be fixed by moving the condition out of the

[Caml-list] Re: optimize div to right shift (NOT!)

2010-12-13 Thread Jonathan Kimmitt
> A C compiler would optimize this to a right shift. Changing that to > 'Int64.shift_right n 1' speeds > up the code. Sorry to be a pedant, but this is not correct. The optimisation is only possible when the arguments are unsigned integers which I don't think is specifiable when working in OCAM

Re: [Caml-list] Re: optimize div to right shift (NOT!)

2010-12-13 Thread Török Edwin
On Mon, 13 Dec 2010 12:33:33 + Jonathan Kimmitt wrote: > > > A C compiler would optimize this to a right shift. Changing that to > > 'Int64.shift_right n 1' speeds up the code. > > Sorry to be a pedant, but this is not correct. The optimisation is > only possible when the arguments are unsi

Re: [Caml-list] Re: optimize div to right shift (NOT!)

2010-12-13 Thread Benedikt Meurer
On Dec 13, 2010, at 13:58 , Török Edwin wrote: > It is still possible to avoid the division, gcc generates this: > movq%rdi, %rax > shrq$63, %rax > addq%rdi, %rax > sarq%rax > > Or a better example with division by 8: > leaq7(%rdi), %rax >

[Caml-list] [ANN] Js_of_ocaml version 1.0

2010-12-13 Thread Jerome Vouillon
Hi, I'm happy to announce the first official release of Js_of_ocaml, a compiler from OCaml bytecode to Javascript. This tool let you write OCaml programs that run on Web browsers. Js_of_ocaml is easy to install, and use thereafter, as it works with an existing installation of OCaml, with no need

[Caml-list] Places 2011 - Call for Papers

2010-12-13 Thread Vasco T. Vasconcelos
CALL FOR PAPERS PLACES'11 Programming Language Approaches to Concurrency and communication-cEntric Software 2nd April 2011, Saarbrücken, Germany Affiliated with ETAPS 2011

Re: [Caml-list] performance of ocamlgraph and ocaml batteries

2010-12-13 Thread Michael Ekstrand
On 12/12/2010 11:09 PM, Kihong Heo wrote: > I have a big program using ocaml graph and ocaml batteries. > When I was improving performance of the program, I was curious about > the performance of those library. > > I use old version of ocaml batteries (maybe beta version?) and the latest > versio

Re: [Caml-list] [ANN] Js_of_ocaml version 1.0

2010-12-13 Thread Yitzhak Mandelbaum
Jerome, Thank you, this sounds fantastic! One small question: could you expand on your last comment: On Dec 13, 2010, at 8:06 AM, Jerome Vouillon wrote: > > > Ocamljs optimizes tail recursion, but this comes at a large > performance cost. Do you mean all tail-calls come a large cost, or on

Re: [Caml-list] performance of ocamlgraph and ocaml batteries

2010-12-13 Thread Eray Ozkural
On Mon, Dec 13, 2010 at 4:47 PM, Michael Ekstrand wrote: > > > 2. Generally, is the memory consumption of ocamlgraph is effective? > > In my experience, it is quite reasonable in its memory use (particularly > compared with a Java library I tried). The ultimate test, though, is > your application.

[Caml-list] [ANN] Lwt 2.2.0 released

2010-12-13 Thread Jérémie Dimino
Hello, The Lwt team is pleased to announce the release of Lwt 2.2.0. You can download it at: http://ocsigen.org/lwt/install Here is a list of changes from the previous version (2.1.1): * Bugfixes: ** Fix a bug with cancellable threads causing {{{Canceled}}} exceptions to be raise

Re: [Caml-list] [ANN] Js_of_ocaml version 1.0

2010-12-13 Thread Jerome Vouillon
On Mon, Dec 13, 2010 at 09:58:27AM -0500, Yitzhak Mandelbaum wrote: > One small question: could you expand on your last comment: > > On Dec 13, 2010, at 8:06 AM, Jerome Vouillon wrote: > > > > > > > Ocamljs optimizes tail recursion, but this comes at a large > > performance cost. > > Do you me

Re: [Caml-list] performance of ocamlgraph and ocaml batteries

2010-12-13 Thread Julien Signoles
Hello, 2010/12/13 Eray Ozkural > Oww, is the imperative implementation using hash tables or maps then? > Imperative implementations use hash tables (except the ones called Matrix which use arrays of bitvectors) while persistent implementations use maps. > Shouldn't be too hard to plug your ow

[Caml-list] [ANN] OBus 1.1

2010-12-13 Thread Jérémie Dimino
Hi, I'm happy to announce the release 1.1 of OBus, a pure OCaml implementation of the D-Bus protocol. OBus aims to make it easy to use and provide D-Bus services in OCaml. It can generate interfaces to D-Bus services from introspection files, it provides integration of D-Bus methods, signals and

Re: [Caml-list] [ANN] OBus 1.1

2010-12-13 Thread David MENTRE
Hello, 2010/12/13 Jérémie Dimino : > OBus aims to make it easy to use and provide D-Bus services in OCaml. ... > OBus is distributed with predefined OCaml interfaces to the following > services: Hal, NetworkManager, Popup notifications, PolicyKit, UDisks > and UPower. Are there any example of the

Re: [Caml-list] [ANN] OBus 1.1

2010-12-13 Thread Jérémie Dimino
On Mon, Dec 13, 2010 at 05:47:09PM +0100, David MENTRE wrote: > Are there any example of the use of OBus? There are small examples in the archive. I don't think there are yet applications using it, except one i wrote as part of the control system of a robot. > Was OBus written for certain applica

RE: [Caml-list] Re: optimize div to right shift (NOT!)

2010-12-13 Thread Jon Harrop
Edwin wrote: > http://www.hackersdelight.org/HDcode/magic.c.txt > http://www.hackersdelight.org/HDcode/magicu.c.txt Nice! :-) Cheers, Jon. ___ Caml-list mailing list. Subscription management: http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list Ar