56,966 blogs · [ { "id": "01a0e34d-c385-7001-b874-94beb8016289", "title": "A Quick Introduction To Haskell", "url": "https://comonad.com/reader/talks/youtube-IAYNk951_xk/", "published_at": "2014-04-16T12:00:00+00:00" }, { "id": "01a0e34d-c385-7001-b874-94beb82cb6c8", "title": "Catamorphisms", "url": "https://comonad.com/reader/2014/recursion-schemes-catamorphisms/", "published_at": "2014-04-15T12:00:00+00:00" }, { "id": "01a0e34d-c385-7001-b874-94beb9945576", "title": "PHOAS For Free", "url": "https://comonad.com/reader/2013/phoas/", "published_at": "2013-12-09T12:00:00+00:00" }, { "id": "01a0e34d-c385-7001-b874-94beba231cce", "title": "Cache-Oblivious Data Structures — Part I: Deamortized ST", "url": "https://comonad.com/reader/2013/oblivious-deamortized-st/", "published_at": "2013-11-08T12:00:00+00:00" }, { "id": "01a0e34d-c385-7001-b874-94beba9c2912", "title": "Procrustean Mathematics", "url": "https://comonad.com/reader/2013/editorial-procrustean-mathematics/", "published_at": "2013-11-08T12:00:00+00:00" }, { "id": "01a0e34d-c385-7001-b874-94bebadfbfee", "title": "Cache-Oblivious Maps", "url": "https://comonad.com/reader/talks/kmett-2013-cache-oblivious-maps/", "published_at": "2013-10-18T12:00:00+00:00" }, { "id": "01a0e34d-c385-7001-b874-94bebb8d4920", "title": "Functional Reporting", "url": "https://comonad.com/reader/talks/kmett-2013-functional-reporting/", "published_at": "2013-09-22T12:00:00+00:00" }, { "id": "01a0e34d-c385-7001-b874-94bebbea061d", "title": "Cellular Automata — Part III: A World in a Bottle", "url": "https://comonad.com/reader/2013/cellular-automata-part-3/", "published_at": "2013-09-15T12:00:00+00:00" }, { "id": "01a0e34d-c385-7001-b874-94bebc545314", "title": "Conquering Folds", "url": "https://comonad.com/reader/2013/conquering-folds/", "published_at": "2013-09-13T12:00:00+00:00" }, { "id": "01a0e34d-c385-7001-b874-94bebcef3a99", "title": "Parallel and Incremental CRCs", "url": "https://comonad.com/reader/2013/parallel-crc/", "published_at": "2013-09-11T12:00:00+00:00" }, { "id": "01a0e34d-c385-7001-b874-94bebd8008ad", "title": "Once", "url": "https://comonad.com/reader/2013/snippets-once/", "published_at": "2013-09-03T12:00:00+00:00" }, { "id": "01a0e34d-c385-7001-b874-94bebe217839", "title": "Mandelbrot", "url": "https://comonad.com/reader/2013/snippets-mandelbrot/", "published_at": "2013-09-02T12:00:00+00:00" }, { "id": "01a0e34d-c385-7001-b874-94bebeab4330", "title": "Cellular Automata — Part II: PNGs and Moore", "url": "https://comonad.com/reader/2015/cellular-automata-part-2/", "published_at": "2013-09-01T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95dc89e513", "title": "Episode 1 — On Lenses", "url": "https://comonad.com/reader/talks/kmett-2013-haskellcast-lenses/", "published_at": "2013-08-26T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95dd209c11", "title": "Revisiting Matrix Multiplication — Part VI: A Most Significant Comparison", "url": "https://comonad.com/reader/2013/revisiting-matrix-multiplication-part-6/", "published_at": "2013-08-25T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95dd64808d", "title": "Revisiting Matrix Multiplication — Part IV: IntMap!?", "url": "https://comonad.com/reader/2013/revisiting-matrix-multiplication-part-4/", "published_at": "2013-08-25T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95ddeac428", "title": "Revisiting Matrix Multiplication — Part III: Extending Vector", "url": "https://comonad.com/reader/2013/revisiting-matrix-multiplication-part-3/", "published_at": "2013-08-25T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95de7acd0d", "title": "Revisiting Matrix Multiplication — Part II: The Zen of Z-Ordering", "url": "https://comonad.com/reader/2013/revisiting-matrix-multiplication-part-2/", "published_at": "2013-08-25T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95df2b7248", "title": "Revisiting Matrix Multiplication — Part I: Bit Shuffling with Lenses and Isomorphisms", "url": "https://comonad.com/reader/2013/revisiting-matrix-multiplication-part-1/", "published_at": "2013-08-25T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95dfa94963", "title": "Cellular Automata — Part I: From Theory to Pretty Pictures", "url": "https://comonad.com/reader/2014/cellular-automata-part-1/", "published_at": "2013-08-15T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e00fc172", "title": "Representing Applicatives", "url": "https://comonad.com/reader/2013/representing-applicatives/", "published_at": "2013-05-02T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e07eae9f", "title": "Japanese “ekmett” Workshop (Part 1 of 2)", "url": "https://comonad.com/reader/2013/japanese-workshop-1/", "published_at": "2013-04-01T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e0c43054", "title": "Algebras of Applicatives", "url": "https://comonad.com/reader/2013/algebras-of-applicatives/", "published_at": "2013-01-11T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e100e5ea", "title": "Abstracting with Applicatives", "url": "https://comonad.com/reader/2012/abstracting-with-applicatives/", "published_at": "2012-12-26T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e1ab6279", "title": "Lenses, Folds and Traversals", "url": "https://comonad.com/reader/talks/kmett-2012-lenses-nyc/", "published_at": "2012-12-12T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e2438307", "title": "Natural Deduction, Sequent Calculus and Type Classes", "url": "https://comonad.com/reader/2012/natural-deduction-sequent-calculus-and-type-classes/", "published_at": "2012-12-07T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e2d9eaa1", "title": "Unnatural Transformations and Quantifiers", "url": "https://comonad.com/reader/2012/unnatural-transformations-and-quantifiers/", "published_at": "2012-09-22T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e3468834", "title": "Working around Hackage Outages", "url": "https://comonad.com/reader/2012/hackage-mirror/", "published_at": "2012-08-29T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e3aca3a4", "title": "Making de Bruijn Succ Less", "url": "https://comonad.com/reader/talks/bound-slides-2012/", "published_at": "2012-07-26T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e418e9b7", "title": "Mirrored Lenses", "url": "https://comonad.com/reader/2012/mirrored-lenses/", "published_at": "2012-06-24T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e454e310", "title": "Where’s Waldo?", "url": "https://comonad.com/reader/2012/wheres-waldo/", "published_at": "2012-06-10T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e4f815b3", "title": "Purely Functional Data Structures for On-Line LCA", "url": "https://comonad.com/reader/talks/kmett-2012-online-lca/", "published_at": "2012-05-31T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e56ca37a", "title": "Catamorphism Knol", "url": "https://comonad.com/reader/2012/catamorphism-knol/", "published_at": "2012-05-27T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e59aec30", "title": "Wadler’s Law Revisited", "url": "https://comonad.com/reader/2012/wadlers-law-revisited/", "published_at": "2012-04-02T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e63f921e", "title": "Searching Infinity Parametrically", "url": "https://comonad.com/reader/2011/searching-infinity/", "published_at": "2011-12-25T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e6721870", "title": "What Constraints Entail: Part 2", "url": "https://comonad.com/reader/2011/what-constraints-entail-part-2/", "published_at": "2011-11-03T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e6e03861", "title": "What Constraints Entail: Part 1", "url": "https://comonad.com/reader/2011/what-constraints-entail-part-1/", "published_at": "2011-11-03T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e765b7aa", "title": "Homotopy and Directed Type Theory Slides", "url": "https://comonad.com/reader/2011/homotopy-and-directed-type-theory-slides/", "published_at": "2011-10-27T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e7e1ec97", "title": "Hac Boston!", "url": "https://comonad.com/reader/2011/hac-boston/", "published_at": "2011-10-25T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e8ae0635", "title": "A Parsec Full of Rats, Part 2", "url": "https://comonad.com/reader/2011/a-parsec-full-of-rats-part-2/", "published_at": "2011-09-23T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e8e129dc", "title": "A Parsec Full of Rats, Part 1", "url": "https://comonad.com/reader/2011/a-parsec-full-of-rats/", "published_at": "2011-09-23T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95e9874563", "title": "Free Modules and Functional Linear Functionals", "url": "https://comonad.com/reader/2011/free-modules-and-functional-linear-functionals/", "published_at": "2011-07-11T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95ea7e95f8", "title": "A Product of an Imperfect Union", "url": "https://comonad.com/reader/2011/a-product-of-an-imperfect-union/", "published_at": "2011-06-30T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95eb6dc691", "title": "More on Comonads as Monad Transformers", "url": "https://comonad.com/reader/2011/more-on-comonads-as-monad-transformers/", "published_at": "2011-06-30T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95eb97c09f", "title": "Monad Transformers from Comonads", "url": "https://comonad.com/reader/2011/monad-transformers-from-comonads/", "published_at": "2011-06-28T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95ec8847ae", "title": "Monads from Comonads", "url": "https://comonad.com/reader/2011/monads-from-comonads/", "published_at": "2011-06-27T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95ec9e7cf2", "title": "Free Monads for Less (Part 3 of 3): Yielding IO", "url": "https://comonad.com/reader/2011/free-monads-for-less-3/", "published_at": "2011-06-24T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95ed079a1a", "title": "Free Monads for Less (Part 2 of 3): Yoneda", "url": "https://comonad.com/reader/2011/free-monads-for-less-2/", "published_at": "2011-06-23T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95edd81676", "title": "Free Monads for Less (Part 1 of 3): Codensity", "url": "https://comonad.com/reader/2011/free-monads-for-less/", "published_at": "2011-06-23T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95ee4c8b03", "title": "Lenses: A Functional Imperative", "url": "https://comonad.com/reader/talks/kmett-2011-lenses-functional-imperative/", "published_at": "2011-05-24T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95ee7627e8", "title": "Introducing Speculation", "url": "https://comonad.com/reader/2010/introducing-speculation/", "published_at": "2010-07-22T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95ef169d1a", "title": "Boston Haskell June", "url": "https://comonad.com/reader/2010/boston-haskell-june/", "published_at": "2010-05-20T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95ef3e0ce8", "title": "Hac Phi", "url": "https://comonad.com/reader/2010/hac-phi/", "published_at": "2010-05-20T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95ef716892", "title": "Brodal-Okasaki Heaps in Haskell", "url": "https://comonad.com/reader/2010/brodal-okasaki-heaps-in-haskell/", "published_at": "2010-05-15T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95f03efd62", "title": "Reverse-Mode Automatic Differentiation in Haskell", "url": "https://comonad.com/reader/2010/reverse-mode-automatic-differentiation-in-haskell/", "published_at": "2010-05-15T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95f123a651", "title": "Finger Trees", "url": "https://comonad.com/reader/2010/finger-trees/", "published_at": "2010-04-29T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95f1957290", "title": "Iteratees, Parsec, and Monoids, Oh My!", "url": "https://comonad.com/reader/2009/iteratees-take-2/", "published_at": "2009-09-15T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95f2729237", "title": "Remodeling Precision", "url": "https://comonad.com/reader/2009/remodeling-precision/", "published_at": "2009-09-15T12:00:00+00:00" }, { "id": "01a0e34d-c386-7219-bdf2-8c95f3466920", "title": "Curried Scheme", "url": "https://comonad.com/reader/2009/curried-scheme/", "published_at": "2009-08-29T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e3068609e", "title": "Iteratees, Parsec and Monoids (Slides)", "url": "https://comonad.com/reader/2009/iteratees-parsec-and-monoid/", "published_at": "2009-08-20T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e3084cd84", "title": "Clearer Reflections", "url": "https://comonad.com/reader/2009/clearer-reflection/", "published_at": "2009-08-15T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e31412815", "title": "Slides from Hac Phi: “All About Monoids”", "url": "https://comonad.com/reader/2009/hac-phi-slides/", "published_at": "2009-07-31T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e31ab3191", "title": "Recursion Schemes: A Field Guide (Redux)", "url": "https://comonad.com/reader/2009/recursion-schemes/", "published_at": "2009-06-11T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e322d2b8f", "title": "Reflecting On Incremental Folds", "url": "https://comonad.com/reader/2009/incremental-folds/", "published_at": "2009-03-31T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e3282b0e2", "title": "The Pointed-Set Comonad", "url": "https://comonad.com/reader/2008/the-pointed-set-comonad/", "published_at": "2008-12-04T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e32ba407f", "title": "Still Alive", "url": "https://comonad.com/reader/2008/still-alive/", "published_at": "2008-11-08T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e33b94075", "title": "Representing Adjunctions", "url": "https://comonad.com/reader/2008/representing-adjunctions/", "published_at": "2008-06-05T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e345166be", "title": "Zapping Adjunctions", "url": "https://comonad.com/reader/2008/zapping-strong-adjunctions/", "published_at": "2008-06-05T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e353228fd", "title": "Linear Bloom Filters", "url": "https://comonad.com/reader/2008/linear-bloom-filters/", "published_at": "2008-06-03T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e35a8bd38", "title": "Kan Extensions III: As Ends and Coends", "url": "https://comonad.com/reader/2008/kan-extension-iii/", "published_at": "2008-05-26T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e361032d3", "title": "Kan Extensions II: Adjunctions, Composition, Lifting", "url": "https://comonad.com/reader/2008/kan-extensions-ii/", "published_at": "2008-05-22T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e3689bd61", "title": "Kan Extensions", "url": "https://comonad.com/reader/2008/kan-extensions/", "published_at": "2008-05-20T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e372fec4e", "title": "Elgot (Co)Algebras", "url": "https://comonad.com/reader/2008/elgot-coalgebras/", "published_at": "2008-05-19T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e376b03a2", "title": "Forgetful Laziness", "url": "https://comonad.com/reader/2008/forgetful-laziness/", "published_at": "2008-05-16T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e37a9936e", "title": "Generatingfunctorology", "url": "https://comonad.com/reader/2008/generatingfunctorology/", "published_at": "2008-05-14T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e3855a5d8", "title": "Towards Formal Power Series for Functors", "url": "https://comonad.com/reader/2008/towards-formal-power-series-for-functors/", "published_at": "2008-05-13T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e38abf5c2", "title": "Just Fokkinga Abide", "url": "https://comonad.com/reader/2008/just-fokkinga-abide/", "published_at": "2008-05-07T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e395861a4", "title": "Cozipping", "url": "https://comonad.com/reader/2008/cozipping/", "published_at": "2008-05-05T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e39d8a7e9", "title": "Zipping and Unzipping Functors", "url": "https://comonad.com/reader/2008/zipping-and-unzipping-functors/", "published_at": "2008-05-04T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e3a47174e", "title": "Deriving Strength from Laziness", "url": "https://comonad.com/reader/2008/deriving-strength-from-laziness/", "published_at": "2008-04-30T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e3b0897c2", "title": "The Cofree Comonad and the Expression Problem", "url": "https://comonad.com/reader/2008/the-cofree-comonad-and-the-expression-problem/", "published_at": "2008-04-30T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e3bcd855e", "title": "Dynamorphisms as Chronomorphisms", "url": "https://comonad.com/reader/2008/dynamorphisms-as-chronomorphisms/", "published_at": "2008-04-26T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e3c941288", "title": "Time for Chronomorphisms", "url": "https://comonad.com/reader/2008/time-for-chronomorphisms/", "published_at": "2008-04-26T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e3ca423dd", "title": "Unnatural Transformations", "url": "https://comonad.com/reader/2008/unnatural-transformations/", "published_at": "2008-04-26T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e3d9fa352", "title": "Generalized Hylomorphisms", "url": "https://comonad.com/reader/2008/generalized-hylomorphisms/", "published_at": "2008-04-24T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e3e4f0bd4", "title": "Monads for Free", "url": "https://comonad.com/reader/2008/monads-for-free/", "published_at": "2008-04-11T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e3f066d97", "title": "Higher-Order Abstract Syntax à la Carte", "url": "https://comonad.com/reader/2008/higher-order-abstract-syntax-a-la-carte/", "published_at": "2008-03-26T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e3fc2c982", "title": "Rotten Bananas", "url": "https://comonad.com/reader/2008/rotten-bananas/", "published_at": "2008-03-25T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e3fd532cb", "title": "Elgot Algebras", "url": "https://comonad.com/reader/2008/elgot-algebras/", "published_at": "2008-01-01T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e40c32b4d", "title": "Parameterized Monads in Haskell", "url": "https://comonad.com/reader/2007/parameterized-monads-in-haskell/", "published_at": "2007-07-13T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e416af5b7", "title": "Updated Data.Type.*", "url": "https://comonad.com/reader/2007/updated-datatype/", "published_at": "2007-07-13T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e425b7a71", "title": "Javascript Interpreter, Recompiler, Atomizer, Threading Library…", "url": "https://comonad.com/reader/2007/javascript-interpreter-recompiler-atomizer-threading-library/", "published_at": "2007-05-21T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e42766c3e", "title": "##logic", "url": "https://comonad.com/reader/2006/logic/", "published_at": "2006-11-09T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e430900ec", "title": "Generalizing (.)", "url": "https://comonad.com/reader/2006/generalizing-dot/", "published_at": "2006-11-09T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e437fcf4a", "title": "Overloaded Functions with Subtyping", "url": "https://comonad.com/reader/2006/overloaded-functions-with-subtyping/", "published_at": "2006-11-01T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e43bccbe2", "title": "WikiPress", "url": "https://comonad.com/reader/2006/wikipress/", "published_at": "2006-10-26T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e4462c034", "title": "Hello, World!", "url": "https://comonad.com/reader/2006/hello-world/", "published_at": "2006-10-17T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e4556e89a", "title": "Harmless Algorithms — Part 4: A Hybrid Approach to Visibility", "url": "https://comonad.com/reader/2001/harmless-algorithms-4/", "published_at": "2001-02-19T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e45b14b8f", "title": "Harmless Algorithms — Part 3: Design Patterns And 3D Gaming", "url": "https://comonad.com/reader/2000/harmless-algorithms-3/", "published_at": "2000-01-26T12:00:00+00:00" }, { "id": "01a0e34d-c387-7140-af37-813e464f71f4", "title": "Harmless Algorithms — Part 2: Scene Traversal Algorithms", "url": "https://comonad.com/reader/1999/harmless-algorithms-2/", "published_at": "1999-04-30T12:00:00+00:00" } ] posts Claim your blog

