Here's how you can write a simpler (one-parameter) Y-combinator in Scala 3. The methods `y` and `recurse` would be defined in a library, then you would just call `recurse` when you want to recurse.pic.twitter.com/DLqYoO6QmU
Show this thread
-
Hi, Jon, here is some "category theory level" code that does recursion (folding (e.g. parsing), unfolding (e.g. interpreting) and combining them). The benefit: "effect-aware implementations", e.g. interacting with Unix file system (in its most general sense, e.g. sockets).pic.twitter.com/4ldm6VH6TP
I thought it was the most complex Scala code I'd ever seen until I realised that most of the "complexity" is just identifier names. And it's now a distant second. ;) The higher-kinded doubly-covariant type lambda is interesting... is everything working as it should in Scala 3?
-
-
I prefer to call them typeful names. In since with theorems for free.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.