Skip to content
Hallway
0:00 / 0:00

#comonads#chrispenner#monadicparty

Chris Penner - Comonads by Example 1/4

Monadic Warsaw

1K subscribers • 8 videos on Hallway

YouTube
  • Recommended by 2 people: 2 in engineering communities.
  • Presented by Chris Penner

Intermediate. Assumes working knowledge.

7K views7 years ago2 recommendations

Programming languagesComputer scienceHaskellFunctional programmingComputation and complexity

Chris Penner explains the concept of comonads in Haskell using practical examples to build intuition.

Monadic Party 2019 - monadic.party

Why it's here

2 people recommend this

What people say. Recommended for building intuition and understanding the practical motivation behind comonads in Haskell.

u/the-cootin r/haskell • Recommends

On “Is there a valid Monad instance for binary trees?”

Your data structure is an example of a comonad. It is the free comonad for the ``` data Tuple a = Tuple a a ``` functor. Recently, there was a talk on comonads at https://monadic.party link to this video
2View on Reddit

u/TheMattenin r/haskell • Recommends

On “Monthly Hask Anything (October 2019)”

This method is usually part of `Comonad` interface. `Comonad` is "dual" to `Monad` in theoretical sense - it "swaps" types to the opposite way. Intuitively it "extends" "query" of some structure to all it's possible "positions". I would recommend you to watch Chris Penner's series of talks to get that intuition and some motivation.
1View on Reddit