Back to comonad.com

Blog · corpus.blog/blogs/comonad.com/posts

comonad.com

comonad.com

2014

A Quick Introduction To Haskell original ↗

16 Apr 2014

Catamorphisms original ↗

15 Apr 2014

2013

PHOAS For Free original ↗

9 Dec 2013

Cache-Oblivious Data Structures — Part I: Deamortized ST original ↗

8 Nov 2013

Procrustean Mathematics original ↗

8 Nov 2013

Cache-Oblivious Maps original ↗

18 Oct 2013

Functional Reporting original ↗

22 Sept 2013

Cellular Automata — Part III: A World in a Bottle original ↗

15 Sept 2013

Conquering Folds original ↗

13 Sept 2013

Parallel and Incremental CRCs original ↗

11 Sept 2013

Once original ↗

3 Sept 2013

Mandelbrot original ↗

2 Sept 2013

Cellular Automata — Part II: PNGs and Moore original ↗

1 Sept 2013

Episode 1 — On Lenses original ↗

26 Aug 2013

Revisiting Matrix Multiplication — Part VI: A Most Significant Comparison original ↗

25 Aug 2013

Revisiting Matrix Multiplication — Part IV: IntMap!?original ↗

25 Aug 2013

Revisiting Matrix Multiplication — Part III: Extending Vector original ↗

