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 = B
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
b
On Sat, Mar 31, 2012 at 5:11 PM, dag.odenh...@gmail.com
wrote:
> On 1 April 2012 00:23, Evan Laforge wrote:
>>
>> So, that said, here's my contribution to the problem: fast-tags,
>> haskell tag generator #6.
>
> I like that it doesn't give duplicate entries for type signatures and
> bindings. I'd
On 1 April 2012 00:23, Evan Laforge wrote:
> So, that said, here's my contribution to the problem: fast-tags,
> haskell tag generator #6.
>
I like that it doesn't give duplicate entries for type signatures and
bindings. I'd like an option to recurse a directory, but i guess find+xargs
will do. E
* TP [2012-04-01 00:29:15+0200]
> I am wondering if there is any means to get "f 3 5" instead of "8" in the
> output of this program.
No, this is not possible by referential transparency. The output of your
function can't depend on whether it is passed 8 or the result of f 3 5.
In Lisp-like lan
Hi,
I don't known the advanced features and extensions of GHC at all.
Look at the following program:
f :: Integer -> Integer -> IO Integer
f a b = do
print $ "first argument=" ++ (show a)
print $ "second argument=" ++ (show b)
print $ a+b
return (a+b)
main = do
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 to the problem: fast-tags,
haskell tag generator #6.
Why not use o
I just uploaded a new version to hackage. This improves the
heuristics for guessing the right module quite a bit, and adds a local
config file where you can prioritize or de-prioritize packages or
module prefixes. It's also a bit faster.
>From the hackage description:
A small standalone program
Hi Daniel, cafe,
On 31/03/12 17:47, Daniel Gorín wrote:
Could you provide a short example of the code you'd like to write but gives you
problems? I'm not able to infer it from your workaround alone...
This problem originally came up on #haskell, where Rc43 had a problem
making a library with
Hi all,
What's the recommended way to get hint[0] to play nice with type
synonyms[1]?
A problem occurs with in scope type synonyms involving types not in scope.
I came up with this after looking at the source[2], but it makes me feel
ill:
--8<--
-- hint and type synonyms don't play nice
mo
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 someting like:
>
> eOctave :: Event t (Int -> Int)
> eOctave =
>
On Wed, Mar 28, 2012 at 01:34:29AM +0100, Alberto G. Corona wrote:
> In my package MFlow [1] I program an entire web navigation in a
> single procedure. That happened in the good-old WASH web application
> framework.
> The problem is the back button in the Browser.
> To go back in the code to th
John> 0.8.1 is almost due to be put out, it will be the first to be 100%
John> haskell 2010 (and haskell 98) compliant and has a lot of other neat
John> features over 0.8.0.
That's great ! I can't wait to put it into my toolbox. Haskell compilers
are all pieces of art, bringing beauty to our daily
13 matches
Mail list logo
