After reading a recent post on Good Math, Bad Math concerning surreal numbers, I got to thinking about how to model these in Haskell. I came up with the following formulation: data Surreal = Zero | Plus Surreal | Minus Surreal … which also seems very similar to the usual construction for natural numbers: data [...]
Derivatives of Containers claims to look for the ‘container which is its own derivative’; in other words, a type analogue of ex. They arrive at (approximated in ASCII and the notation used in my previous post): T[X] = Forall(n : N) Xn / Autn This is a little much for me, since I don’t understand [...]
After reading Differention of Datastructures, I think I finally understand what is meant by “types as functions”, and immediately I can see one direction in which to go from what is presented there. If we take integration to be the logical inverse of differentiation (which is defined in the article as ‘removal of an element [...]
I’ve noticed that when reading rather deeply-nested functional code in Haskell, the process taking place in reading the code seems to resemble trying to decipher APL more than anything else. This seems to be because functions which operate over lists are easily concatenated (possibly using the $ operator), because they operate on lists in their [...]