25 Aug 2013

Revisiting Matrix Multiplication — Part II: The Zen of Z-Ordering original ↗

25 Aug 2013

Revisiting Matrix Multiplication — Part I: Bit Shuffling with Lenses and Isomorphisms original ↗

25 Aug 2013

Cellular Automata — Part I: From Theory to Pretty Pictures original ↗

15 Aug 2013

Representing Applicatives original ↗

2 May 2013

Japanese “ekmett” Workshop (Part 1 of 2)original ↗

1 Apr 2013

Algebras of Applicatives original ↗

11 Jan 2013

2012

Abstracting with Applicatives original ↗

26 Dec 2012

Lenses, Folds and Traversals original ↗

12 Dec 2012

Natural Deduction, Sequent Calculus and Type Classes original ↗

7 Dec 2012

Unnatural Transformations and Quantifiers original ↗

22 Sept 2012

Working around Hackage Outages original ↗

29 Aug 2012

Making de Bruijn Succ Less original ↗

26 Jul 2012

Mirrored Lenses original ↗

24 Jun 2012

Where’s Waldo?original ↗

10 Jun 2012

Purely Functional Data Structures for On-Line LCA original ↗

31 May 2012

Catamorphism Knol original ↗

27 May 2012

Wadler’s Law Revisited original ↗

