*
* *
* VSTTE 2009 *
* *
*Workshop on Verified Software *
*
of California, Santa Cruz)
* Jean-Christophe Filliâtre (CNRS)
Program Committee:
* Adam Chlipala (Harvard University)
* Ranjit Jhala (University of California, San Diego)
* Joseph Kiniry (University College Dublin)
* Rustan Leino (Microsoft Research)
* Xavier Leroy (INRIA
Hi,
Alexey Rodriguez a écrit :
My question is about how to hide modules (or parts thereof) in
an ocaml package from the outside world (users of the package).
* Add the file foobar.mli which contains the signatures of Foo and Bar
but hiding
Foo.unsafe_change. I think it could work, but I
I like writing my own libraries when I need some.
Unfortunately, many people do that.
Why do you say unfortunately? What was important in my answer was not
the words my own libraries but the words I like. And you cannot find
unfortunate that some people like programming :-)
(But, of course,
8) Other (please explain)
I like writing my own libraries when I need some.
(But don't misread me: I don't see myself as a concurrent to Batteries,
and I think you guys are doing a great job.)
--
Jean-Christophe
___
Caml-list mailing list.
September 11, 2009, 11:59pm Samoa time (UTC-11)
Notification of acceptance October 2, 2009
Final version October 16, 2009
PROGRAM COMMITTEE
=
* David Deharbe, Dimap UFRN, Brazil
* Dino Distefano, Queen Mary University of London, UK
* Jean-Christophe
Hi,
Benjamin Ylvisaker wrote:
I have been using ocamlgraph for a while, and have been generally happy
with it. I experienced some poor performance with moderately large
graphs (10-100k vertices) recently, which led me to look through the
source code a little. It seems that doing anything
Pascal Cuoq a écrit :
Elnatan Reisner wrote:
Is there something that can complete this analogy:
(=) is to (==) as Pervasives.compare is to ___?
The simple solution is to number at creation the objects that you want to
physically compare, using an additional field.
You can do that while
We apologise if you receive this message more than once.
*
* *
* VSTTE 2009 *
* *
*
: October 8, 2009, 11:59pm Samoa time (UTC-11)
* Notification: November 8, 2009
* Final version: November 17, 2009
* Workshop: January 19, 2010
Organizers:
* Cormac Flanagan (University of California, Santa Cruz)
* Jean-Christophe Filliâtre (CNRS)
Program Committee:
* Adam
* http://plmms09.cse.tamu.edu/, the PLMMS 2009 workshop web site
* http://tphols.in.tum.de/, the THOPLs 2009 conference web site
Program Committee
* Clemens Ballarin, aicas GmbH
* Gabriel Dos Reis, Texas AM University (Co-Chair)
* Jean-Christophe Filliâtre, CNRS Université Paris Sud
I have a question related to this: Is there a reason for the absence of a
ConcreteBidirectionalLabeled graph in the API?
Simply an historical reason: the module ConcreteBidirectional is an
external contribution (by Ted Kremenek), which was only recently added
to Ocamlgraph.
Anybody can
Jon Harrop a écrit :
I'm just trying to write efficient functions for div and mod by three. I'd
like to handle 32- and 64-bit machines with the same code so I tried:
let gcd3 = match Sys.word_size with
| 32 - 715827883
| 64 - 3074457345618258603
| _ - failwith Unknown word
(thanks to Martin Jambon's caml2html):
http://mlpost.lri.fr/examples/
You can have a look at Mlpost's API online:
http://mlpost.lri.fr/doc/Mlpost.html
Have fun with Mlpost,
--
the Mlpost authors,
Romain Bardou, Johannes Kanig,
Stéphane Lescuyer and Jean-Christophe Filliâtre
Lukasz Stafiniak a écrit :
On Tue, Jul 29, 2008 at 4:16 PM, Damien Doligez [EMAIL PROTECTED] wrote:
OCaml 3.11 has extended .annot files that will allow external tools
to do that. Also, it tells you which function calls are tail calls
and which are normal calls.
Cool! Are the
Fabrice Marchant a écrit :
Here is a counter functor : *)
[...]
(* before Counters, that would be modified this way :
*)
module Counters ( X : Map.OrderedType ) :
sig
module XMap :
sig
type 'a t = 'a Map.Make(X).t
val empty : 'a t
val add : X.t -
of elements with fold.
--
Jean-Christophe Filliâtre
http://www.lri.fr/~filliatr/
___
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inria.fr
Beginner's list: http
17 matches
Mail list logo
