Hello,
the error message
"Unbound constructor A.a"
does not tell if module A is currently accessible or not.
This makes programmers uncomfortable.
Is there any reason not to add this precision ?
Thanks
François Colonna
___
Caml-list mailing lis
Mauricio Fernandez wrote:
> On Mon, Nov 10, 2008 at 05:31:15PM +0100, Florian Lorenzen wrote:
> See stdlib/camlinternalLazy.ml --- force takes but 6 lines of code.
Thank you Mauricio. That pointer helped.
Regards,
Florian
signature.asc
Description: OpenPGP digital signature
___
On Wed, Nov 12, 2008 at 10:49:34PM +, Richard Jones wrote:
[...]
>
> You could cheat and have a look at pa_where ...
>
> http://bluestorm.info/camlp4/pa_where/list.php
> http://bluestorm.info/camlp4/pa_where/pa_where.ml.html
It does not explain why RIGHTA in my code does not work as expecte
On Thu, Nov 13, 2008 at 10:44:46AM +0100, Colonna Francois wrote:
> the error message
>
> "Unbound constructor A.a"
>
> does not tell if module A is currently accessible or not.
> This makes programmers uncomfortable.
Agreed. I filed a wishlist bug about this a while ago:
http://caml.inri
> By the way each time I need to use the unix module my failing
> knowledge of system programming is relieved by the unix course of
> Leroy and Remy. This is such a good documentation of ocaml's unix
> module it's a shame it isn't available in the lingua franca of
> programmers. Apparently there ha
Le 13 nov. 08 à 21:22, Florent Monnier a écrit :
I was thinking that I would be pleased to traduct it in English
(well perhaps not all because it's huge, but at least
some chapters). The result would be written in my usual poor English
but then it would be easy for an English born guy to cor
I'm looking for a way to calculate hashes of values of variuos types. It
has to be:
1. proper function (i.e. x=y => (hash x)=(hash y) )
2. and should not change with a platform or compiler version.
3. It'd also help to have practically no collisions.
For some time I needed not to move data acros
> How hard would it
> be to tailor it to, say, work always with 31 bits?
Hashtbl.hash will return a 31 bit integers on both 32 or 64 architectures:
file: ocaml-3.10.2/byterun/hash.c
CAMLprim value caml_hash_univ_param(value count, value limit, value obj)
{
[...]
return Val_long(hash_accu & 0
Erik de Castro Lopo a écrit :
Yaron Minsky wrote:
Just to be clear, the results of the Menhir project _have_ been rolled into
a release.
Yes, I'm looking at menhir-20080912 right now :-).
hello (offlist),
Have you looked at dypgen ... (http://dypgen.free.fr/), it even offers
in
hello (offlist),
Visibly I got it wrong ... so it was not offlist ;-)
Cheers,
Christophe
___
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inria.fr
Beginner's list: ht
10 matches
Mail list logo