Is it just me, or does aligning [OSX,Win,Linux] `zip` [Comprehensive,
Robust, CuttingEdge] send the wrong message...
Yeah, I noticed that too when designing it, but at the time it didn't bother me
too much.
I do see how it could confuse some people though, so I've made a design
alternative
Here's my take on the new design:
Screenshot: http://imgur.com/9LHvk.jpg
Live version:
http://dl.dropbox.com/u/623671/haskell_platform_redesign/index.htm___
Haskell-Cafe mailing list
Haskell-Cafe@haskell.org
From: Christopher Done [chrisd...@googlemail.com]
Sent: 17 July 2010 19:23
To: Niemeijer, R.A.
Cc: haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] RE: Design for 2010.2.x series Haskell Platform
site (Don Stewart)
O, I like it! Nice one
Hello everyone,
In the last month or so, I've found myself using the following snippet a lot:
import Control.Parallel.Strategies
import Test.BenchPress
bench 1 . print . rnf
This snippet fully evaluates a value and prints how long it took to do so. I
regularly use it to see where the
Hello everyone.
Last night I uploaded my first Hackage library with documentation
(StrictBench). I learned that it takes somewhere between 2 and 8 hours for the
link to the documentation to become active. This is confusing for first-time
package authors (I went to #haskell to ask what I had
. Allbery KF8NH [mailto:allb...@ece.cmu.edu]
Sent: maandag 8 juni 2009 10:41
To: Brandon S. Allbery KF8NH
Cc: Niemeijer, R.A.; haskell-cafe@haskell.org
Subject: Re: [Haskell-cafe] Slow documentation generation on Hackage
On Jun 8, 2009, at 04:36 , Brandon S. Allbery KF8NH wrote:
On Jun 8, 2009
About two days ago the beta version of the Haskell Platform was released. Since
it comes with an OpenGL library, it is now trivially easy to start making
OpenGL programs with Haskell. To test this, I decided to make a simple Pong
clone for two reasons:
* To experiment with making an OpenGL
data EShow = forall a. Show a = EShow a
data E t = forall a. E (a-t) a
smallPrint_ t = concatMap (\f- f t) [show . foo, show . bar, show . baz]
Yeah, I am aware of these solutions, but like Dan says:
but first-class existentials are still desirable because introducing a new
type for
* Experimental language extensions, some of which have not been
implemented before.
Does anybody know if there are any plans to incorporate some of these
extensions into GHC - specifically the existential typing ?
I would love to be able to use existential typing without having to give up
...@gmail.com]
Sent: 19 April 2009 22:07
To: Niemeijer, R.A.
Cc: haskell-cafe@haskell.org
Subject: Re[2]: [Haskell-cafe] ANNOUNCE: Utrecht Haskell Compiler (UHC) --
first release
Hello R.A.,
Sunday, April 19, 2009, 11:46:53 PM, you wrote:
Does anybody know if there are any plans to incorporate some
Heinrich Apfelmus wrote:
+1 except that exporting the potentially infinite list of primes is
problematic in that it may become a memory leak.
I'd suggest to export two versions
primes :: [Integer]
primes' :: () - [Integer]
for casual (i.e. throwaway program to solve a Project Euler
Sebastian Fischer wrote:
I am pleased to announce the package 'primes' that implements lazy
wheel sieves for efficient, purely functional generation of prime
numbers in Haskell.
The implementation is reasonably efficient. The query
primes !! 100
15485867
answers after a few
Today I happened to need a large list of prime numbers. Obviously this is a
well-known problem, so I figured there would be something on Hackage that I
could use. Surprisingly, there isn't, or if there is it's not easy to find.
Searching for prime or primes on Hackage reveals nothing. Searching
Today I was very happy to discover the pointfree package, since lambdabot
unfortunately doesn't work on Windows. The package works just fine, but the
installation process is less than ideal. cabal install pointfree doesn't work
and to install it manually you have to add containers and array to
14 matches
Mail list logo
