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.
- No changelog available
|Versions||0.1.0, 0.2.0, 0.3.0, 0.3.1, 0.3.2, 0.3.2.1|
|Dependencies||base (>=3 && <5), transformers (>=0.1.0 && <0.1.5)|
|Maintainer||Reiner Pope <firstname.lastname@example.org>|
|Uploaded||Thu Nov 5 20:17:39 UTC 2009 by ReinerPope|
|Downloads||666 total (32 in last 30 days)|
|Status||Docs uploaded by user|
Build status unknown [no reports yet]
- first-class-patterns-0.2.0.tar.gz [browse] (Cabal source package)
- Package description (included in the package)
For package maintainers and hackage trustees