Skip to content

/ btree-gadt

Code from a talk given at YOW! Lambda Jam 2013

13 stars 1 fork
Star
Watch
Branch: master
Go to file
Code

Clone with HTTPS

Use Git or checkout with SVN using the web URL.

Latest commit

 

Git stats

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
src
 
 
README.markdown
 
 

README.markdown

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.

About

Code from a talk given at YOW! Lambda Jam 2013

Resources

Readme

Releases

No releases published

Languages

You can’t perform that action at this time.