> So instead of writing one interpreter, we are going to write four, with increasing performance and complexity.
I went in the other direction, and wrote a BF interpreter of reduced complexity and performance in Haskell, that translates to less than 104 bytes of Binary Lambda Calculus [1].
> So instead of writing one interpreter, we are going to write four, with increasing performance and complexity.
I went in the other direction, and wrote a BF interpreter of reduced complexity and performance in Haskell, that translates to less than 104 bytes of Binary Lambda Calculus [1].
[1] https://gist.github.com/tromp/86b3184f852f65bfb814e3ab0987d8...