3 ms·

It would help if it was clear what tokens are part of the language or standard library, and what tokens are implementation of this algorithm (as in, some syntax

• mrkeen 3y ago
  I think it this case everything is defined in the article, except for List, which is either an empty list [] or a non-empty list x:xs Anything lowercase is a function/variable, and will appear somewhere on the left-hand-side of an equals. Anything uppercase is a Type/constructor. In this case I think they've only used a Tree, which they defined themselves (either a Nil or a Node). any and scanl would typically be imports, but they've defined these in full. They also defined init themselves unrelated to the one in the stdlib.