This guide has tons of problems (just look at the comments). Please use my new version here: https://github.com/bluedragon1221/minlinux2 instead of this old buggy one!
https://www.youtube.com/watch?v=QlzoegSuIzg
To build a minimal linux distro, we need three parts:
In this article, I'll explain why implementing numbers with just algebraic datatypes is desirable. I'll then talk about common implementations of FFT (Fast Fourier Transform) and why they hide inherent inefficiencies. I'll then show how to implement integers and complex numbers with just algebraic datatypes, in a way that is extremely simple and elegant. I'll conclude by deriving a pure functional implementation of complex FFT with just datatypes, no floats.
