Talk:Church numerals: Difference between revisions
Content added Content deleted
| Line 11: | Line 11: | ||
Disclaimer: this all feels a bit silly to me, but the intention (I am no expert on this lambda stuff) is that it shows how "closures" (or whatever) can be simulated quite easily with routine_ids and data. |
Disclaimer: this all feels a bit silly to me, but the intention (I am no expert on this lambda stuff) is that it shows how "closures" (or whatever) can be simulated quite easily with routine_ids and data. |
||
[[User:Petelomax|Petelomax]] ([[User talk:Petelomax|talk]]) |
[[User:Petelomax|Petelomax]] ([[User talk:Petelomax|talk]]) |
||
: :-) It could certainly seem like a laborious route to integer arithmetic, but Peano numbers and Church encoding have an interest of their own in the history of computing theory (and even in the implementation of Smalltalk). In the Rosetta context, they can reveal the different routes which each language takes to manipulating higher-order functions. |
|||
: (I moved your comment here – given the essentially anonymous/collective character of contributions, the talk page seems the more natural home for it) [[User:Hout|Hout]] ([[User talk:Hout|talk]]) 17:39, 13 September 2018 (UTC) |
|||