On the paradigm of functional programming
summary
Claims that functionals as hardware are concrete cyclic dataflow graphs: boards of sockets and plugs that implement higher‑order types, with primitives apply, compose, copy, iteration and n‑times unfolding of composition. Tools are explicit graph constructions and a mapping to FPGAs/FPGAlike reconfigurable chips; CλaSH is noted but criticized for reducing terms to imperative HDL. Examples are schematic graphs and a papered design; no full silicon prototype appears, only a conceptual/FPGA‑feasible architecture.
AI-written summary · about
chapters (6)
- 0:00Concept of functionals
- 2:24Functional data flow graphs
- 6:47Hardware implementation
- 10:43Applying functionals
- 13:41Powerful functional framework
- 16:56Q&A on type representation
related talks
36mConcrete Functional Programming
58mKeynote: Why Functional Programming Matters
24mWhat could Functional Architecture mean?
49m“Applying functional programming in code design"
17mFunctional Architecture is Algebraic Architecture
57mThe Fun of Functional Programming Panel
30mFP²: Fully in-Place Functional Programming
44mFunctional Programming You Already Know