[Caml-list] Re: Stricter version of #use ?

Hi John, On 3/25/2009 1:14 AM, Harrison, John R wrote: So with my root.ml and branch.ml files from the first message, it all works exactly as I wanted, a nice early failure with a clear traceback: # #use root.ml;; val x : int = 1 val u : int = 3 Exception: Failure X. Error in

Re: [Caml-list] First release of focalize, a development environment for high integrity programs.

On 2009-03-24, at 11:55, David MENTRE wrote: For those interested in such details, FoCaLize seems to be under a BSD-like license (I have not made a detailed review of the code). I would be interested to know if knowledged people (e.g. Debian developers ;-) consider this code Free Software or

Re: [Caml-list] Question about the -dlambda option of ocamlc/ocamlopt

Alp Mestan a écrit : Hi, I'm currently studying the lambda code generation phase of the standard OCaml compiler. You can take a look at this for an example : http://blog.mestan.fr/2009/03/22/ocaml-and-dlambda-1/ I'm wondering what is 'makeblock' for ? And why is there '/a number' after

Re: [Caml-list] Question about the -dlambda option of ocamlc/ocamlopt

Thanks Romain ! On Wed, Mar 25, 2009 at 10:02 AM, Romain Bardou romain.bar...@lri.frwrote: Alp Mestan a écrit : Hi, I'm currently studying the lambda code generation phase of the standard OCaml compiler. You can take a look at this for an example :

[Caml-list] in_channel_of_descr questions

Hello, I have some questions concerning in_channel_of_descr: my program has a list of sockets. I need the sockets itself for a select-Loop and an in_channel for the convenient input_line function. At the end, which one should i close? Just the socket, just the channel or both? On Windows I tried

Re: [Caml-list] in_channel_of_descr questions

Hi, On Wed, Mar 25, 2009 at 13:37, Christoph Bauer christoph.ba...@lmsintl.com wrote: Hello, I have some questions concerning in_channel_of_descr: my program has a list of sockets. I need the sockets itself for a select-Loop and an in_channel for the convenient input_line function. At the

Re: [Caml-list] First release of focalize, a development environment for high integrity programs.

Hello, On Wed, Mar 25, 2009 at 10:02, Damien Doligez damien.doli...@inria.fr wrote: For example, I don't understand why you would need a detailed review of the code in order to notice that the licence (which you quoted) is an exact copy of the new BSD licence (straight from

[Caml-list] qt / windows gui

Are there OCaml bindings for QT? Would OCaml + QT be a good option for a Windows app? I don't want to go with F# and do want to keep development on the Mac. Thanks, Joel --- http://linkedin.com/in/joelreymont ___ Caml-list mailing list.

[Caml-list] WMM'09 call for papers

Call for Papers 4rd Informal ACM SIGPLAN Workshop on Mechanizing Metatheory Edinburgh, Scotland Co-located with ICFP'09. http://www.cis.upenn.edu/~sweirich/wmm/ Important Dates * Submission deadline: 19 June 2009 * Author Notification: 24 July 2009 * Workshop: 4 September 2009 Workshop

[Caml-list] can anyone replicate this camlp4 problem?

-BEGIN PGP SIGNED MESSAGE- Hash: SHA1 Hi, camlp4 seems to break parsing of object duplication on 3.11. Can anyone replicate this problem? Is this an known issue? A quick google search did not reveal anything.. Peng Objective Caml version 3.11.0 # #use topfind;;

Re: [Caml-list] can anyone replicate this camlp4 problem?

On Mar 25, 2009, at 3:55 PM, Peng Zang wrote: -BEGIN PGP SIGNED MESSAGE- Hash: SHA1 Hi, camlp4 seems to break parsing of object duplication on 3.11. Can anyone replicate this problem? Is this an known issue? A quick google search did not reveal anything.. Yeah. I reported

Re: [Caml-list] can anyone replicate this camlp4 problem?

-BEGIN PGP SIGNED MESSAGE- Hash: SHA1 I only know of the brute force update which is less than desirable: class test (x : int) = object val a = x; val b = x; method add (d:int) = let copy = {} in let arr : int array = Obj.magic copy in arr.(2) - arr.(2) + d;

[Caml-list] polymorphic variants and recursive functions

I stumbled upon a little puzzle that I can't quite work out. I'm trying to use polymorphic variants as phantom types and in one particular situation involving a polymorphic type with an invariant type parameter (Lwt.t) the compiler is unhappy with a set of mutually recursive functions. I

Re: [Caml-list] polymorphic variants and recursive functions

On Wed, Mar 25, 2009 at 02:39:28PM -0700, Warren Harris wrote: let rec eval = function | `Arr v - (eval_arr v : [`V] Lwt.t: [ `V] Lwt.t) | `Obj v - (eval_obj v : [`V|`O] Lwt.t : [ `V] Lwt.t) and eval_arr v = eval_obj v = arr and eval_obj v = eval v = obj | `Obj v - (eval_obj v :

[Caml-list] Automated Reasoning Workshop 2009 - 2nd Call for Papers

** Please excuse multiple posts and distribute as widely as possible ** CALL FOR PAPERS 2009 Workshop on Automated

Re: [Caml-list] polymorphic variants and recursive functions (caml: to exclusive)

Mauricio, Thanks for your response... On Mar 25, 2009, at 4:24 PM, Mauricio Fernandez - m...@acm.org wrote: The Lwt.t type is abstract and invariant since no annotation has been given for the type variable (you'd need it to be type +'a t): ... Unfortunately, the type variable is in