Thanks, I don't see the footnote, but that works. :-)
On Mon, Nov 21, 2011 at 5:15 AM, Andres Löh wrote:
> Hi there.
>
> >I tried to follow the program of the paper "Scrap your boilerpolate"
> > Revolutions. Unfortunately,
> > I found the program in the section lifted spine view does not com
Hi, all
I tried to follow the program of the paper "Scrap your boilerpolate"
Revolutions. Unfortunately,
I found the program in the section lifted spine view does not compile in
my GHC, could anybody
point out where I am wrong? Many Thanks
My code is posted herehttp://hpaste.org/54357
___
Hi cafe,
I have played quite a bit with the ConstraintKinds extension, pretty
cool.
But I found a problem which I thought would be made better, plz correct
me if I am wrong
take a contrived example,
class C B => B a where
here B :: * -> Constraint, I think this definition
于 11-8-31 下午10:35, Ivan Lazar Miljenovic 写道:
May I ask though why you're trying to use (,) as an explicit
constructor in a quasi-quotation?
Thanks for your reply. I just generated some code
this way, and it does not work.
this style is common in applicative functor, right?
Best, bob
于 11-8-31 下午10:01, Ivan Lazar Miljenovic 写道:
On 1 September 2011 11:19, bob zhang wrote:
Hi, all
parseExp "(,) 3 4 " =>
Right (AppE (AppE (ConE GHC.Unit.(,)) (LitE (IntegerL 3))) (LitE
(IntegerL 4)))
where's GHC.Unit.(,) ?
GHC.Unit (like all GHC.* modules) is an internal
于 11-8-31 下午10:01, Ivan Lazar Miljenovic 写道:
On 1 September 2011 11:19, bob zhang wrote:
Hi, all
parseExp "(,) 3 4 " =>
Right (AppE (AppE (ConE GHC.Unit.(,)) (LitE (IntegerL 3))) (LitE
(IntegerL 4)))
where's GHC.Unit.(,) ?
GHC.Unit (like all GHC.* modules) is an internal
Hi, all
parseExp "(,) 3 4 " =>
Right (AppE (AppE (ConE GHC.Unit.(,)) (LitE (IntegerL 3))) (LitE
(IntegerL 4)))
where's GHC.Unit.(,) ?
Many thanks
best, bob
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://www.haskell.org/mailman/listinf
11-8-25 上午1:53, o...@okmij.org 写道:
> bob zhang wrote:
>> I thought the right type for ContT should be
>> newtype ContT m a = ContT {runContT :: forall r. (a-> m r) -> m r}
>> and
>> other control operators
>> shift :: Monad m => (forall r . (a-> C
Hi Jason, thanks for your reply.
I was curious that we could bring really continuations into haskell, the
traditional callCC brings a lot of unnecessary
type restrictions
On Wed, Aug 24, 2011 at 12:45 PM, Jason Dagit wrote:
> On Wed, Aug 24, 2011 at 9:19 AM, bob zhang wrote:
> >
Hi, all
I thought the right type for ContT should be
newtype ContT m a = ContT {runContT :: forall r. (a-> m r) -> m r}
and
other control operators
shift :: Monad m => (forall r . (a-> ContT m r) -> ContT m r) -> ContT m a
reset :: Monad m => ContT m a -> ContT m a
callCC :: ((a-> (forall r . ContT
于 11-8-23 下午11:37, Ivan Lazar Miljenovic 写道:
It might not be what_you_ want, but it might be what others want. If
you're concerned with efficiency, then wouldn't you use length rather
than genericLength?
length is identical to genericLength in ListLike except type signature.
but still,
import
August 2011 11:10, bob zhang wrote:
> > Hi, John, there is a space leak problem in ListLike typeclass,
> > in the method genericLength
> > calclen !accum cl =
> > calclen accum cl =
>
> I _think_ this may cause problems with some data types (e.g.
>
> http://hacka
Hi, John, there is a space leak problem in ListLike typeclass,
in the method genericLength
calclen !accum cl =
calclen accum cl =
--- thank you for your nice library
btw, is there any way to derive ListLike interface automatically?
for such type :
newtype List a = List {[a]}
Best,bob
_
Hi all,
I thought that Cont Monad is just equivalent to CPS Transformation, so
if I have
a monadic sum, if I run in Identity Monad, it will suck due to
stackoverflow, and if
I run it in Cont Monad, it will okay due to tail recursion. So I write a
simple program
to verify my idea. But to my sur
hi, all
testB :: (ArrowChoice t1, Num a1, Num a) => (a -> a1 -> t2) -> t1 a t3
-> t1 a1 t3 -> t1 (a, a1) t
testB f g h = proc (x,y) -> do
if (f x y)then g -< x + 1 else h -< y + 2
it's very strange that the type of _f_ is (a->a1->t2) which I thought
should be a -> a1 -> Bool,
btw, is there any wa
, Ivan Lazar Miljenovic 写道:
On 26 July 2011 04:30, bob zhang wrote:
Hi, all,
newtype Stream a = Stream [a]
I wanna derive ListLike [a] a automatically, but did not find a solution,
I tried
deriving instance ListLile (Stream a) a -- does not work
You can only derive certain in-built classes (Eq
Hi, all,
newtype Stream a = Stream [a]
I wanna derive ListLike [a] a automatically, but did not find a solution,
I tried
deriving instance ListLile (Stream a) a -- does not work
Thank you.
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://w
Thank your for kind help :-)
于 11-7-22 下午3:28, Edward Amsden 写道:
I did a survey of functional reactive programming, though there's no
reference to machine learning:
http://blog.edwardamsden.com/2011/05/survey-of-functional-reactive.html
On Fri, Jul 22, 2011 at 2:30 PM, bob zhang wrote
Hi all,
I am doing a survey on combining Functional Reactive Programming and
Machine Learning. Has anyone did relevant research on this topic?
Any discussion or link is appreciable.
Best,bob
___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
http://w
Hi,
thank you .
I read your souce, I found the depth is only 2, right?
like data A = [A]|String, any easy way to control the maximum_depth
of generated data?
Regards,bob
于 11-7-17 下午8:13, Ivan Lazar Miljenovic 写道:
On 17 July 2011 23:42, bob zhang wrote:
Hi, all,
I found derive
Hi, all,
I found derive + quickCheck very useful but I came across some problems.
I used derive to derive instance of Arbitrary immeditaely, but sometimes the
sample is non-terminating, which I mean the result is very very big.
I used
samples <- take 10 <$> sample' in ghci to test the result,
it's
21 matches
Mail list logo
