first-class-patterns: First class patterns and pattern matching, using type families

[ bsd3, data, library, pattern ] [ Propose Tags ]

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 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.

[Skip to Readme]


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


Versions [RSS] 0.1.0, 0.2.0, 0.3.0, 0.3.1, 0.3.2,,,,,
Change log
Dependencies base (>= && <5), transformers (>=0.1.0 && <0.6) [details]
License BSD-3-Clause
Author Reiner Pope, Brent Yorgey
Maintainer Kowainik <>
Category Data, Pattern
Home page
Bug tracker
Source repo head: git clone git://
Uploaded by shersh at 2019-10-01T18:22:52Z
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 8398 total (21 in the last 30 days)
Rating 2.25 (votes: 2) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2019-10-01 [all 1 reports]

Readme for first-class-patterns-

[back to package description]


Build status Hackage

Implements patterns in Haskell as first class objects.