Philip Armstrong wrote:
On Sun, Feb 17, 2008 at 11:45:26PM +, Adrian Hey wrote:
But I guess this rant is not much help to the OP :-)
Can the Get Monad from Data.Binary be replaced by the one in
Data.Binary.Strict.Get?
Would probably require some hacking on the library I guess.
A few days back, I *think* I stumbled upon the
statement the interaction between GADTs and
functional dependencies is not yet well understood.
Then I glossed over it. Now that I have (finally)
started understanding what GADTs are meant to do, I am
somewhat terrified. Did I read that one correctly?
On Wed, Feb 27, 2008 at 2:01 AM, Judah Jacobson
[EMAIL PROTECTED] wrote:
Hi Denis,
I was unable to run your program; it looks like there's a missing
module 'Properties'. To include it in the sdist you probably need to
add it under the other-modules field in the .cabal file.
Sorry about
On Feb 27, 2008, at 3:02 AM, Grzegorz Chrupala wrote:
I was getting stack overflows when using Data.Binary with a few other
datastructures so I decided to try this option. I hacked a
Data.Binary.Strict module which is basically a copy and paste of
Data.Binary, [...]
We've recently hit the
Bryan O'Sullivan wrote:
On Feb 27, 2008, at 3:02 AM, Grzegorz Chrupala wrote:
I was getting stack overflows when using Data.Binary with a few other
datastructures so I decided to try this option. I hacked a
Data.Binary.Strict module which is basically a copy and paste of
Data.Binary,
On Wed, Feb 27, 2008 at 12:06 AM, [EMAIL PROTECTED] wrote:
Fortuitously, I recently came across a bunch of bioinformatics software in
Haskell. One of the libraries was called 'interlude', and it claims to be
able to give line locations for errors in the Prelude. I was intending to
upload
Jens Blanck jens.blanck at gmail.com writes:
{-# LANGUAGE MagicHash #-} import GHC.Exts import Data.Bits -- experiment
with using a LUT here (hint: FFI + static arrays in C)
...
Sorry I don't have an answer, only more questions.
Is {-# LANGUAGE MagicHash #-} documented somewhere? I've seen
On 2/27/08, Chad Scherrer [EMAIL PROTECTED] wrote:
Is {-# LANGUAGE MagicHash #-} documented somewhere? I've seen it referenced a
few times now, but I can't find any details about it.
No. http://hackage.haskell.org/trac/ghc/ticket/1297
--
Taral [EMAIL PROTECTED]
Please let me know if there's
Imam Tashdid ul Alam uchchwhash at yahoo.com writes:
A few days back, I *think* I stumbled upon the
statement the interaction between GADTs and
functional dependencies is not yet well understood.
Then I glossed over it. Now that I have (finally)
started understanding what GADTs are meant to
Hello,
I don't see the types modules in with the other modules in the Posix
pacakage, ??
Thanks, Vasya
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Sparklines are small, word sized graphs that can be interspersed with
text to provide context and enhance communication. There are
implementations in many languages and even some web services that will
generate them on the fly. I was looking for a Haskell solution and
finding none, wrote my own.
On Wed, Feb 27, 2008 at 1:37 PM, Hitesh Jasani [EMAIL PROTECTED] wrote:
Sparklines are small, word sized graphs that can be interspersed with
text to provide context and enhance communication. There are
implementations in many languages and even some web services that will
generate them on
hitesh.jasani:
Sparklines are small, word sized graphs that can be interspersed with
text to provide context and enhance communication. There are
implementations in many languages and even some web services that will
generate them on the fly. I was looking for a Haskell solution and
finding
Hi
I don't see the types modules in with the other modules in the Posix
pacakage, ??
It is in the base library. I answered this question by searching with Hoogle:
http://haskell.org/hoogle/?q=types
Thanks
Neil
___
Haskell-Cafe mailing list
On Wed, Feb 27, 2008 at 5:05 PM, Don Stewart [EMAIL PROTECTED] wrote:
hitesh.jasani:
Sparklines are small, word sized graphs that can be interspersed with
text to provide context and enhance communication. There are
implementations in many languages and even some web services that will
Hi,
We have an opening for a software engineer, with the potential for a
lot of Haskell development. Our group at Eaton
(http://www.eaton.com/) develops real-time control software for
vehicle and machinery applications. This position is specifically for
the design and verification of hydraulic
The goal of the Type-level library is to standardize and extend the
features offered by the multiple (and heterogeneous) type-level
programming implementations already around.
To date, type-level Booleans and arbitrary sized Naturals are supported.
I implemented a few things I didn't see in any
Satnam Singh of Microsoft Research will be speaking about concurrent
and parallel programming at Stanford tomorrow.
Details here:
http://www.realworldhaskell.org/blog/2008/02/28/stanford-haskell-talk-2008-02-28/
b
___
Haskell-Cafe mailing
At Fri, 22 Feb 2008 15:13:46 -,
Claus Reinke wrote:
i got the impression that accessing freetype2 via ftgl
might make things slightly easier, while also offering
more options (geometry instead of texture fonts), or
did I misread?
http://ftgl.wiki.sourceforge.net/
It appears to be
Hi everybody. I'm working towards a better understanding of Haskell
monads the only way I know how: by working through an example.
I am working on an AI agent that will perform a finite series of actions
before starting the sequence over again. I figured a circular list of
functions that
On Thu, Feb 28, 2008 at 7:28 AM, Aaron Altman [EMAIL PROTECTED] wrote:
newtype CircularFuncList funcList arg = CircularFuncList (funcList -
arg - (arg, funcList))
instance Monad (CircularFuncList funcList arg) where
return a = CircularFuncList (\funcList a - (a, funcList))
21 matches
Mail list logo
