Functional Fibonacci to a Fast FPGAEdwardsStephen A.authorColumbia University. Computer ScienceColumbia University. Computer ScienceoriginatorcontributortextTechnical reportsNew YorkDepartment of Computer Science, Columbia University2012Through 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 scienceColumbia University Computer Science Technical ReportsCUCS-010-12http://hdl.handle.net/10022/AC:P:14296EnglishNNCNNC2012-08-01 12:07:54 -04002012-08-02 16:15:32 -04008312eng