Re: [Haskell-cafe] Functional Reactive Web Application Framework?

> This became particularly obvious for dynamic recursion of reactive > behaviours, somewhat like >  page n = `until` (keypress `then` (\key-> page n)) We have this function, which permits patterns like the one above: http://www.flapjax-lang.org/docs/#tagRec tagRec does not permit mutual recursi

Re: [Haskell-cafe] Functional Reactive Web Application Framework?

> Flapjax is javascript so possibly there could be a way to integrate it > into Haskell using HJavascript?  Maybe it could even be integrated > into Happstack? The Flapjax compiler is written in Haskell, so that might help. I assume you want to write FRP in a Haskell-embedded DSL and generate FRP

Re: [Haskell-cafe] HTTP package: connection closing bug?

Aha, I knew I wasn't dreaming! Paul Brown posted this discussion back in February. It looks like the same thing. Has there been an update of HTTP since then? Nope, it hasn't been updated. I'm just running a locally patched version.

Re: [Haskell-cafe] CouchDB module in Yhc source tree: clarification, and small problems with other packages

On 8/21/08, Don Stewart <[EMAIL PROTECTED]> wrote: I think the best result here would be to put a CouchDB binding on hackage. Is anyone in a position to do this? As for myself, honestly, I did not plan to do this at this time as I am busy with other stuff (Yhc Core conversion). I'd be glad to

[Haskell-cafe] HTTP package: connection closing bug?

Hi, I'm using HTTP-3001.0.4 with GHC 6.8.3 under Mac OS X 10.5 and Debian Lenny. If I open and close many connections, I eventually get the error. Anyone else seen this before? *** Exception: socket: resource exhausted (Too many open files) Apparently, the socket is not closing. in TCP.

[Haskell-cafe] Distributing a GHC-compiled binary for Macs (x86)

Hi, I compiled a binary using GHC 6.6 on my Mac (specifically, using ghc --make). This binary seems to depend on the GNU MP framework--I imagine GHC uses it to implement its numeric tower. However, Macs that don't have GHC installed don't seem to have GMP, so I'll guess that it was installed al

Re: [Haskell-cafe] Compiling an extremely large Haskell file (in GHC)

06-28 at 12:11 +0300, Radu Grigore wrote: > On 6/27/05, Arjun Guha <[EMAIL PROTECTED]> wrote: > > It's the all-pairs > > shortest paths data for a map of the Hyde Park area of Chicago (no real > > reason, really). > > I wonder: is there really no way to

[Haskell-cafe] Compiling an extremely large Haskell file (in GHC)

I have an extremely large source file of about 11 MB. It's the all-pairs shortest paths data for a map of the Hyde Park area of Chicago (no real reason, really). I generated information in Scheme and printed the result to a Haskell source file as a list. I then edited the file to initialized

Re: [Haskell-cafe] Instances of constrained datatypes

One way to do roughly what you want is to pass the dictionary yourself:  >data EqDict a = EqDict {  >    leq :: a -> a -> Bool }  >  >data EqList a = EqList (EqDict a) [a]  >  >test :: EqList a -> EqList a -> Bool  >test (EqList dict (a0:as)) (EqList _ (b0:bs)) = (leq dict) a0 b0 This is

[Haskell-cafe] Instances of constrained datatypes

This is a contrived example, but contains the essence of what I'd like to do. Suppose I have this datatype: > data (Eq v) => EqList v = EqList [v] I'd like to make it an instance of Functor. However, fmap takes an arbitrary function of type a -> b. I need an Eq constraint on a and b. Is th

Re: [Haskell-cafe] Compiling GHC from CVS

Sorry if this is a duplicate... I fixed that problem, thanks. However, I now have another one: /tmp/ghc6277.s:54636:Fixup of 71208 too large for field width of 16 bits /tmp/ghc6277.s:54634:Fixup of 71216 too large for field width of 16 bits <> make[2]: *** [stage1/prelude/PrimOp.o] Error 1 make[

Re: [Haskell-cafe] Compiling GHC from CVS

Thanks, that worked. I had version 3.79. I'm now using version 3.80 from ftp.gnu.org. However, I've picked up a new error: /tmp/ghc6277.s:54636:Fixup of 71208 too large for field width of 16 bits /tmp/ghc6277.s:54634:Fixup of 71216 too large for field width of 16 bits <> make[2]: *** [stage1/pr

[Haskell-cafe] Compiling GHC from CVS

I'm having trouble compiling GHC from CVS. Make seems to be looping infinitely while compiling the stage1 compiler. Make -d gives me: Pruning file 'main/Config.hs' On and on and on. The commands I used to make (from the fptools) directory were: autoreconf ./configure --prefix=/Users/arjun/loc

RE: [Haskell-cafe] RE: Enum class

ype a, were not injective. However, that might be part of the specification... I don't remember. It should be fine, so long as the preimage of (fromEnum maxBound) is {maxBound}. -Arjun -- Arjun Guha <[EMAIL PROTECTED]> ___ Haskell-Cafe maili

[Haskell-cafe] RE: Enum class

then minBound > else succ v -- Arjun Guha <[EMAIL PROTECTED]> ___ Haskell-Cafe mailing list Haskell-Cafe@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe

[Haskell-cafe] Question regarding theis mailing list and Google Groups

Does anybody out there use Google Groups Beta to post to the `fa.haskell' group? I am directly subscribed to the email list, however I was trying some new things and it seemed like `fa.haskell' was vaguely related to the Haskell Café list. However, my post has not shown up on Haskell Café. D

Re: [Haskell-cafe] Type classes... popular for newbies, isn't it?

I'd rather not do that, but even if I did, the type-variable action would not be reachable in the terminal function. I could specify a functional dependency st -> action (though I've never used it, it would be a fun to learn). I'm curious as to why my class declaration compiles in GHC, as the

[Haskell-cafe] Type classes... popular for newbies, isn't it?

This class definition is giving me a lot of problems with the successor function: class (Ord st) => MinimaxState st where successors:: st -> [(action,st)] terminal:: st -> Bool A trivial example would be: instance MinimaxState Int where terminal i = i == 0 successors i = [(1,i+1), (-1,i-1

Re: [Haskell-cafe] Ambiguous type variable

Thanks for the tip, I solved to problem by making MinimaxState a subclass of Ord, thereby removing the utility method entirely. It makes far more sense this way as well. -Arjun ___ Haskell-Cafe mailing list [EMAIL PROTECTED] http://www.haskell.org/mai

[Haskell-cafe] Ambiguous type variable

Hi, I'm new to Haskell and am getting this error: AlphaBeta.hs:1: Ambiguous type variable `v' in the top-level constraint: `Ord v' arising from use of `maxValue' at AlphaBeta.hs:12 in the following code: module AlphaBeta where -- Game states are instances of MinimaxState class MinimaxSta