... Hi Fabrice ! ... The instruction "-lncurses" is missing while building the .cmxa But while using the .cmxa users can still provide this linking...
Florent Monnier
fmonnier@...
Mar 1, 2008 5:22 pm
9442
On Sat, 1 Mar 2008 17:08:26 +0000 ... Thanks, The related packages installed on my debian Sid are : pb:~/projects/chess$ dpkg -l | grep curses ii dav-text...
Hi Florent ! ... Great ! Works fine on my computer too. ... I notice another small fixable thing, but in a no more maintained zone, subdir tmk, Makefile, line...
In article http://groups.google.com/group/comp.lang.functional/browse_thread/thread/a288a989c5cd6acb/50b6ca2607173c91 Jon Harrop writes let invoke (f : 'a ->...
... Currying is usually used because you want to partially apply your function. In that case, I used currying because I wanted application of the argument to ...
Thanks Jon, great example of concurrent execution by the way. I was already using currying with the reduced signature as shown below but your explanation is...
Suppose I have a function that returns an option type. I want to apply f to each item in a list until I find a non-None result, then return that underlying...
... The following implementation is tail-recursive. Additionally, it moves more information about the function's behavior into the function's signature. I...
... I would (stylistically) prefer the former more concise definition but YMMV. They are semantically equivalent but the difference can also affect performance...
... [...] What is it that you are looking for it's name? The functionality that the function provides? or the way the function is programmed? ... You have a...
Oliver Bandel
oliver@...
Mar 3, 2008 8:56 pm
9455
As others have pointed out, from a certain point of view you're searching on the predicate then projecting down to the base type: let find_some f lst = let x =...
Zitat von Oliver Bandel <oliver@...>: [...] ... The function find_some is the HOF, not f. ;-) Too tired.... Ciao, Oliver...
Oliver Bandel
oliver@...
Mar 3, 2008 11:01 pm
9457
I'm trying to write a type that can hold a function like ('a Map.Make (String).t -> int list -> int) but when I do this I get the error "Unbound type parameter...
... type 'a expr = ... If you have several parameters, use parens and commas: type ('a, 'b, 'foo, 'bar) expr = ... Martin -- http://wink.com/profile/mjambon ...
... Map.Make ... this? ... How about in a recursive type like "type 'a expr = Num of int | Fn of (('a Map.Make(String).t) -> expr list -> expr);;"? This gives...
... I was under the impression that the tail-recursion optimization could not be applied to a function that might throw an exception because debugging...
... I tidied up virt-df a bit, added a manpage and pushed it out to the mercurial repository above. I might release it in a later Fedora for people to try...
... Basically any function could throw an exception (Stack_overflow, Sys.Break, ...). I think you're confusing with try...with blocks. The following function...
... What you're referring to only applies to functions that handle exceptions using "try" blocks. Specifically, exception handlers must be pushed onto the ...
... ocaml binarize-image.ml <image> <threshold level> [blur] threshold level: a percentage (between 0.0 and 1.0) blur: optional argument example: ocaml...
Florent Monnier
fmonnier@...
Mar 4, 2008 4:31 pm
9468
... So if I place a "try ... with" at the top of my application, as in the following pseudo-application, tail-recursion is turned off for the entire...
... No. Only that call is a non-tail call. This does not have a global effect. ... That one call to "run_my_application" is not a tail call because it lies ...
