Church integer (original) (raw)
For example, in the programming language Haskell, a function that returns a particular Church integer might be
| church0 | =fx→x |
|---|---|
| churchn | =c |
| where:cfx=c′f(fx) | |
| where:c′=church(n-1) |
The transformation from a Church integer to an integer might be
Thus we can generate the integers–the (+1) function would be applied to an initial value of 0 n times, yielding the ordinary integer n.
| Title | Church integer |
|---|---|
| Canonical name | ChurchInteger |
| Date of creation | 2013-03-22 12:32:31 |
| Last modified on | 2013-03-22 12:32:31 |
| Owner | mathcam (2727) |
| Last modified by | mathcam (2727) |
| Numerical id | 8 |
| Author | mathcam (2727) |
| Entry type | Definition |
| Classification | msc 03B40 |
| Classification | msc 68N18 |
| Related topic | LambdaCalculus |