Two Haskell Talks (by Michał and Laurence)

CλaSH - using Haskell as FPGA programming language:

Many have asked the question of performance limits of Haskell. Current developments have proved that language perfect for rigorous mathematical reasoning may also be used for high-performance computing with parsers that are faster than C or Java parsers (hPDB), DSLs that allow to implement matrix operations using GPUs (accelerate-openCL), or SIMD operations on parallel multicore CPUs (repa). Even shorter response times may be achieved by implementing functions within Field Programmable Logic Arrays. I will tell about the current state of hardware design, and CλaSH - a new attempt to use modern Haskell as a medium for programming of hardware programming.

The Modular Compilation of Effects:

Compilers are traditionally factorised into a number of separate phases, such as parsing, type checking, code generation, et cetera. However, there is another potential axis of factorisation that has received comparatively little attention: the treatment of separate language features, such as mutable state, exceptions, function abstraction and conditionals. In this talk, I will show how we can address the issue of constructing compilers that are modular in the computational features supported by the source language. This approach builds upon both the datatypes `a la carte technique for extensible datatypes and the monad transformer approach to modular monadic semantics in novel ways.

# Speakers:

Michał: https://github.com/mgajda

Laurence: http://uk.linkedin.com/in/laurenceday/en

Note: change of venue, since there are more than 20 Ingenious Haskellers coming.