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.
-
Notifications
You must be signed in to change notification settings - Fork 1
mbrcknl/btree-gadt
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Code from a talk given at YOW! Lambda Jam 2013
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published