dons

177 ms·

691.
by dons 17y ago
Libraries have been the focus of the Haskell community for the past 2 years, there's now: * 1918 libraries for Haskell (according to http://hackage.haskell.org ) for comparison, there are 1420 Erlang libraries (according to http://proje
692.
ZuriHac this week. 70+ Haskell hackers converging to hack at Google in Zurich(haskell.org)
2 points by dons 17y ago|0 comments
693.
So you want to hack Haskell for the Google Summer of Code(donsbot.wordpress.com)
4 points by dons 17y ago|0 comments
694.
LLVM adds functionality to support GHC. GHC + LLVM full steam ahead(haskell.org)
3 points by dons 17y ago|0 comments
695.
by dons 17y ago
They're also precisely the foundations of different notions of computation -- what we mean by ';' in an imperative language. So if math is a hack, then yeah. http://portal.acm.org/citation.cfm?id=116984 Go read Moggi.
696.
Why pointfree style rocks: composition(shrughes.com)
3 points by dons 17y ago|0 comments
697.
Leksah: the Haskell IDE. V0.8 now available(leksah.org)
13 points by dons 17y ago|3 comments
698.
A (multicore) render farm in Haskell(partario.com)
27 points by dons 17y ago|0 comments
699.
by dons 17y ago
Should work for any native code compiler, if I'm reading this right, just have to stay within what can be validated. I think there's a very good chance of a GSoC project to modify Haskell/GHC's backend to work too: http://www.reddit.com/r/
700.
Stream fusion for Scala collections(jnordenberg.blogspot.com)
2 points by dons 17y ago|0 comments
701.
by dons 17y ago
In 10 years I've had maybe 5 bugs in Haskell caused by foreign language code mutating objects under the hood, and that breaking referential transparency guarantees in the Haskell code. I would not consider this "dangerous". It's a side cond
702.
Gloss: Painless 2D vector graphics, animations and simulations in Haskell(trac.haskell.org)
12 points by dons 17y ago|0 comments
703.
by dons 17y ago
Well, there's no reason not to have both optimizing, heavy-analysis compilers, and light, interactive REPLs. For the same language. Best of both worlds.
704.
Writing a Cocoa application in Haskell(tscheff.blogspot.com)
16 points by dons 17y ago|0 comments
705.
Use functional programming in the real world? Present at CUFP(cufp.org)
6 points by dons 17y ago|0 comments
706.
Google AI Contest: Literate version of the top scoring Haskell entry(jaspervdj.be)
40 points by dons 17y ago|10 comments
707.
How to write a really fast parser without going insane(serpentine.com)
29 points by dons 17y ago|11 comments
708.
by dons 17y ago
Indeed, turning sudoku into a SAT problem is how the Cryptol solution works (using the languages SAT checking tools) http://www.galois.com/blog/2009/03/18/solving-sudoku-using-c...
709.
Evolving Faster Haskell Programs (now with LLVM)(donsbot.wordpress.com)
63 points by dons 17y ago|4 comments
710.
by dons 17y ago
WIP, but frontpage on ycombinator. Good work! By the way, if you like this, feel free to subscribe to http://haskell.reddit.com/
711.
Actors are not a good concurrency model(pchiusano.blogspot.com)
17 points by dons 17y ago|6 comments
712.
by dons 17y ago
Seems reasonable. Null pointers are rumored to have cost billions in waste and failures. And they're trivial to fix with a little bit of static typing.
713.
Darcs 2.4: the latest and greatest in easy version control (darcs.net)
2 points by dons 17y ago|0 comments
714.
by dons 17y ago
Yes, you can of course use lists. I'm interested in getting the compiler to produce the best code it can, hence I use slightly different libs and flags and such.
715.
by dons 17y ago
No, you can add new syntax, via quasi quotes.
716.
by dons 17y ago
In a way. It's a subset of Haskell focused on array operations that optimize really really well. You can use these instead of list operations, basically, and getter performance in all sorts of ways.
717.
by dons 17y ago
I'm sorry I used a trivial example -- the point was to show how the assembly corresponded to the fused loop, which necessitated a simple example. And this is the internet, so everyone tries to find a closed form for everything. Which misses
718.
by dons 17y ago
It's pretty easy to work out where fusion is going to happen, since it happens compositionally. You compose fusible functions, and the (.) between them is syntactically where fusion occurs. GHC will tell you how many fusion sites were found
719.
by dons 17y ago
> Template Haskell is not equivalent Lisp's macros Well, Template Haskell is a compile time meta programming system based on quasi quotation and AST manipulation...
720.
Fusion makes functional programming fun(donsbot.wordpress.com)
37 points by dons 17y ago|41 comments

More ›