On 3/30/12 4:27 AM, Krzysztof Skrzętnicki wrote:
You mention benchmarking TChans: one particular problem with TChans and
Chans is that they are unbounded. If the producers outpace consumers it
soon ends with memory exhaustion.
If that's the case, then you should consider TBChan[1] which is a
The records discussion has been really complicated and confusing. But
I have a suggestion that should provide a great deal of power to
records, while being mostly[1] backwards-compatible with Haskell 2010.
Consider this example:
data A a = A{a:a, aa::a, aaa :: a - A (a - a)}
data B a =
Peter Minten wrote:
The updated document, which now lives at
http://www.haskell.org/haskellwiki/FRP_explanation_using_reactive-banana
contains a Making the example runnable section which shows how connect
the example with the outside world.
I have added a link from the reactive-banana project
On Sat, Mar 31, 2012 at 7:15 PM, Peter Minten peter.min...@orange.nl wrote:
On Fri, 2012-03-30 at 09:15 +0300, Michael Snoyman wrote:
First you state that we shouldn't use `union` for the `ePitch` Event,
and then you used it for `bOctave`. Would it be more efficient to
implement bOctave as
On Fri, 2012-03-30 at 02:30 +0200, Ertugrul Söylemez wrote:
Peter Minten peter.min...@orange.nl wrote:
I've been trying to get my head around Functional Reactive Programming
by writing a basic explanation of it, following the logic that
explaining something is the best way to understand
* Evan Laforge qdun...@gmail.com [2012-03-31 15:23:48-0700]
A while back I was complaining about the profusion of poorly
documented tags generators. Well, there is still a profusion of
poorly documented tags generators... I was able to find 5 of them.
So, that said, here's my contribution
Hi
I think I see now what the problem you observe is. It is not related with type
synonyms but with module scoping. Let me briefly discuss what hint is doing
behind the scenes and why, this may give a better understanding of what kind of
things will and will not work.
While hint is directly
Hi Gershom,
This sounds very interesting even if I have no idea what you are
talking about :)
Please create a proposal linked from this page:
http://hackage.haskell.org/trac/ghc/wiki/Records
The first thing you should probably do is explain the programmer's
point of view. That ensures that we are
Whoosh? :-)
On Sun, Apr 1, 2012 at 3:54 PM, Greg Weber g...@gregweber.info wrote:
Hi Gershom,
This sounds very interesting even if I have no idea what you are
talking about :)
Please create a proposal linked from this page:
http://hackage.haskell.org/trac/ghc/wiki/Records
The first thing
On 1 April 2012 00:23, Evan Laforge qdun...@gmail.com wrote:
Two of them use haskell-src which means they can't parse my code. Two
more use haskell-src-exts, which is slow and fragile, breaks on
partially edited source, and doesn't understand hsc.
For what it's worth:
* As you say below, HSC
Obviously Gregory is not familiar with Homotopy. In fact, its
isomorphism predicts that if someone named Greg is involved in a
discussion, someone named Gregory will also become involved.
Or that is what I get for responding to an e-mail without reading it
on April 1st :)
On Sun, Apr 1, 2012 at
I actually read the first couple paragraphs and thought “sounds
interesting I'll read it later”. After reading it properly, I lol'd.
After some initial feedback, I'm going to create a page for the
Homotopy Extensional Records Proposal (HERP) on trac. There are really
only a few remaining
By the way, I'm assuming that this library isn't an April Fools joke
by making a library called “fast” with explosive O(n²) time problems.
:-P
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Hello,
As we all know, the true measure of performance for a web server is
the classic PONG test. And, so the Happstack team is pleased to
announce the release of the new acme-http server!
hackage:
http://hackage.haskell.org/package/acme-http
source:
http://patch-tag.com/r/stepcut/acme-http
On Sun, Apr 1, 2012 at 8:46 PM, Jeremy Shaw jer...@n-heptane.com wrote:
Hello,
As we all know, the true measure of performance for a web server is
the classic PONG test. And, so the Happstack team is pleased to
announce the release of the new acme-http server!
hackage:
On Sun, Apr 1, 2012 at 12:48 PM, Michael Snoyman mich...@snoyman.com wrote:
That's awesome! I think you should pair this up with the /dev/null
datastore and then you'll be truly webscale!
Well, acid-state does have a backend that skips writing any
transaction logs to disk making it pure memory
There are currently several APIs for processing strict monoidal values
as if they were pieces of a larger, lazy value. Some of the most
popular are based on Oleg's left-fold enumerators, including the
iteratee, enumerator, iterIO. Other choices include comonads,
conduits, and pipes.
Despite
Chris: You might be experiencing this issue:
http://hackage.haskell.org/trac/ghc/ticket/5783
Upgrading text and recompiling fast-tags should take care of this problem.
-Levent.
On Sun, Apr 1, 2012 at 10:12 AM, Christopher Done
chrisd...@googlemail.com wrote:
By the way, I'm assuming that this
After asking this question:
http://stackoverflow.com/questions/9963050/standard-way-of-joining-two-data-texts-without-mappend
I found out that the new infix operator for `mappend` is (). I'm
wondering why ghc 7.4 didn't generalize (++) to work on monoids instead. To
me, (++) is much more clear.
There are many reasons, but some of the more cited ones are that () will
break less code than (++) would, since (++) is ubiquitous and () is most
used in some pretty printers. Yes, mappend's type can be refined to that of
the current list (++), but the increased polymorphism still has the
On Sun, Apr 1, 2012 at 1:58 PM, aditya bhargava
bluemangrou...@gmail.com wrote:
After asking this question:
http://stackoverflow.com/questions/9963050/standard-way-of-joining-two-data-texts-without-mappend
I found out that the new infix operator for `mappend` is (). I'm wondering
why ghc 7.4
Peter Minten peter.min...@orange.nl wrote:
Sorry, I don't understand this. Would it be correct to say that AFRP
shares the basic ideas of FRP in that it has behaviors and
events/signals and that the main difference comes from the way AFRP is
implemented?
Well, FRP is usually interpreted as
* haskell-src-exts is not slow. It can parse a 769 module codebase racking up
to 100k lines of code in just over a second on my machine. That's
good. Also, I don't think speed of the individual file matters, for
reasons I state below.
Wow, that's faster than my machine.
* Broken source
On Sun, Apr 1, 2012 at 3:27 AM, Roman Cheplyaka r...@ro-che.info wrote:
It's useful to mention the limitations of this package, so that people
know what to expect and don't spend their time testing it to understand
that it doesn't suit their needs.
Good point, I'll put the limitations and TODO
24 matches
Mail list logo
