first-class-patterns: First class patterns and pattern matching, using type families
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.
|Versions [RSS] [faq]||0.1.0, 0.2.0, 0.3.0, 0.3.1, 0.3.2, 0.3.2.1, 0.3.2.2, 0.3.2.3, 0.3.2.4, 0.3.2.5|
|Dependencies||base (>=3 && <5) [details]|
|Maintainer||Reiner Pope <firstname.lastname@example.org>|
|Uploaded||by ReinerPope at 2009-07-19T01:37:12Z|
|Distributions||LTSHaskell:0.3.2.5, NixOS:0.3.2.5, Stackage:0.3.2.5|
|Downloads||7002 total (62 in the last 30 days)|
|Rating||2.0 (votes: 1) [estimated by Bayesian average]|
Docs uploaded by user
Build status unknown [no reports yet]