adambard/learnxinyminutes-docs
1
1
Fork 0
mirror of https://github.com/adambard/learnxinyminutes-docs.git synced 2024-11-27 04:44:08 +03:00
Code Issues Projects Releases Wiki Activity

Merge pull request #3271 from chriszimmerman/GH-3114-lambda-calculus-associativity

Browse Source 
[Lambda Calculus/en] - Closes #3114 - Fixes lambda calculus evaluation formula by fixing associativity
This commit is contained in:
Divay Prakash 2018-10-09 20:22:51 +05:30 committed by GitHub
commit ed67bee58d
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
lambda-calculus.html.markdown
View File

@ -55,7 +55,7 @@ Although lambda calculus traditionally supports only single parameter
functions, we can create multi-parameter functions using a technique called
[currying](https://en.wikipedia.org/wiki/Currying).
- `(λx.λy.λz.xyz)` is equivalent to `f(x, y, z) = x(y(z))`
- `(λx.λy.λz.xyz)` is equivalent to `f(x, y, z) = ((x y) z)`
Sometimes `λxy.<body>` is used interchangeably with: `λx.λy.<body>`
@ -87,7 +87,7 @@ Using `IF`, we can define the basic boolean logic operators:
`a NOT b` is equivalent to: `λa.IF a F T`
*Note: `IF a b c` is essentially saying: `IF(a(b(c)))`*
*Note: `IF a b c` is essentially saying: `IF((a b) c)`*
## Numbers: