←back to thread

Anonymous recursive functions in Racket

(github.com)
88 points azhenley | 2 comments | 04 Sep 25 00:39 UTC | HN request time: 0.405s | 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 #
1. almostgotcaught ◴[06 Sep 25 23:36 UTC] No.45153889[source]▶
These are my favorite types of comments on hn
replies(1): >>45154696 #
2. neilv ◴[07 Sep 25 01:58 UTC] No.45154696[source]▶
The HN guidelines suggest assuming the strongest interpretation of what someone said, so obviously the commenter was making a joke. :)