Functional Fibonacci to a Fast FPGA Edwards Stephen A. author Columbia University. Computer Science Columbia University. Computer Science originator contributor text Technical reports New York Department of Computer Science, Columbia University 2012 Through a series of mechanical transformation, I show how a three-line recursive Haskell function (Fibonacci) can be translated into a hardware description language -- VHDL -- for efficient execution on an FPGA. The goal of this report is to lay the groundwork for a compiler that will perform these transformations automatically, hence the development is deliberately pedantic. Computer science Columbia University Computer Science Technical Reports CUCS-010-12 http://hdl.handle.net/10022/AC:P:14296 English NNC NNC 2012-08-01 12:07:54 -0400 2012-08-02 16:15:32 -0400 8312 eng