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.
Join GitHub today
GitHub is home to over 28 million developers working together to host and review code, manage projects, and build software together.
Sign up
Haskell
Fetching latest commit…
Cannot retrieve the latest commit at this time.
| Failed to load latest commit information. | |||
|
src | ||
|
|
README.markdown | ||