Explore >> Select a destination
|
You are here 
|
deniskyashif.com | ||
| | | | |
sookocheff.com
|
|
| | | | | A lambda expression is said to be in normal form if it cannot be reduced any further, meaning that the expression no longer contains any function applications. More formally, a reducible expression is called a redex, and a lambda expression is in normal form when it contains no more redexes. Redex A reducible function expression. Normal Form A lambda expression that contains no redexes. Given a lambda expression, there are two primary strategies for reducing it to normal form: normal-order evaluation, or... | |
| | | | |
text.marvinborner.de
|
|
| | | | | This article describes a variadic extension to the default fixed-point combinator namely the Y-combinator. We do this by translating the Scheme code from a paper to bruijn (pure lambda calculus). | |
| | | | |
nithinbekal.com
|
|
| | | | | Nithin Bekal's blog about programming - Ruby, Rails, Vim, Elixir. | |
| | | | |
hadihariri.com
|
|
| | | |||
