Reasonability
Clojure really begins to take a shape we would recognize in the American Journal of Mathematics. Alonzo Church published An Unsolvable Problem of Elementary Number Theory [Chu36],[74] establishing the principles of the untyped lambda calculus.
The lambda calculus or (λ-calculus) is a formal system for representing computational structures as functions with variables bound to inputs and substituted when the function is evaluated.
The lambda calculus provides a formal notation for functions, including recursive and anonymous functions. In the text, functions were considered first-order objects, and higher-order functions—functions that return functions as output—are described. These concepts are fundamental to Clojure and other ...
Get Clojure Applied now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
