Skip to content

Latest commit

 

History

History
19 lines (13 loc) · 2.04 KB

README.md

File metadata and controls

19 lines (13 loc) · 2.04 KB

Talk: From Haskell to Hardware via CCCs

This talk describes my project at Tabula Inc for compiling Haskell to hardware.

Abstract:

For the last several years, speed improvements in computing come mainly from increasing parallelism. Imperative programming, however, makes parallelization very difficult due to the many possible dependencies implied by effects. For decades, pure functional programming has held the promise of parallel execution while retaining the very simple semantics that enables practical, rigorous reasoning. This talk describes a prototype compiler from Haskell (not a library) to low-level hardware descriptions for massively parallel execution on reprogrammable logic devices. The compiler works by monomorphizing, miscellaneous other transformations, and conversion to the vocabulary of cartesian closed categories (CCCs), as captured in a small collection of Haskell type classes. One instance of those classes provides an interpretation as parallel circuits. I will show many examples of simple Haskell programs and corresponding compiler-generated circuits.