Skip to content
0:00 / 0:00

#merkletrees#recursionschemes#lazyevaluation

Paul Kinsky - Lazily Diffing Merkele Trees with Recursion Schemes 3/4

Monadic Warsaw

1K subscribers • 5 videos on Hallway

YouTube
  • Recommended by 1 person: 1 in engineering communities.
  • Presented by Paul Kinsky

Advanced. Deep dive for people who know the field.

471 views7 years ago1 recommendation

Programming languagesComputer scienceHaskellData structuresAlgorithms

Paul Kinsky explains how to efficiently and lazily compute differences between Merkle trees using recursion schemes in Haskell.

Monadic Party 2019 - monadic.party

Why it's here

1 person recommends this

What people say. Recommended for its advanced demonstration of recursion schemes applied to practical data structure problems.

u/ysangkokin r/haskell • Recommends

Paul Kinsky - Lazily Diffing Merkele Trees with Recursion Schemes 3/4