Regular

This post series provides an introduction to Haskell through a practical example. It assumes no prior use of the language or functional programming experience. A basic understanding of programming, knowledge of using the terminal in Linux, and knowing how to install the software is, however, expected.

It is yet another time for a post in my 100 days of Fibonacci challenge. Today I am containing myself a bit and provide a link between a concept in programming and its root in mathematics.

Haskell has a flexible type system. It actually is Turing complete given the right language extensions. This also means that we can do arbitrary computations, which we are going to exploit in this 10th day in my 100 days of Fibonacci challenge.

I looked at quite some different approaches to the Fibonacci function, and I start to wonder how the Fibonacci number develops with respect to its index. To look into this I want to make a 2D plot where the X-axis is the natural numbers and the Y-axis is the corresponding...

I have been of a couple of days over the Christmas and New Year. But now it is time to start my 100 days of Fibonacci project again.