Dear colleague,
Please forward to potentially interested candidates. Please note the
deadline for submission is 31 October, 2008.
===
Departamento de Informática,
Faculdade de Ciências e Tecnologia,
Universidade Nova de Lisboa,
Portugal
Applications are
Hello,
Are there cases where ocamlopt -shared is useful without -linkall?
Cheers,
--
Stéphane Glondu
___
Caml-list mailing list. Subscription management:
http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list
Archives: http://caml.inria.fr
Stéphane Glondu wrote:
Are there cases where ocamlopt -shared is useful without -linkall?
Yes, I think so. First, of course, when you don't link any library in
the .cmxs, only modules, then -linkall is not needed (but admittedly it
wouldn't hurt). Second, imagine you want to create an addin
Members of the list will be interested in the following important book in
Springer.
A Generative Theory of Shape
Michael Leyton
Springer-Verlag
The purpose of the book is to develop a generative theory that has two
properties regarded as fundamental to intelligence -
maximizing
Kuba Ober wrote:
Members of the list will be interested in the following important book in
Springer.
Has Springer gone so low?
Well... judging from what mathematicians around me say about Springer
these days, that actually is a question that seriously has to be raised.
--
best regards,
I've finished the initial part of translating Camelia
to Qt4. It now uses no Qt3 classes/methods, and compiles cleanly
with Qt3 support disabled. Some minor Qt3-isms were refactored,
but it's just a tip of the iceberg. I now have to get it into a running shape.
I commit to SVN every day or two,
I'd like to understand better how ocaml's weak pointers operate.
First, although it doesn't seem to be specified in the documentation,
I assume that weak pointers will *not* be reclaimed (e.g. from a weak
hash table) if the program retains some other reference to the object.
I.e. the weak
Hello,
Is the closure's environment of definitions introduced by let rec
shared between the definitions ?
Thanks for your answers,
Daniel
___
Caml-list mailing list. Subscription management:
On Oct 30, 2008, at 11:48 AM, CUOQ Pascal - [EMAIL PROTECTED] wrote:
Warren Harris [EMAIL PROTECTED] wrote:
I'd like to understand better how ocaml's weak pointers operate.
You will be interested in the following important article:
http://portal.acm.org/citation.cfm?id=1411308
:)
Thank
Le 30 oct. 08 à 20:40, Philippe Wang a écrit :
If you mean
[...]
No I'm talking about the internal representation. For example if you
implement objects with records :
type o = { mutable m1 : unit - bool; mutable m2 : unit - int }
let f bla =
let rec m1 () = bla = 0
and m2 () = bla
Le 30 oct. 08 à 21:18, David Allsopp a écrit :
Shouldn't I now be able to say:
string_of_int x;;
I don't think so. According to the manual [1] the only thing you can
do on private types is pattern match or project their fields. I
doesn't mean your type can be substituted by int.
David Allsopp [EMAIL PROTECTED] writes:
I thought that the point of private types was that you could
deconstruct them... so values of type M.t are valid wherever an int
is used but not the converse.
It should probably be ok for immutable data but not for mutable
ones. One example is using
Daniel Bünzli wrote:
Le 30 oct. 08 à 21:18, David Allsopp a écrit :
Shouldn't I now be able to say:
string_of_int x;;
I don't think so. According to the manual [1] the only thing you can
do on private types is pattern match or project their fields. I
doesn't mean your type can be
Dear list,
We are pleased to announce the first release of Mlpost, an Ocaml
interface to MetaPost, a powerful software to draw pictures to be
embedded in LaTeX documents.
Mlpost is free software under LGPL license and is available at
http://mlpost.lri.fr/
Some examples are available online
Warren Harris wrote:
On Oct 30, 2008, at 11:48 AM, CUOQ Pascal - [EMAIL PROTECTED] wrote:
In short: don't use weak pointers to make
caches.
Thanks for the advice -- but I thought this was exactly what weak hash
tables were intended for.
Although there is some similarity between a weak
From: David Allsopp [EMAIL PROTECTED]
Thanks for this - although it's a link to an OCaml 3.10 manual so not
applicable here it did point me to the correct chapter in the OCaml 3.11
manual (I'd been looking in Part I of the manual and given up). What I
should have written is
string_of_int
Warren Harris wrote:
I'd like to understand better how ocaml's weak pointers operate. First,
although it doesn't seem to be specified in the documentation, I assume
that weak pointers will *not* be reclaimed (e.g. from a weak hash table)
if the program retains some other reference to the
17 matches
Mail list logo
