Clash: Haskell for FPGA Design: It's easy as 1-2-3...419,200
Please log in to watch this conference skillscast.
FPGAs can bring the versatility of custom chip design to the desktop of the hobbyist. But what does it look like to actually make something fun out of an FPGA, and how can Haskell help with that?
In this talk, we'll find out what an FPGA even is, and then learn just enough Clash to build, in full detail, a fully functioning Flappy Bird circuit. Turns out, all we need to do is count to 419,200 and the rest just follows!
YOU MAY ALSO LIKE:
Thank you to our sponsors and partners
Platinum
Gold
Silver
Bronze
Partners
Clash: Haskell for FPGA Design: It's easy as 1-2-3...419,200
Gergő Érdi
Gergő Érdi has extended GHC by adding pattern synonyms, used SMT solvers to analyze old text adventure games, and programmed AVR microcontrollers in Rust before it was cool. Lately, his chaotic interest turned to Clash, the Haskell to FPGA compiler. This led to him writing two things: the "Retrocomputing with Clash" book, and self-introductions in the third person.