Comments on: Evolving faster Haskell programs

By: Cain

Cain — Mon, 06 Jun 2011 16:32:24 +0000

Since this post is still referenced occasionally, I’ll note here that while the original links for Acovea are broken, the source and documentation are still available via the Internet Archive at http://web.archive.org/web/20090305090634/http://coyotegulch.com/products/acovea/

By: Incremental optimizations | Functional Kansans

Incremental optimizations | Functional Kansans — Sun, 05 Jun 2011 04:54:11 +0000

[...] flags (or, less likely, different RTS flags) we haven’t considered. We sought out the tool Don Stewart used, Avocea, but could not find anything but broken [...]

By: Trying some datatypes on for time (+ a few algorithmic variations) | Functional Kansans

Mon, 23 May 2011 20:05:28 +0000

[...] regarding inlining List.find or Seq Char’s slow folds). Unfortunately, we can’t even find Acovea on the Internets and aren’t otherwise familiar with the multitude of GHC flags. … [...]

By: ghc-gc-tune: Tuning Haskell GC settings for fun and profit « Control.Monad.Writer

Tue, 06 Jul 2010 00:43:51 +0000

[...] had good success exploring multi-variable spaces for optimizations with GAs in Haskell, to find strictness flags and LLVM flag settings, so I was keen to see what the GC space looked like. In this initial GC [...]

By: roy_hu

roy_hu — Mon, 15 Mar 2010 09:33:30 +0000

Did you put in the inline hints by hand? Why did you put in a hint for the cursor function in the first place?

By: Evolving Faster Haskell Programs (now with LLVM!) « Control.Monad.Writer

Evolving Faster Haskell Programs (now with LLVM!) « Control.Monad.Writer — Mon, 01 Mar 2010 07:55:22 +0000

[...] 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 — that had already been heavily scrutinized — improving both programs I tried, and in one case, by 18%. [...]

By: Self-optimizing data structures: using types to make lists faster « Control.Monad.Writer

Sun, 11 Oct 2009 22:38:36 +0000

[...] series on high-performance Haskell programming. Related posts include stream fusion for lists, programming the inliner, Judy arrays and Haskell and applying stream fusion to [...]

By: links for 2009-07-12 « Blarney Fellow

links for 2009-07-12 « Blarney Fellow — Mon, 13 Jul 2009 01:08:12 +0000

[...] Evolving faster Haskell programs « Control.Monad.Writer (tags: evolution optimization compilers) [...]

By: Itkovian

Itkovian — Wed, 18 Mar 2009 08:25:36 +0000

@John I don’t know if that’s really a good idea. like @bd_ said, if you remove stuff and you want to run a new app, you need to do the analysis over again.

By: Top Posts « WordPress.com

Top Posts « WordPress.com — Wed, 11 Mar 2009 00:10:44 +0000

[...] Evolving faster Haskell programs This post is about using a genetic algorithm (GA) search technique to search for faster Haskell programs. We’ll [...] [...]