HackerTubewatch
Surprise me
Frame from Lenses, Folds, and Traversals Plays via YouTube's privacy-enhanced embed

Lenses, Folds, and Traversals

Edward Kmett
Talks
YouTube
3 HN users recommended this talk3 months2013–2014 score 3.5
Years with an HN recommendation, 2007–2026

HN calls it dense but mind-blowing, the go-to way to understand lenses through algebraic derivation.

Edward Kmett's talk to the NY Haskell User Group on the lens library, building from fmap and function composition up to lenses, folds and traversals. It shows how these composable combinators access and modify parts of data structures.

“I found this talk by edward kmett incredibly helpful[0].” (HN, 2014)

1 strong recommendations · 2 recommendations · Talks · advanced

3 Hacker News comments

From the HN archive; up to 20 kept per video, favoring different commenters. Recommendations first.

@mijoharas Nov 2014 Strongly recommends
on HN thread How I Start: Haskell
I found this talk by edward kmett incredibly helpful[0]. I kept rewatching parts of it bit by bit until I managed to absorb it all (there is a lot of information for a beginner) but I found it hugely helpful and mind-blowingly powerful. [0] [this video]
Dense but mind-blowing introduction to lenses and traversals
@jerf Jan 2013 Recommends
on HN thread Why is the C++ STL so heavily based on templates?
Read more
If you want to work in an environment where a lot of people are thinking like this routinely, instead of a few lone voices in a vast sea of otherwise uninterested people, the Haskell community is doing a lot of work in this area, and able to move much faster since it's so much easier in Haskell than C++ templates (which isn't really a criticism of C++ templates, a lot of their capabilities are accidental rather than intended). This is why the Haskell community talks so much about monoids and applicatives and semigroups and a variety of other interesting structures in that area (and no, I did not forget to say monad, that structure is actually uninteresting here because it is too powerful). I believe the Fortress language is also doing some work here. A sample of the interesting sort of algorithm work that you can do when you think this way: [link] Edit: See also the Typeclassopedia: [link] And if you're really interested and want to take it hardcore, Edward Kmett's video on his lens library walks through how you can derive it with this sort of logic: [this video]
Kmett derives the lens library through algebraic reasoning
@dllthomas Aug 2014 Recommends
on HN thread Letter to a Young Haskell Enthusiast
"The best forms of language advocacy probably involve showing the great things you've done with a language and forgetting about comparisons to the competition." Great things the parent has done with the language: [this video]
Showcase of great things done in Haskell

Video list and Hacker News comment labels from HackerTube (prompted by @karpathy), released under ODC-By 1.0, built on the open-index/hacker-news archive. Hacker News data is provided by Y Combinator; comments remain the work of their authors. Video titles, channel names and thumbnails belong to their creators and are shown via YouTube. HackerTube Watch is an unofficial edition. Data export of 2026-10-31.

Keyboard shortcuts

/
Search
j k
Next / previous video
r
Surprise me
l
Like (video page)
w
Watch later (video page)
?
This help
Esc
Close