A simple example of a dependently-typed regular expression library.
This code is not intended to be production quality. There are many faster and more robust libraries for regular expression matching in Haskell. Instead, this code demonstrates the major aspects of dependently-typed programming in Haskell.
See Example.hs for an example of the library in action.