On Sun, Aug 10, 2008 at 1:29 PM, Warren Aldred <[EMAIL PROTECTED]> wrote:
> I'm new to Haskell and looking for recommendations on introductory Haskell
> books. Online or offline. Any suggestions?
I like
_Programming in Haskell_ (Hutton)
_The Haskell School of Expression_ (Hudak)
_Real World Hask
Thanks
-邮件原件-
发件人: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED]
发送时间: 2008年8月11日 18:33
收件人: [EMAIL PROTECTED]
主题: The results of your email commands
The results of your email command are provided below. Attached is your
original message.
- Results:
Ignoring non-text/plain MIME parts
G'day all.
Quoting "C.M.Brown" <[EMAIL PROTECTED]>:
Yes, I saw that, thanks! I guess this is because it's hard to compile a
mutually recursive module...
It's because you don't need to declare the types of exported definitions.
Consider, this highly artificial example:
module A where
patperry:
> Hey everyone,
>
> I've put together a new release of the Haskell BLAS bindings, now
> available on hackage.
>
Arch Linux package available,
http://aur.archlinux.org/packages.php?ID=18098
Cheers,
Don
___
Haskell-Cafe mailing list
H
Hey everyone,
I've put together a new release of the Haskell BLAS bindings, now
available on hackage.
Here are the new features:
* Add Banded matrix data type, as well as Tri Banded and Herm Banded.
* Add support for trapezoidal dense matrices (Tri Matrix (m,n) e, where
m is not the same a
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
i've been looking into the possibility of creating some xslt to expose
haskell apis to yahoo search via searchmonkey.
if you see the java api search plugin, you can see some possibilities.
i was wondering if anyone maintaining any the official api
Hi Don,
>
> GHC provides a mechanism to support mutually recursive modules, but
> you must break the cycle manually, via a boot file.
>
>
> http://www.haskell.org/ghc/docs/latest/html/users_guide/separate-compilation.html#mutual-recursion
>
Yes, I saw that, thanks! I guess this is because
cmb21:
> Hi,
>
> I have a question about cyclic inclusions. It appears in the Haskell 98
> report that mutually recursive modules are allowed, however GHC complains
> at any Haskell project that has cyclic inclusions (implicit or explicit).
> Am I right in thinking that this is a GHC limitation?
>
Hi,
I have a question about cyclic inclusions. It appears in the Haskell 98
report that mutually recursive modules are allowed, however GHC complains
at any Haskell project that has cyclic inclusions (implicit or explicit).
Am I right in thinking that this is a GHC limitation?
http://www.haskell
On Sun, Aug 10, 2008 at 11:47 AM, Michael Feathers
<[EMAIL PROTECTED]> wrote:
>
> unlist3 :: (a -> a -> a -> b) -> [a] -> b
> unlist3 f (x:y:z:xs) = f x y z
>
Oleg has written about this. Be careful, its easy to overdose on:
"Functions with the variable number of (variously typed) arguments"
http
Jason Dusek <[EMAIL PROTECTED]> wrote:
[These are point 3 and 4]
> . Compare every Word32 with every other Word32 for equality,
> and see how long it takes.
> . Ditto with ByteStrings.
>
> The first two are easy and I'm done with them already. The
> latter two seem like they'll run afo
brian <[EMAIL PROTECTED]> wrote:
> > What's wrong with just using 'String' as the Map key?
> It seems wrong. Yeah, it's just a String, but we're being all abstract
> because that's better practice. It happens that when you parse
> bencoded data, the length of the string is given. Maybe I want to
>
(actually, we didn't take any photos!)
So, Anglo Haskell 2008 has been and gone. Many fair souls braved both
the weather and the London transport system and were entertained for two
days at Imperial College, London.
Slides and audio are now available from:
http://www.wellquite.org/anglohaskell200
I've been trying to lambdabot running properly recently, and have
consistently hit an error "fd:6: hClose: resource vanished (Broken
pipe)" whenever I try to run anything that involves executing haskell
(including but not limited to evaluating arbitrary expressions, the
brainfuck module, un
Hello,
I am building 6.8.3 from my "local" 6.8.2. However, I am getting
errors in compiling one of the Main.hs. E.g.
Main.hs:76:23:
Ambiguous occurrence `flags'
It could refer to either `Main.flags', defined at Main.hs:118:0
or `System.Posix.flags', import
I'd like to perform a micro-benchmark, pitting ByteString
comparision against Word comparison. What I'd like to do is:
. Generate a bunch of random Word32s.
. Generate strict ByteStrings containing those Word32s.
. Compare every Word32 with every other Word32 for equality,
and see ho
16 matches
Mail list logo