2 Apr 2012

2011

Searching Infinity Parametrically original ↗

25 Dec 2011

What Constraints Entail: Part 2 original ↗

3 Nov 2011

What Constraints Entail: Part 1 original ↗

3 Nov 2011

Homotopy and Directed Type Theory Slides original ↗

27 Oct 2011

Hac Boston!original ↗

25 Oct 2011

A Parsec Full of Rats, Part 2 original ↗

23 Sept 2011

A Parsec Full of Rats, Part 1 original ↗

23 Sept 2011

Free Modules and Functional Linear Functionals original ↗

11 Jul 2011

A Product of an Imperfect Union original ↗

30 Jun 2011

More on Comonads as Monad Transformers original ↗

30 Jun 2011

Monad Transformers from Comonads original ↗

28 Jun 2011

Monads from Comonads original ↗

27 Jun 2011

Free Monads for Less (Part 3 of 3): Yielding IO original ↗

24 Jun 2011

Free Monads for Less (Part 2 of 3): Yoneda original ↗

23 Jun 2011

Free Monads for Less (Part 1 of 3): Codensity original ↗

23 Jun 2011

Lenses: A Functional Imperative original ↗

24 May 2011

2010

Introducing Speculation original ↗

22 Jul 2010

Boston Haskell June original ↗

