Funarg problem: Difference between revisions

Revision as of 11:13, 29 May 2021

Revision as of 15:37, 10 July 2021

Line 17:

===Example===

The following [[Haskell (programming language)|Haskell]]-inspiredlike [[pseudocode]] defines [[Function_composition_(computer_science)|function composition]]:

compose f g = λx → f (g x)

<code>[[Lambda calculus|λ]]</code> is the operator for constructing a new function, which in this case has one argument, <code>x</code>, and returns the result of first applying <code>g</code> to <code>x</code>, then applying <code>f</code> to that. This λ function carries the functions <code>f</code> and <code>g</code> (or pointers to them) as internal state.