Get the latest tech news
Understanding the Y Combinator
combinator Table of Contents - 1. Quick introduction to lambda calculus - 2.
Lambda calculus(λ-calculus) is a mathematical system for computation based on function abstraction and application, using variable binding and substitution. There is also eta reduction(η-reduction), which expresses the idea of extensionality, which applied to this context establishes that two functions are the same if and only if they give the same result for all arguments. One of the most valuable things that SICP has taught me is that sometimes it’s extremely useful to treat functions as black boxes that are able to transform some inputs into some outputs.
Or read this on Hacker News
