The first-class-patterns package

[Tags: bsd3, library]

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.


Properties

Versions0.1.0, 0.2.0, 0.3.0, 0.3.1, 0.3.2, 0.3.2.1
Dependenciesbase (>=4.5 && <5), transformers (>=0.1.0 && <0.4)
LicenseBSD3
AuthorReiner Pope, Brent Yorgey
MaintainerBrent Yorgey <byorgey@cis.upenn.edu>
Stabilityexperimental
CategoryData
Home pagehttps://github.com/reinerp/first-class-patterns
Bug trackerhttps://github.com/reinerp/first-class-patterns/issues
Source repositoryhead: git clone git://github.com/reinerp/first-class-patterns.git
UploadedTue Jul 30 17:29:22 UTC 2013 by BrentYorgey
Downloads570 total (37 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees