Conal Elliott uses a reformulated interpretation of lambda calculus to transform Haskell programs into highly parallelized circuits. He gave this talk at Bayhac 2015. His approach allows him to structure parallel programming using a richer set of data structures than the usual array-based thinking. (slides) Summary We turn Haskell into a tree structure of operations and thence to Verilog The same
![From Haskell to Hardware](https://cdn-ak-scissors.b.st-hatena.com/image/square/cfbabcbadc27a2502a3bea59f896b6f9152f5aee/height=288;version=1;width=512/https%3A%2F%2Fi.vimeocdn.com%2Fvideo%2F524462436.jpg%3Fmw%3D700)