Comments on: Smoking fast Haskell code using GHC’s new LLVM codegen

By: Getting GHC HEAD and LLVM working together – Ramblings of a math undergrad

Getting GHC HEAD and LLVM working together – Ramblings of a math undergrad — Tue, 11 Jan 2011 00:23:25 +0000

[...] dons’ two posts, I have seen many people on the haskell-cafe mailing-list and the haskell-related IRC channels [...]

By: Getting GHC HEAD and LLVM working together « Alp Mestanogullari's Blog

Getting GHC HEAD and LLVM working together « Alp Mestanogullari's Blog — Thu, 11 Mar 2010 00:14:25 +0000

[...] working together March 11, 2010 alpmestan Leave a comment Go to comments Since dons’ two posts, I have seen many people on the haskell-cafe mailing-list and the haskell-related IRC channels [...]

By: Haskell Compiler with LLVM backend « Code and Bugs

Haskell Compiler with LLVM backend « Code and Bugs — Sun, 07 Mar 2010 12:15:13 +0000

[...] now, we can write very fast code in Haskell using the LLVM backend. If you need a benchmark, see here an [...]

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:28 +0000

[...] and, most interestingly, a new LLVM code generator and optimizer backend to GHC [...]

By: Fusion makes functional programming fun! « Control.Monad.Writer

Fusion makes functional programming fun! « Control.Monad.Writer — Fri, 26 Feb 2010 17:41:14 +0000

[...] And again, with the LLVM backend to GHC: [...]

By: Modern Benchmarking in Haskell « Control.Monad.Writer

Modern Benchmarking in Haskell « Control.Monad.Writer — Tue, 23 Feb 2010 21:28:05 +0000

[...] In this talk I will present these tools, how to use them, and how to make your performance benchmarks in Haskell, or languages Haskell can talk to, more reliable. In addition, we’ll explore benchmarks using the new vector package, and GHC’s llvm backend. [...]

By: dons00

dons00 — Tue, 23 Feb 2010 21:18:36 +0000

Lists have a lazy spine, which means than can be used for control structures, even without fusion, so they’ll continue to have uses.

For storing actual data, I think I’ll probably use vector for anything with a performance concern.

By: marks

marks — Tue, 23 Feb 2010 19:59:48 +0000

Question from a Haskell novice:

If (boxed) vectors from the new vector package can handle Algorithmic Datatypes as well as offering improved performance, what, if any, is the remaining use of ordinary Haskell lists?

The only thing I can think of right now is that you wouldn’t have to import the Data.Vector package, but surely there’s some other remaining advantage?

By: Axman6

Axman6 — Tue, 23 Feb 2010 12:02:26 +0000

Any chance of a follow up with some comparisons to C compiled with GCC? I’m more interested how well we’re competing at the moment than how much better we’re doing (C gives a nice “damn we’re good, look at us!” baseline for when we’re faster than it :)).

By: Chris Kuklewicz

Chris Kuklewicz — Tue, 23 Feb 2010 07:50:14 +0000

I am hoping the LLVM backend will make a x86_64 backend on OS X easier to create. Does anyone know if it will have such an effect?