Recursion, with apologies to David Hume

If we take into our hand any volume; of divinity or school metaphysics, for instance; let us ask, Does it illustrate recursive functions by means of either the Fibonacci series or factorials? Yes. Consign it then to the flames: For it can contain nothing but sophistry and illusion.

(I’ve been teaching myself Haskell.)

Named parameters

Once you start using named parameters, you have to use them everywhere.

Sometimes I get lazy and ignore this rule. It’s only a test script, I tell myself. Don’t slow things down. In doing this I am forgetting that the part of my brain which used to be responsible for remembering the order in which parameters are passed in to functions died several years ago from neglect, and that I can’t rely on it to help me anymore, and that I will get the parameter order wrong and waste even more time.

It’s buried next to the part of my brain which used to remember the names of “string” functions in C.