Skip to content
0:00 / 0:00

#comonads#haskell#cellular-automata

1 10 Getting a Quick Fix on Comonads

ICFP Video

3.8K subscribers • 33 videos on Hallway

YouTube
  • Recommended by 3 people: 3 in engineering communities.

Advanced. Deep dive for people who know the field.

1.2K views11 years ago3 recommendations

Programming languagesComputer scienceHaskellFunctional programming

This talk presents a method for making comonads more efficient, with applications like infinite spreadsheets and cellular automata.

The uploader added no description.

Why it's here

3 people recommend this

What people say. Recommended for learning how to optimize comonads in Haskell for applications like cellular automata.

u/jwbuurlagein r/haskell • Recommends

On “GameOfLife”

…alive == 3 = Alive | otherwise = Dead where alive = ... And you use the comonad instance to update the entire infinite universe (lazily) at once: evolve :: Universe Cell -> Universe Cell evolve universe = universe =>> rule There are some pointers on making these comonads more efficient in the following presentation: link to this video where the motivation is to have 'infinite spreadsheets'.…

u/dbeachamin r/haskell • Recommends

On “Blow my mind, in one line.”

And you can take it even further (e.g. n-dimensional spreadsheets) if you change the `Functor` constraint to `ComonadApply`. Video: link to this video Code: https://github.com/kwf/GQFC

u/sclvin r/haskell • Recommends

On “Fun with recurrence relations”

Exercise: relate this very neat trick to the quick fix on comonads paper by /u/kwef (https://github.com/kwf/GQFC -- icfp video here: link to this video