The first-class-patterns package
This package implements a library of first class patterns. The initial basis for this library was Morten Rhiger's "Type-safe pattern combinators"; the patterns can be used in an almost identical way to those of Morten Rhiger. In a series of blog posts at http://reinerp.wordpress.com/category/pattern-combinators/ the types of patterns were made more revealing using type families, and a simpler implementation was used which avoids some book-keeping.
The library reimplements most of Haskell's built-in pattern matching facilities, plus some more. The pattern matches of this library are lightweight: when GHC's optimisation is turned on, all overhead should be optimised away, leaving a standard Haskell pattern match.
Properties
| Versions | 0.1.0, 0.2.0, 0.3.0, 0.3.1 |
|---|---|
| Dependencies | base (≥3 & <5), transformers (≥0.1.0 & <0.1.5) |
| License | BSD3 |
| Author | Reiner Pope |
| Maintainer | Reiner Pope <reiner.pope@gmail.com> |
| Stability | experimental |
| Category | Data |
| Upload date | Thu Nov 5 20:17:39 UTC 2009 |
| Uploaded by | ReinerPope |
| Built on | ghc-6.10, ghc-6.12 |
| Build failure | ghc-7.0 (log) |
Modules
Downloads
- first-class-patterns-0.2.0.tar.gz (Cabal source package)
- package description (included in the package)