←back to thread

Anonymous recursive functions in Racket

(github.com)
88 points azhenley | 4 comments | 04 Sep 25 00:39 UTC | HN request time: 0.8s | source
Show context
userbinator ◴[06 Sep 25 21:07 UTC] No.45152834[source]▶
A relevant article to the domain name of this site.
replies(1): >>45153238 #
drivenextfunc ◴[06 Sep 25 21:56 UTC] No.45153238[source]▶
If you look at the code, you'll be (unpleasantly) surprised, I think. The author does not seem to have known what Y combinator is.
replies(6): >>45153365 #>>45153725 #>>45153889 #>>45153967 #>>45154096 #>>45154105 #
Philpax ◴[06 Sep 25 23:53 UTC] No.45153967[source]▶
https://en.wikipedia.org/wiki/Shriram_Krishnamurthi
replies(1): >>45154100 #
1. skrishnamurthi ◴[07 Sep 25 00:17 UTC] No.45154100[source]▶
Don't see Y-combinator mentioned anywhere on that page.
replies(1): >>45155381 #
2. adityaathalye ◴[07 Sep 25 04:23 UTC] No.45155381[source]▶
But I do see that page mentioned on Y Combinator's page.

The joke can go on forever...

replies(1): >>45155840 #
3. shawn_w ◴[07 Sep 25 06:18 UTC] No.45155840[source]▶
Somebody forgot to add a base case.
replies(1): >>45161588 #
4. adityaathalye ◴[07 Sep 25 19:56 UTC] No.45161588{3}[source]▶
No need... Shriram is already based.