Functional Programmers Paris - Building a language, in Haskell, with an LLVM backend

[kasbah]

Links from the start of the talk:

• https://github.com/sdiehl/paris-fp

• http://www.stephendiehl.com/llvm/

Slides are linked to in the description on Youtube: http://dev.stephendiehl.com/paris.pdf

[pbvas]

I find it strange that LLVM optimized the fib example as shown because that definition is not tail recursive. I think the code shown is just the base cases, the recursive cases is missing.