Chapter Five
Okay, what are the most fundamental, non-bullshit mathematical notions for Functional Programming? Lambdas, Functions, Currying and Partial Application The algebraic notion of a Products and their representation as tuples an Ordered Sequence as a Universal shape Recursive/Nested data structures, especially a List and a Tree Recursive processes (of nested function calls) which arise naturally over recursive data structures. The Duality of an Initial Algebra and an Interpreter (being a Unique Homomorphism) It is not a random coincidence that arguments of a multi-argument function (before Currying) are tuples, not Lists (except in LISPs). ...