Good. That new .dll works, too.
Best Regards,
On Sat, 02 Dec 2006 16:13:01 +0900, Krasimir Angelov [EMAIL PROTECTED] wrote:
Sorry. I was sleeping and I uploaded it to darcs.haskell.org instead
to haskell.org. Try it now.
On 12/2/06, shelarcy [EMAIL PROTECTED] wrote:
On Sat, 02 Dec 2006
Huazhi (Hank) Gong wrote:
Hello,all
My intention is to generate 50 random coordinates like (x,y).
myrand :: Int
myrand = randomRIO(1::Int, 100)
rf=[(myrand, myrand) | a - [1..50]]
My short program is like this. However, GHCI say that the return type of
randomRIO is IO a while the
Hello,
I've been playing around with Dan Piponi's work on automatic
differentiation (from
http://sigfpe.blogspot.com/2005/07/automatic-differentiation.html and
http://sigfpe.blogspot.com/2006/09/practical-synthetic-differential.html)
and I'm getting some odd behavior with the inferred types of
Grady Lemoine wrote:
Hello,
I've been playing around with Dan Piponi's work on automatic
differentiation (from
http://sigfpe.blogspot.com/2005/07/automatic-differentiation.html and
http://sigfpe.blogspot.com/2006/09/practical-synthetic-differential.html)
and I'm getting some odd behavior
Grady Lemoine wrote:
f x = x^3
f' = snd . (evalDeriv f)
When I load this in GHCi, I get:
*Main :t f
f :: (Num a) = a - a
*Main :t snd . (evalDeriv f)
snd . (evalDeriv f) :: (Num a, Num (Dual a)) = a - a
*Main :t f'
f' :: Integer - Integer
Why is the type of f' Integer - Integer,
If you consider just Dags, I believe that this question is equivalent to
asking what set of combinators will allow you to create an arbitrary
composition of functions that allow sharing inputs and returning
multiple results. And I think that one answer to that is the set of
combinators that
apfelmus:
Duncan Coutts wrote:
On Wed, 2006-11-29 at 20:27 +0100, [EMAIL PROTECTED] wrote:
On the implementation level, lazy evaluation is in the way when
crunching bytes.
Something I rather enjoyed when hacking on the ByteString lib is finding
that actually lazy evaluation is
