why yes, I am doing data61 fp-course
Prikaži ovu nit
Intuition for `foldr` as "constructor replacement" is very helpful! Given a list: 1 : 2 : 3 : [] foldr "replaces" the cons constructor (:) with a function: 1 `f` 2 `f` 3 `f` [] e.g. foldr (*) 1 (1 : 2 : 3 : []) replaces : with *, and [] with 1 == 1 * 2 * 3 * 1 == 6
-
-
-
Seriously, go watch Tony explain everything you ever wanted to know about list folds (left and right), their differences, and inner workings.https://twitter.com/hmemcpy/status/1156063094793261057 …
Prikaži ovu nit
Kraj razgovora
Novi razgovor -
-
-
ok damn, this makes "append two lists with foldr" incredibly easy to understand! append list1 list2 = foldr (:) list2 list1pic.twitter.com/2FjZKpWmxx
Prikaži ovu nitHvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi
-
-
-
Definitely helped me out with Brian Mckenna was explaining this on his stream.
-
Yep :) That's where I got it from :D
- Još 7 drugih odgovora
Novi razgovor -
-
-
Can’t help but plug my own talk https://youtu.be/rdEFiMNxr0I (aka “you could’ve invented folds”)
-
Cheers! I remember watching it a while ago :)
Kraj razgovora
Novi razgovor -
-
-
Foldr is fold, foldl in an abomination... (not really, but is actually the fold of the “snoc” list)
-
foldl is so much easier to understand though
- Još 3 druga odgovora
Novi razgovor -
-
-
This is what
@headinthebox drilled into my head with his edX Haskell course. Homomorphism over lists! Unforgettable words
Hvala. Twitter će to iskoristiti za poboljšanje vaše vremenske crte. PoništiPoništi
-
Čini se da učitavanje traje već neko vrijeme.
Twitter je možda preopterećen ili ima kratkotrajnih poteškoća u radu. Pokušajte ponovno ili potražite dodatne informacije u odjeljku Status Twittera.