B-Trees with GADTs
A simple B-Tree implementation in Haskell, with insertion and deletion, using a GADT to enforce the structural envariant.
This is the code behind my screencast.
Use Git or checkout with SVN using the web URL.
Work fast with our official CLI. Learn more.
Please sign in to use Codespaces.
If nothing happens, download GitHub Desktop and try again.
If nothing happens, download GitHub Desktop and try again.
If nothing happens, download Xcode and try again.
Your codespace will open once ready.
There was a problem preparing your codespace, please try again.
A simple B-Tree implementation in Haskell, with insertion and deletion, using a GADT to enforce the structural envariant.
This is the code behind my screencast.
Code from a talk given at YOW! Lambda Jam 2013