Ben Gamari bgamari.foss at gmail.com Sun Jun 10 15:06:57 CEST 2012 Previous message: [Haskell-cafe] Lazy producing a list in the strict ST monad Next message: [Haskell-cafe] Haskell (GHC 7) on ARM Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] Joshua Poehls <joshua at poehls.me> writes: > Hello Ben, > Hello, Sorry for the latency. I'm currently on vacation in Germany so I haven't h
… In which I use genetic algorithms to search for optimal LLVM optimizer passes to make Haskell programs faster … On a sunny day last Spring, I spent some time playing with genetic algorithms (GAs) for breeding faster Haskell programs, by improving the inlining hints suggested to GHC. The results were pretty cool: the GA found new inlining settings for existing Language Benchmark Game programs — t
In this post we’ll play with GHC’s new LLVM code generator backend, and see how much faster some Haskell programs are when compiled with LLVM instead of GCC. For the kind of loops we get from stream fusion, the -fllvm backend produced a lot better code, up to 3x faster in some cases. There are pretty graphs, and some smoking hot new technology. Overview This week David Terei announced that his wor
The Glorious Glasgow Haskell Compiler.
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く