20 May 2010

Hac Phi original ↗

20 May 2010

Brodal-Okasaki Heaps in Haskell original ↗

15 May 2010

Reverse-Mode Automatic Differentiation in Haskell original ↗

15 May 2010

Finger Trees original ↗

29 Apr 2010

2009

Iteratees, Parsec, and Monoids, Oh My!original ↗

15 Sept 2009

Remodeling Precision original ↗

15 Sept 2009

Curried Scheme original ↗

29 Aug 2009

Iteratees, Parsec and Monoids (Slides)original ↗

20 Aug 2009

Clearer Reflections original ↗

15 Aug 2009

Slides from Hac Phi: “All About Monoids”original ↗

31 Jul 2009

Recursion Schemes: A Field Guide (Redux)original ↗

11 Jun 2009

Reflecting On Incremental Folds original ↗

31 Mar 2009

2008

The Pointed-Set Comonad original ↗

4 Dec 2008

Still Alive original ↗

8 Nov 2008

Representing Adjunctions original ↗

5 Jun 2008

Zapping Adjunctions original ↗

5 Jun 2008

Linear Bloom Filters original ↗

3 Jun 2008

Kan Extensions III: As Ends and Coends original ↗

26 May 2008

Kan Extensions II: Adjunctions, Composition, Lifting original ↗

22 May 2008

Kan Extensions original ↗

20 May 2008

Elgot (Co)Algebras original ↗

19 May 2008

Forgetful Laziness original ↗

16 May 2008

Generatingfunctorology original ↗

14 May 2008

Towards Formal Power Series for Functors original ↗

13 May 2008

Just Fokkinga Abide original ↗

7 May 2008

Cozipping original ↗

5 May 2008

Zipping and Unzipping Functors original ↗

4 May 2008

Deriving Strength from Laziness original ↗

30 Apr 2008

The Cofree Comonad and the Expression Problem original ↗

30 Apr 2008

Dynamorphisms as Chronomorphisms original ↗

26 Apr 2008

Time for Chronomorphisms original ↗

26 Apr 2008

Unnatural Transformations original ↗

26 Apr 2008

Generalized Hylomorphisms original ↗

24 Apr 2008

Monads for Free original ↗

11 Apr 2008

Higher-Order Abstract Syntax à la Carte original ↗

26 Mar 2008

Rotten Bananas original ↗

25 Mar 2008

Elgot Algebras original ↗

1 Jan 2008

2007

Parameterized Monads in Haskell original ↗

13 Jul 2007

Updated Data.Type.*original ↗

13 Jul 2007

Javascript Interpreter, Recompiler, Atomizer, Threading Library…original ↗

21 May 2007

2006

##logic original ↗

9 Nov 2006

Generalizing (.)original ↗

9 Nov 2006

Overloaded Functions with Subtyping original ↗

1 Nov 2006

WikiPress original ↗

26 Oct 2006

Hello, World!original ↗

17 Oct 2006

2001

Harmless Algorithms — Part 4: A Hybrid Approach to Visibility original ↗

19 Feb 2001

2000

Harmless Algorithms — Part 3: Design Patterns And 3D Gaming original ↗

26 Jan 2000

1999

Harmless Algorithms — Part 2: Scene Traversal Algorithms original ↗

30 Apr 1999