Dear all,
We are currently advertising for new lecturers in Nottingham. There
are no particular research areas specified for these positions, but
applications in the area of the Languages and Programming research
group (http://www.cs.nott.ac.uk/Research/lap/) would be most welcome.
The closing
Hello
I'm a haskell newbie that tries to create a tree
with arbitary numbers of childs.
I create the data structure but i can't do anything
on it can someone please help
me with a small function that sums the values of
the leafs, so i don´t loose my hair
so fast.
The datastructure looks
I'm currently building ghc 4.08.2 on HP-UX using gcc 2.95.2, so we'll
see how that goes. I have one or two local patches in my
tree from last
time I did this that may have an impact on the dynamic calling issue.
Good luck to you. While I have a pretty good idea of how the regular C
runtime
[This message is sent through a WWW-Email gateway.]
[The authenticity of the sender can not be validated.]
[Message sent from the following machine - 62.172.105.102 ]
[after accessing this URL
http://www.dcs.gla.ac.uk/scripts/global/send_message?[EMAIL PROTECTED]+message]
--
Hi,
If you want
On Mon, 26 Feb 2001, Martin Gustafsson wrote:
Hello
I'm a haskell newbie that tries to create a tree with arbitary numbers of childs.
I create the data structure but i can't do anything on it can someone please help
me with a small function that sums the values of the leafs, so i dont
At 01:26 2001-02-26 -0800, Simon Peyton-Jones wrote:
And so on. So we build up a giant chain of thunks.
Finally we evaluate the giant chain, and that builds up
a giant stack.
...
If GHC were to inline foldl more vigorously, this would [not] happen.
I'd hate to have my programs rely on
hello,
in my
program i used my own parameterised state transformer monad, which iswell
described in literature:
newtype
State s m a = ST (s - m
(a,s))
ghc and hugs
contain built in implementation of state monad ST.
is it the
same thing? the documentation is not clear on that.
if it is
