Thomas Schilling wrote:
> data T
> class Foo ns a b c | ns -> a, ns -> b, ns -> c where
> mkFoo :: ns
> defaultA :: a
> defaultB :: c -> IO b
> defaultC :: [T] -> c
> f :: c -> b -> a -> (b, Int)
> data DefaultA
> instance Foo ns a b c => Apply DefaultA ns a where
>
On Mon, 2007-30-04 at 18:35 -0700, brad clawsie wrote:
> On Mon, Apr 30, 2007 at 09:53:06PM +0100, Andrew Coppin wrote:
> > brad clawsie wrote:
> > > installing a modern linux on this box is a thirty minute exercise.
> >
> > Ah - a volunteer! :-)
>
> absolutely! for the low cost of one round-tr
ajb:
> Quoting tom <[EMAIL PROTECTED]>:
> This looks cool:
>
> bytes2int = foldr ((. (256 *)) . (+)) 0 . (map toInteger)
>
> but I'm not smart enough to parse it. This is both more readable and
> shorter:
>
> bytes2int = foldr (\x r -> r*256 + fromInteger x) 0
>
> Integer log2's are pr
G'day.
Quoting tom <[EMAIL PROTECTED]>:
> I'm pretty new to Haskell, I've been working on a Bloom filter[1]
> implementation as a learning exercise.
Excellent! Sounds like a fun test.
> I'd really appreciate it if someone more experienced would comment on
> the code. I'm sure there's plenty of
Hello all,
With all the user groups that seem to have been forming lately, I
figure it's high time to start a Bay Area group for people interested
in Haskell (on any level). I interpret "Bay Area" broadly, since I'm
in Monterey -- perhaps encompassing all of Northern California. If
you're potentia
tomahawkins:
> On 4/29/07, Georg Sauthoff <[EMAIL PROTECTED]> wrote:
> >On 2007-04-29, Tom Hawkins <[EMAIL PROTECTED]> wrote:
> >
> >Hi,
> >
> >[..]
> >> I haven't done this before in any language, so any tips would be
> >> appreciated. From what I gather, a call to posix_openpt or openpty
> >> re
On 4/29/07, Georg Sauthoff <[EMAIL PROTECTED]> wrote:
On 2007-04-29, Tom Hawkins <[EMAIL PROTECTED]> wrote:
Hi,
[..]
> I haven't done this before in any language, so any tips would be
> appreciated. From what I gather, a call to posix_openpt or openpty
> returns a master and a slave, or altern
On Mon, Apr 30, 2007 at 09:53:06PM +0100, Andrew Coppin wrote:
> brad clawsie wrote:
> > installing a modern linux on this box is a thirty minute exercise.
>
> Ah - a volunteer! :-)
absolutely! for the low cost of one round-trip business-class seat from
san jose to wherever this box is, and i wi
On Mon, Apr 30, 2007 at 11:16:47PM +0200, Denis Volk wrote:
> Hello all,
>
> I am trying to make a (turn-based) game in Haskell and need to pass
> around quite a bit of information, so using the State monad seems most
> appropriate. My question is, which is a better idea:
>
> 1) Using State GameS
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Denis Volk wrote:
> There are difficulties with the first option, including keeping even
> more state about what we're doing (for instance, are we in a menu?),
> and adding stuff later would possibly require substantial rewrites.
> Other than the fact
On 4/30/07, Denis Volk <[EMAIL PROTECTED]> wrote:
Hello all,
I am trying to make a (turn-based) game in Haskell and need to pass
around quite a bit of information, so using the State monad seems most
appropriate. My question is, which is a better idea:
1) Using State GameState r and then call
Hello all,
I am trying to make a (turn-based) game in Haskell and need to pass
around quite a bit of information, so using the State monad seems most
appropriate. My question is, which is a better idea:
1) Using State GameState r and then call execState for each game event
(i.e. user input) so I
brad clawsie wrote:
installing a modern linux on this box is a thirty minute exercise.
Ah - a volunteer! :-)
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
On Mon, Apr 30, 2007 at 08:26:35PM +0200, [EMAIL PROTECTED] wrote:
>
> Actually some sources recommend to just symlink libreadline.so.4 to
> libreadline.so.5. I haven't tried, but since version 5 is supposed to
> be upwards compatible to version 4 it's reasonable to expect that it
> works (to a ce
brad clawsie <[EMAIL PROTECTED]> writes:
>> 4) The fix to the "bug" is simply download and install the libreadline4
>> shared object. No recompilation or reinstallation necessary.
>
> i'm not sure if this has been addressed - but is there a specific
> reason an older version of the readline l
Who wrote FIT for Haskell on http://darcs.haskell.org/FIT/? Does anybody
know if the version is stable?
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hi,
I have a type class similar to this one.
data T
class Foo ns a b c | ns -> a, ns -> b, ns -> c where
mkFoo :: ns
defaultA :: a
defaultB :: c -> IO b
defaultC :: [T] -> c
f :: c -> b -> a -> (b, Int)
The idea is, that I define classes of components where the data types
> 4) The fix to the "bug" is simply download and install the libreadline4
> shared object. No recompilation or reinstallation necessary.
i'm not sure if this has been addressed - but is there a specific
reason an older version of the readline library is in use? v5 appears
to be stable and has
Hi all,
I'm pretty new to Haskell, I've been working on a Bloom filter[1]
implementation as a learning exercise.
I'd really appreciate it if someone more experienced would comment on
the code. I'm sure there's plenty of places where I'm doing things in
silly or overly complex ways.
I've package
Martin Percossi wrote:
Hello haskell-cafe,
In System.Time,
data ClockTime = TOD Integer Integer
, where the first integer represents the number of seconds since epoch,
and the other represents the number of picoseconds. Is there a way of
retrieving the first part? (In Haskell 98, the ClockTi
Udo,
I am cross posted/migrated this to Haskell-cafe per Simons request
sorry for the late response I don't check this email on weekends
I really dislike Perl as a programming language but I have to strongly
disagree about your statements about CPAN and the quality of its
contents.
I have worke
[EMAIL PROTECTED] wrote:
5) The "gigantic README" with it's "obscure note" is here
http://www.haskell.org/ghc/download_ghc_661.html a few lines away from
the download link. You can probably read it in the time it takes you
to find and click the download link. Much quicker than waiting for a
con
I have noticed that only parts haskell.org are indexed by Google. E.g.
mail archives of Haskell-Cafe and HaskellWiki are not indexed, but
cvs.haskell.org, darcs.haskell.org and hackage.haskell.org are.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.o
I'll study these ways to debugging Haskell, and in accordance with my final
work plan I'll decide the better way to follow.. For the moment i'm studing
Haskell things, but in the next times I'll might decide it.
A lot of thanks Neil and Simon.
On 4/30/07, Simon Marlow <[EMAIL PROTECTED]> wrote:
I am pleased to announce that the latest issue of The Monad.Reader is
now available:
http://www.haskell.org/haskellwiki/The_Monad.Reader
Issue 7 consists of the following four articles:
* Matthew Naylor
A Recipe for controlling Lego using Lava
* Yaron Minsky
Caml Trading: Experienc
> 5) The "gigantic README" with it's "obscure note" is here
> http://www.haskell.org/ghc/download_ghc_661.html a few lines away from
> the download link. You can probably read it in the time it takes you
> to find and click the download link. Much quicker than waiting for a
> configure script to
Andrew Appleyard wrote:
On 26/04/2007, at 12:12 am, Bulat Ziganshin wrote:
Simon Marlow recently wrote paper about handling dynamic exceptions -
for me it seems that he described general system to mimic OOP in Haskell
I found the paper (titled 'An Extensible Dynamically-Typed Hierarchy of
Ex
27 matches
Mail list logo
