サクサク読めて、アプリ限定の機能も多数!
トップへ戻る
TGS2024
blog.sumtypeofway.com
2020-04-14 I’ve been writing Haskell in industry for the last eight years, at four different employers. I’ve been a full-time Haskell programmer since 2014. Though I never anticipated this turn of events, I’m certainly not complaining: I truly like writing Haskell, and I’m experienced enough in it to write at or exceeding the speeds at which I can write in the imperative languages I used before Ha
Recursion Schemes, Part 4½: Better Living Through Base Functors 2018-01-24 In an effort to publish more than one blog post a year, I’ve decided to write about smaller topics. Today I’m going to talk about the notion of a ‘base functor’, and how the popular recursion-schemes library uses base functors to make recursion schemes more elegant and ergonomic in practice. Repeating Ourselves Throughout t
2015-08-25 On the last episode of this very-infrequently-updated analysis of Programming with Bananas, Lenses, Envelopes, and Barbed Wire, we took a look at how to represent and traverse nested structures. This time, we’ll start getting into the meat of the paperBy “meat of the paper”, I mean “the first two pages”. Have patience. . We’ll define four simple recursion schemes, explore how they relat
2014-02-15 In 1991, Erik Meijer, Maarten Fokkinga, and Ross Paterson published their now-classic paper Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire. Though this paper isn’t widely known outside of the functional programming community, its contributions are astonishing: the authors use category theory to express a set of simple, composable combinators, called recursion sch
このページを最初にブックマークしてみませんか?
『adventures in uncertainty: Home』の新着エントリーを見る
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く