Thank you Jason.
On Mon, Mar 5, 2012 at 1:05 PM, Jason Dagit dag...@gmail.com wrote:
I don't know if timeline has been established, but my understanding is
that there is a need for this and that the right people are aware of
it and looking into it.
The GHC trac has a ticket for this:
There is a possibility that the IHG might fund this during the next
cycle, which would mean that it would be in 7.6.1.
Cheers,
Simon
On 05/03/2012 07:35, Jason Dagit wrote:
I don't know if timeline has been established, but my understanding is
that there is a need for this and that
On Mon, Mar 5, 2012 at 2:54 PM, Simon Marlow marlo...@gmail.com wrote:
There is a possibility that the IHG might fund this during the next cycle,
which would mean that it would be in 7.6.1.
Cheers,
Simon
That is very good to hear!!!
Regards,
Kashyap
moved to haskell-cafe
On Mon, 5 Mar 2012, Barney Hilken wrote:
Is there any deep reason why I can't write a polymorphic type in a context? I
think the record update problem can be (sort of) solved if you could write:
class Has r Rev (forall a. [a] - [a]) = HRClass r where
Partially answering my own question - it seems like I want type
directed translation as per section 8 of Practical Type Inference
for Arbitrary Ranked Types.
Does anyone know of a presentation with a simpler type language?
Thanks again
Stephen
___
Hello.
I've also written simple chat server based on conduits and stm channels
https://github.com/qnikst/chat-server/blob/master/src/Main.hs
it has quite similar aproach and maybe this solution can be used together
to have better results.
--
Alexander Vershilov
Sat, Mar 03, 2012 at 02:05:17AM
On Mon, Mar 5, 2012 at 1:54 AM, t helfferich the...@hotmail.com wrote:
Hi!
So, it turns out I have a need for a sink that forks input into two other
sinks using the Conduit package. Here is what I came up
with: https://gist.github.com/1975383
Is this the right way to write it? Also, what
On 03/05/2012 04:58 PM, burak ekici wrote:
Dear List;
I have parallelized RSA decryption and encryption schemes
by using second generation strategies of Haskell p.l.
In that case, what I got in the sense of speed up was nearly
10 times of better performances (on a quad-core CPU with 8M cache)
Thanks. That makes sense.Grant
From: mich...@snoyman.com
Date: Mon, 5 Mar 2012 16:56:11 +0200
Subject: Re: [Haskell-cafe] Conduit Sink fork
To: the...@hotmail.com
CC: haskell-cafe@haskell.org
On Mon, Mar 5, 2012 at 1:54 AM, t helfferich the...@hotmail.com wrote:
Hi!
So, it turns out
Thanks. That makes sense.Grant
From: mich...@snoyman.com
Date: Mon, 5 Mar 2012 16:56:11 +0200
Subject: Re: [Haskell-cafe] Conduit Sink fork
To: the...@hotmail.com
CC: haskell-cafe@haskell.org
On Mon, Mar 5, 2012 at 1:54 AM, t helfferich the...@hotmail.com wrote:
Hi!
So, it turns out
Thanks. That makes sense.Grant
From: mich...@snoyman.com
Date: Mon, 5 Mar 2012 16:56:11 +0200
Subject: Re: [Haskell-cafe] Conduit Sink fork
To: the...@hotmail.com
CC: haskell-cafe@haskell.org
On Mon, Mar 5, 2012 at 1:54 AM, t helfferich the...@hotmail.com wrote:
Hi!
So, it turns out
Thanks. That makes sense.Grant
From: mich...@snoyman.com
Date: Mon, 5 Mar 2012 16:56:11 +0200
Subject: Re: [Haskell-cafe] Conduit Sink fork
To: the...@hotmail.com
CC: haskell-cafe@haskell.org
On Mon, Mar 5, 2012 at 1:54 AM, t helfferich the...@hotmail.com wrote:
Hi!
So, it turns
Sorry for the repeat postings. My machine freaked out
From: mich...@snoyman.com
Date: Mon, 5 Mar 2012 16:56:11 +0200
Subject: Re: [Haskell-cafe] Conduit Sink fork
To: the...@hotmail.com
CC: haskell-cafe@haskell.org
On Mon, Mar 5, 2012 at 1:54 AM, t helfferich the...@hotmail.com wrote:
Is there any way in Haskell to have the correct function selected
based on the types of two different types? For example, let's say I'm
writing intersection tests:
aABBandAABB :: AABB - AABB - Bool
oBBandOBB :: OBB - OBB - Bool
oBBandPoint :: OBB - Point - Bool
Is there some way (such as with
{-# LANGUAGE MultiParamTypeClasses #-}
class Intersectable a b where
intersectsWith :: a - b - Bool
--
Felipe.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinfo/haskell-cafe
Well look at that.
Thanks!
On Mon, Mar 5, 2012 at 4:07 PM, Felipe Almeida Lessa
felipe.le...@gmail.com wrote:
{-# LANGUAGE MultiParamTypeClasses #-}
class Intersectable a b where
intersectsWith :: a - b - Bool
--
Felipe.
___
Haskell-Cafe
I don't know what you want to do, but you may wrap the (forall a. [a] -
[a]) in an existential type:
data ListFunc = forall a. ListFunc ([a] - [a])
class Has r Rev ListFunc = HRClass r where
setHRClass :: ListFunc - r - r
Thanks Henning,
What we're wanting to do is set the Higher-ranked
On 3/5/12 4:24 PM, Clark Gaebel wrote:
Well look at that.
Thanks!
On Mon, Mar 5, 2012 at 4:07 PM, Felipe Almeida Lessa
felipe.le...@gmail.com wrote:
{-# LANGUAGE MultiParamTypeClasses #-}
class Intersectable a b where
intersectsWith :: a - b - Bool
Assuming that intersectsWith is
On 3/5/12 5:13 PM, AntC wrote:
I've tried that ListFunc wrapping you suggest:
[...]
But I can't 'dig out' the H-R function and apply it (not even
monomorphically):
That's because the suggestion changed it from a universal quantifier to
an existential quantifier.
data Exists f = forall
Wow, that's a lot of freedom in the type system. Haskell never fails
to amaze me how it can remove features and increase expressiveness in
one fell sweep.
I also like how the user will get type errors if attempting
intersection between two geometries which do not have intersection
defined. It
How do I add type annotations to interior locations in an abstract
syntax tree?
i.e. the type it [algorithm] infers is the type of the whole
program, I would also like the types of any internal let-rec
definitions so I can label my AST.
I had exactly the same problem: type
21 matches
Mail list logo
