.
Thanks,
Maarten Faddegon
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
e body
&& intersect [test_lcv] (blockkills bodyblock) == []
then Just $ simple_itercount init_expr test_expr
update_expr
else Nothing
itercount _ = Nothing
---8<-------
Thanks,
Maarten
_
performance.
To see if this technique would be at all useful for Haskell, you'll have to
evaluate these points in the context of a Haskell application and decide which
trade-off brings you the most benefit.
Maarten
___
Haskell-Cafe mailing
between plain raytracing, which is lazy in
that way and works backwards from the viewer's perspective, and radiosity.
Maarten
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
of a
language
implementation, and would result in a situation where the behaviour of
your
program depends on particular implementations/versions/parameters of
the JVM
running it. That is something to be avoided if possible.
Maarten Hazewinkel
maarten.hazewin...@gmail.com
nly, so it may take a few days
to get a suitable xp version. (Actually, I would be really interested in
a linux port, but have little time right now. Perhaps this library can
help: http://sourceforge.net/projects/high-res-timers ?)
Kind regards,
Maarten
Christopher Lane Hinson wrote:
Is
listinfo/haskell
Maarten Hazewinkel
maarten.hazewin...@gmail.com
Tel: 06-53 692 432 (+31-653 692 432 from outside the Netherlands)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
#x27;s actually just a thesis proposal, not actual work done.
Try this for something closer to realization:
http://www.cs.rit.edu/~bja8464/lambdavm/
Regards,
Maarten
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/l
On 10 Sep 2008, at 20:28, Ryan Ingram wrote:
On Wed, Sep 10, 2008 at 2:55 AM, Maarten Hazewinkel
<[EMAIL PROTECTED]> wrote:
[on transaction failures in databases and STM]
This seems to be a bit too much F.U.D. for STM. As long as you avoid
unsafeIOToSTM (which you really should
n
happens, and the usually only the the particular part of the code
where it went wrong this time.
Kind regards,
Maarten Hazewinkel
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
rience that
sometimes (100% pure) Java programs DO segfault.
I've had it happen to me, and while you can justifiably say it's an
error in the JVM somehow triggered by your program behaviour/timing,
that doesn't help you very much at the time.
Maarten Hazewinkel
_
to interest
serious programmers.
Maarten
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Thanks.
Kind regards,
Maarten
Code:
gui :: IO ()
gui = do
f <- frame [ text := "Hello world!" ]
m <- menuPane [ text := "&Menu" ]
m1 <- menuItem m [ text := "Menu m1", on command := putStrLn "menu m1"]
-- set f [ on (menu m1) := pu
Dear Brian,
Maarten wrote:
Brian Hulley wrote:
Alternatively, you could wrap the custom part within the node as in:
data Node = forall cust. ICustom cust => Node cust Common
getCommon :: Node -> Common
getCommon (Node cust com) = com
Thanks. This really helped. The main th
Any pointers or comments appreciated. Thanks.
Maarten
(This code is just some dummy code that contains the essence of the
problem. I posted the complete code with piggy bagged state transformers
in active objects on haskell@haskell.org, but that is rather long and
this seems to be the corre
to anyone right
after they know a bit about the basic language from a tutorial. It
helps place the basic Haskell language in both its historical context,
and in the current Haskell universe with its miriad extensions and
tools.
Thanks again,
Maarten
On 7/14/06, Simon Peyton-Jones <[EMAIL PROT
able
compile GHC with YHC, which I cannot guess the feasability of.
HTH,
Maarten
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Daniel,
Could it be that the arguments to either divides or mod should be reversed?
Currently it seems to be testing whether the candidate prime (n)
divides the possible factor (m).
Or am I to tired to read the code straight?
Regards,
Maarten
On 12/20/05, Daniel Carrera <[EMAIL PROTEC
apologise if this doesn't make sense (I'm fairly new to Haskell), but
wouldn't a single shared counter be sufficient for this?
Increment for each child launched.
Decrement by each finished child.
When it's back down to zero, you're done.
Regards,
Maarten
_
19 matches
Mail list logo
