News for hackers. Stuff that matters.
Re:History of Declarative Programming by black_knight on Monday December 15, 2025 @01:15AM (#46271014)
The idea of Church numerals is quite similar to induction. An induction proof extends a method of treating the zero case and the successor case, to a treatment of all naturals. Or one can see it as defining the naturals as the numbers reachable by this process. The leap to Church numerals is not too big from this.

There are no comments on this comment yet.