The down link is not valid:http://cvs.haskell.org/Hugs/downloads/2006-05/WinHugs-Sep2006.exebut I am able to wget it at:
http://cvs.haskell.org/Hugs/downloads/2006-09/WinHugs-Sep2006.exe
___
Haskell mailing list
Haskell@haskell.org
http://www.haskell.org/
Christian Neumann altfrau.de> writes:
>
> Am Thu, 21 Sep 2006 08:07:36 +0100
> schrieb "David House" gmail.com>:
> As a real Haskell newbie I must say that this is (IMHO) a very bad idea.
> It's annoying to register on yet another forum just to ask one question
> (and even more to regularly us
Robert Stroud wrote:
> Thanks for your explanation - this is beginning to make more sense to
> me. However, I'm not finding it easy to follow the Haskell language
> manual, and understand how the rules apply, so please could you
> confirm that the following reasoning is correct...
>
> First
Robert Stroud wrote:
> Thanks - that's a helpful example. But why is the following not
> equivalent to the untyped "k = 2" case:
>
> let f :: Int -> Int -> Int ; f x y = x * y in (f 2 2, 1/2)
>
> Does the type of 2 effectively get decided twice, once as an Int, and
> once as a Fractional, an
This message (from haskell-cafe) by Kurt Hutchinson exactly explains
that i want and why i propose do to it. sorry for inconvenience, i
don't propose to stop mail lists and plan to present in both medias
(while others will continue to use irc, blogs, LJs, rss feeds and all
other ways to let Haskel
We are pleased to announce a new minor release of Hugs, fixing a few
bugs with the May 2006 release, and with libraries roughly matching
the forthcoming GHC 6.6 release. It is available from the Hugs page:
http://www.haskell.org/hugs/
As with the May 2006 release, two sizes of the Window
On 20 Sep 2006, at 22:21, Ashley Yakeley wrote:Arie Peterson wrote: You absolutely right about this defaulting breaking referential transparency. Do you know if it can be switched off in GHC? I know one can switch on warnings when it happens, but I don't think that's the same thing.You can use an e
On 21 Sep 2006, at 10:46, Robert Stroud wrote:
So k gets a monotype which is determined by its usage, you cannot
do e.g.
let k = 2 ; f :: Int -> Int -> Int ; f x y = x * y in (f k k, 1/k)
whereas let k :: Num a => a; k = 2; ... is possible.
Thanks - that's a helpful example. But why
Hello szefirov,
Thursday, September 21, 2006, 2:04:38 PM, you wrote:
> Is it possible to represent a result of several impure calculation as a
> pure list?
list = repeat (runST my_impure_calculation)
> The only way I can think of is the use of unsafePerformIO.
runST is really a safe variant of
Hello Duncan,
Thursday, September 21, 2006, 12:11:28 PM, you wrote:
> I'm pleased to announce two new packages: zlib and bzlib which provide
> functions for compression and decompression in the gzip and bzip2
> formats:
that's great! i even think that these libraries should go into ghc's
extra-l
It is widely spread convention to simulate electronic circuits using
infinite lazy lists.
This works well for high level modeling, but when engineers ask to
cosimulate it with Verilog or VHDL modules it goes somewhat off of pure
functional programming.
The main obstacle is that those modules
On 20 Sep 2006, at 17:28, Christian Sievers wrote:
However, if I type an apparently equivalent let expression into Hugs
directly, then I get the value 4 as expected
let k = 2 ; f :: Int -> Int -> Int ; f x y = x * y in f k k
Why is there a difference in behaviour?
Here, there is no defaulti
Christian,
Thanks for your explanation - this is beginning to make more sense to
me. However, I'm not finding it easy to follow the Haskell language
manual, and understand how the rules apply, so please could you
confirm that the following reasoning is correct...
Firstly, am I right in th
Hello Misha,
Thursday, September 21, 2006, 3:36:05 AM, you wrote:
>> f :: C T => T -> T
> or
>> instance C T => C T' where
>> -- a body that uses functions from C T
i think that is a great idea, in a true Haskell spirit
you don't got any answers because of Haskell Workshop and ICFP are
hold now
I'm pleased to announce two new packages: zlib and bzlib which provide
functions for compression and decompression in the gzip and bzip2
formats:
Both provide pure functions on streams of data represented by lazy
ByteStrings:
compress, decompress :: ByteString -> ByteString
This makes it easy to
Am Thu, 21 Sep 2006 08:07:36 +0100
schrieb "David House" <[EMAIL PROTECTED]>:
> I happen to think this would be a good idea from a newbie's point of
> view.
As a real Haskell newbie I must say that this is (IMHO) a very bad idea.
It's annoying to register on yet another forum just to ask one quest
On 21 Sep 2006, at 08:07, David House wrote:
On 20/09/06, Bulat Ziganshin <[EMAIL PROTECTED]> wrote:
i definitely think that to rise up Haskell popularity we need now to
create web forum.
I happen to think this would be a good idea from a newbie's point of
view. For one-off questions (or per
On 20/09/06, Bulat Ziganshin <[EMAIL PROTECTED]> wrote:
i definitely think that to rise up Haskell popularity we need now to
create web forum.
I happen to think this would be a good idea from a newbie's point of
view. For one-off questions (or perhaps two-off), it's far easier to
register on a
18 matches
Mail list logo
