Edward Kmett will introduce his lens library, which provides a highly composable toolbox for accessing and modifying multiple parts of data structures.
From simple beginnings, starting with building blocks such as fmap and (.), we will build up combinators suitable for working with a wide array of data structures. These generalize the notions you already know how to use into a form that is easier to compose, and simultaneously allow them to be used for monomorphic containers such as Data.Text. All without compromising on your ability to reason about them using laws!
Once we've built up some foundations, we'll do a bit of a deep dive, exploring consequences of this design. We will discuss the efficient generic programming programming framework exported by lens, and type-safe Traversal-based zippers.
Familiarity with the Applicative and Traversable classes from the Haskell base libraries will be helpful (links provided below), but a basic understanding of the concepts will be introduced we go along. Attendees should expect to be gobsmacked with a newfound appreciation for the power of a little (or a lot of) abstraction.
Useful (but not mandatory) references: