BigFont Blog
  • Home
  • About
  • Bibliography (Work)

category-theory

A collection of 1 post

How is it possible that the default implementations of Haskell's Bifunctor first and second compose?
category-theory

How is it possible that the default implementations of Haskell's Bifunctor first and second compose?

I've been studying the category theory for about three months now. Recently, I felt surprised with the definition of Haskell's Bifunctor: class Bifunctor f where // type signatures bimap :: (a -> c) -&

  • Shaun Luttin
    Shaun Luttin
3 min read
BigFont Blog © 2022
Latest Posts Ghost