3 ms·

I'm still laughing over: 'The number zero is simply lambda(), and 1 is lambda(lambda()), 2 is lambda(lambda(lambda())), and so on. Every single Thing in this le

I'm still laughing over: 'The number zero is simply lambda(), and 1 is lambda(lambda()), 2 is lambda(lambda(lambda())), and so on. Every single Thing in this legendary region, be it noun, verb or otherwise, is constructed from the primal verb "lambda".'

qwerta 12y ago
Kind of similar how barbarians count in Terry Pratchett books. They only know three numbers: one, two and many. And counting is done like this: one, two, many, many one, many two, many many, many many one.....
- raghuiyer4882 12y ago
  Isn't it only trolls? Barbarians are too busy pillaging to count.
  - qwerta 12y ago
    Yes, trolls, you are right!
probably_wrong 12y ago
Yeah, well, I wasn't precisely laughing when I saw it on my Formal Languages and Computability course... Check Church numerals: https://en.wikipedia.org/wiki/Church_encoding https://en.wikipedia.org/wiki/Church_encoding
- bloke_zero 12y ago
  The reason I was laughing was because I could imagine it happening - know I know it's true I'm not sure how I feel about it.
  - jerf 12y ago
    It's a mathematical formalism for minimizing the number of distinct entities in minimalistic theories of numbers, and providing definitions of "number" that are as well-defined as possible, which turns out to be harder than it appears at first blush. In practice, it isn't generally directly used, except in places where proper facilities for using integers haven't yet been created (C++ templates at a certain point, some older Haskell type code before ints become promotable to the type level, etc). (And just to be clear, I'm not saying they've never been used in real code, but that it's a serious code smell to need to use them in real code. They get inefficient, fast; given that they're often showing up in type checking algorithms they can get inefficient superlinearly in their size.)
    - srean 12y ago
      I vaguely remember that church numerals (or was it some other encoding ?) have been used to minimize conditional jumps in code. If someone is familiar with how that works, would love to hear.

qwerta 12y ago

Kind of similar how barbarians count in Terry Pratchett books. They only know three numbers: one, two and many. And counting is done like this: one, two, many, many one, many two, many many, many many one.....

raghuiyer4882 12y ago
Isn't it only trolls? Barbarians are too busy pillaging to count.
- qwerta 12y ago
  Yes, trolls, you are right!

probably_wrong 12y ago

Yeah, well, I wasn't precisely laughing when I saw it on my Formal Languages and Computability course... Check Church numerals: https://en.wikipedia.org/wiki/Church_encoding https://en.wikipedia.org/wiki/Church_encoding

bloke_zero 12y ago
The reason I was laughing was because I could imagine it happening - know I know it's true I'm not sure how I feel about it.
- jerf 12y ago
  It's a mathematical formalism for minimizing the number of distinct entities in minimalistic theories of numbers, and providing definitions of "number" that are as well-defined as possible, which turns out to be harder than it appears at first blush. In practice, it isn't generally directly used, except in places where proper facilities for using integers haven't yet been created (C++ templates at a certain point, some older Haskell type code before ints become promotable to the type level, etc). (And just to be clear, I'm not saying they've never been used in real code, but that it's a serious code smell to need to use them in real code. They get inefficient, fast; given that they're often showing up in type checking algorithms they can get inefficient superlinearly in their size.)
  - srean 12y ago
    I vaguely remember that church numerals (or was it some other encoding ?) have been used to minimize conditional jumps in code. If someone is familiar with how that works, would love to hear.