first-class-patterns: First class patterns and pattern matching, using type families
|Versions||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|
|Dependencies||base (>=4.5 && <5), transformers (>=0.1.0 && <0.6) [details]|
|Author||Reiner Pope, Brent Yorgey|
|Maintainer||Brent Yorgey <firstname.lastname@example.org>|
|Source repo||head: git clone git://github.com/reinerp/first-class-patterns.git|
|Uploaded||by BrentYorgey at Mon May 9 21:11:22 UTC 2016|
|Downloads||2652 total (25 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
|Status||Docs available [build log]
Last success reported on 2016-05-09 [all 1 reports]
Hackage Matrix CI
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.
If you're just reading the documentation for this library for the first time, start with Data.Pattern.
For package maintainers and hackage trustees