Hello,
2010/11/11 Philippe Wang philippe.w...@lip6.fr
Shortly:
ocamlclean is now available in a separate package so that you don't have to
get the whole ocapic distribution just to try ocamlclean.
More information:
ocamlclean takes a bytecode executable (which are generally but not
)
Hope this helps,
Julien Signoles
___
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://groups.yahoo.com/group/ocaml_beginners
Bug reports: http
2010/10/12 Mathias Kende math...@kende.fr
To represent abstract graphs (those were the
equality for the nodes type is not used to check if two nodes of a graph
are the same), the library uses an internal counter. This counter must
be serialised along with the graphs and then it must be
Hello Sylvain,
2010/9/3 Sylvain Le Gall sylv...@le-gall.net
I would like to define:
type license = GPL | LGPL
and
let data = [ GPL, GNU Public license;
LGPL, GNU Lesser General Public license ]
I would like to enforce that all variants of license are in the
association
let () = match GPL with
| GPL | LGPL -
assert
(let s = Do not forget to add new constructors to the data list
above. in
Format.ifprintf Format.std_formatter %s s;
true)
Sorry could be much better like this:
let () = match GPL with GPL | LGPL -
ignore Do
LinkedIn
Julien Signoles requested to add you as a connection on LinkedIn:
--
Zaynah,
J'aimerais vous inviter à rejoindre mon réseau professionnel en ligne, sur le
site LinkedIn. Julien Signoles
Accept invitation from Julien Signoles
http
Hello Romain,
2010/7/20 Romain Bardou romain.bar...@lri.fr
So I've updated my Debian a few weeks ago and it updated tuareg-mode. It's
great to know that Tuareg is still maintained. I remembered seeing a thread
here with some reproaches, about colors or something. Well I don't really
care
Hello,
For caml-list readers who do not speak French, the initial question is about
the compilation of an ocamlyacc parser which uses the OcamlGraph library.
Le 14 juin 2010 17:32, Rabea Ameur-Boulifa
rabea.ameur-boul...@telecom-paristech.fr a écrit :
J'utilise la librairie ocamlgraph pour la
Hello,
2010/5/24 Goswin von Brederlow goswin-...@web.de
I'm playing around with packs and ways to avoid having to duplicate
module signatures all over the place. So I came up with the following
idea: Each module declares an external and internal module type and
restricts itself to the
Hello,
2010/5/21 Hans Ole Rafaelsen hrafael...@gmail.com
When packing a set of modules into a top module using -pack, is there a way
to have some of the modules private to the package?
If I have the modules Helper, Foo and Bar. Helper provides helper functions
used by Foo and Bar. When I'm
Hello,
2010/5/21 Ashish Agarwal agarwal1...@gmail.com
write a script to generate the P.mli file
Why do you need Bar.mli and Foo.mli at all? Just write the P.mli only.
If your pack is big, you may want to mask internals of Bar and Foo to others
modules of the pack. Actually, values exported
2010/5/21 Goswin von Brederlow goswin-...@web.de
Julien Signoles julien.signo...@gmail.com writes:
Hello,
2010/5/21 Ashish Agarwal agarwal1...@gmail.com
write a script to generate the P.mli file
Why do you need Bar.mli and Foo.mli at all? Just write the P.mli
only
Hello,
2010/5/19 Török Edwin edwinto...@gmail.com
I was able to find the sources via the wayback machine.
Unsurprisingly it doesn't build with OCaml 3.11.2 (it wants OCaml 3.06).
Is there a more up to date variant of ocamldefun? Would it be possible
to port it to 3.11.2?
As far as I know,
Hello,
2010/5/20 Török Edwin edwinto...@gmail.com
On 05/20/2010 11:41 AM, Julien Signoles wrote:
I think that'll have to be someone else than me, as I consider myself
just a beginner in OCaml.
However if you think that implementing AST transforms would be possible
for a beginner (in OCaml
Sorry miss the Cc-ing to the caml list.
-- Forwarded message --
From: Julien Signoles julien.signo...@gmail.com
Date: 2010/5/14
Subject: Re: [Caml-list] Balancing algorithm of Set/Map implementation
To: Yoriyuki Yamagata yoriyuk...@gmail.com
Hello,
2010/5/14 Yoriyuki Yamagata
Sorry, forgot the caml-list.
---BeginMessage---
Jun Furuse a écrit :
I have quickly wrote a small patch against 3.11.1 for this feature, to
see what it would be like.
http://sites.google.com/a/furuse.info/jun/hacks/other-small-ocaml-patches
With this patch, path names are printed without
Sorry, forgot the caml-list.
---BeginMessage---
Jun Furuse a écrit :
I have not tested it well but it counts dots and should try to find
the minimal one.
A problem I have found so far is that it prints something confusing, ex.
module M = struct type t end
module N = struct type t end
open M
Hello,
Here are my personal reasons:
2) It's not 1.0 yet, I'll try it then
Changing try by have another look at ;-)
3) It makes my executables too big
Yes, even if it seems to be improved in a close future.
4) It's too hard to install (dependencies, godi failures)
Yes: pretty sure that it's
, other work-arounds have been suggested in
other posts.
By the way contributing to ocamlgraph by adding
Imperative.Digraph.AbstractBidirectional (for instance) is still
possible and welcome :o).
--
Julien Signoles
___
Caml-list mailing list
--
Julien Signoles
___
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://groups.yahoo.com/group/ocaml_beginners
Bug reports: http
/2008},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Hope this helps,
Julien Signoles
--
Researcher-engineer
CEA LIST, Software Reliability Lab
91191 Gif-Sur-Yvette Cedex
tel:(+33)1.69.08.71.83 fax:(+33)1.69.08.83.95 julien.signo...@cea.fr
___
Caml
- Format.printf fmt)
let () =
output %s ;
output
=
Best regards,
Julien Signoles
___
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
you just add an another abstract type in your
signature like below?
=
module type T = sig
type extra
val f : extra - unit
end
module Make(Extra : A.Extra)(A : A.T with type extra = Extra.t)
: T with type extra = A.extra
open A
val f : extra - unit
=
Hope this helps,
Julien
plug-in development, don't hesitate to sent a message on the
Frama-C public mailing list
(http://lists.gforge.inria.fr/cgi-bin/mailman/listinfo/frama-c-discuss).
Br,
Julien Signoles
--
Researcher-engineer
CEA LIST, Software Reliability Lab
91191 Gif-Sur-Yvette Cedex
tel:(+33)1.69.08.71.83 fax
-recursive_modules-03.pdf
Hope this helps,
Julien Signoles
--
Researcher-engineer
CEA LIST, Software Reliability Lab
91191 Gif-Sur-Yvette Cedex
tel:(+33)1.69.08.71.83 fax:(+33)1.69.08.83.95 julien.signo...@cea.fr
___
Caml-list mailing list
Le mercredi 28 janvier 2009 à 14:07 +, Matthieu Wipliez a écrit :
Hello,
Is it a bug or a well-known feature that the above program does not emit
a warning (because f x should have type unit in the body of g) ?
=
let f x = x
let g x = f x; 1
(* let _ = g 2 *)
?
Best regards,
Julien Signoles
___
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://groups.yahoo.com/group/ocaml_beginners
Bug reports: http
regards,
Julien Signoles
--
Researcher-engineer
CEA LIST, Software Reliability Lab
91191 Gif-Sur-Yvette Cedex
tel:(+33)1.69.08.71.83 fax:(+33)1.69.08.83.95 julien.signo...@cea.fr
___
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi
28 matches
Mail list logo