Corey O'Connor coreyoconnor
rampion
/ RedBlackTree.hs
Created
May 11, 2012 13:55
red-black trees in haskell, using GADTs and Zippers
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| {-# LANGUAGE GADTs #-} | |
| {-# LANGUAGE RankNTypes #-} | |
| {-# LANGUAGE StandaloneDeriving #-} | |
| module RedBlackTree where | |
| data Zero | |
| data Succ n | |
| type One = Succ Zero | |
| data Black |