https://web.archive.org/web/20210521023726/https://artyom.me/lens-over-tea-1
lens over tea 1
https://web.archive.org/web/20210521023726/https://artyom.me/lens-over-tea-1
Lenses: compositional data access and manipulation. | SkillsCast
9th October 2013 in London There are 6 other SkillsCasts available from Haskell eXchange 2013 Please log in to watch this conference skillscast. Haskell lets you write beautiful, modular code. Rather than waffle generally, I’ll use this talk to look at a particular example, Edward Kmett’s lovely lens library. Lenses have been called “jQuery for data types”: they give you a way to poke around in th
Program imperatively using Haskell lenses
Haskell gets a lot of flack because it has no built-in support for state and mutation. Consequently, if we want to bake a stateful apple pie in Haskell we must first create a whole universe of stateful operations. However, this principled approach has paid off and now Haskell programmers enjoy more elegant, concise, and powerful imperative code than you can find even in self-described imperative l
statusfailed - Haskell's strength: generalising with lenses
This post is about the strength function, Lenses, and strong functors. Specifically, it’s about how we can generalise strength using lenses to work on any product type, not just tuples. If you like, you can skip straight to the good bit where we derive a generalised strength. For our purposes, strength is a function which “everts” a tuple containing some functor, (a, f b), turning it inside out to
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Overview
