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.
mbrcknl/btree-gadt
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
| Name | Name | Last commit date | ||
|---|---|---|---|---|
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.