|
You are here |
blog.sigfpe.com | ||
| | | | |
danilafe.com
|
|
| | | | | [AI summary] The blog post explains how to generalize Haskell's foldr function to any recursive data type using the concept of base functors and catamorphisms. | |
| | | | |
degoes.net
|
|
| | | | | Functional programming has a bit of jargon, but that doesn't have to stop you from understanding core concepts | |
| | | | |
matthew.brecknell.net
|
|
| | | | | [AI summary] This article explains a Haskell performance optimization trick using difference lists to convert quadratic-time list-building functions into linear-time operations by leveraging monoids and folds. | |
| | | | |
bartoszmilewski.com
|
|
| | | This is part 15 of Categories for Programmers. Previously: Representable Functors. See the Table of Contents. Most constructions in category theory are generalizations of results from other more specific areas of mathematics. Things like products, coproducts, monoids, exponentials, etc., have been known long before category theory. They might have been known under different names in... | ||