Hacker News new | ask | show | jobs
by Black-Plaid 3317 days ago
It's strange that on the Kotlin side the author goes out of their way to show 'shorter' ways to do things that are also available in Swift but not illustrated.

    let sorted = [1, 3, 6].sorted()
    let sum = [1, 3. 6].reduce(0, +)
as examples
2 comments

There's a PR that fixes one of them which was filed on December 22 of last year... Yikes.
Why are you citing an FP comp Sci professor? I must've missed something
seeing reduce in swift made me think about the universality of fold, which is the paper linked.
Ah, was about to say that all goes back to lambda calculus by Church and could be found in Lisp probably around ~1958.
Actually I think there's a relation with exponentials and integral calculus. Or anything hyper-iteration related.