mrm: Modular Refiable Matching, first-class matches
This package contains an implementation of Modular Reifiable Matching (MRM), a new approach to two level types using a fixpoint of list-of-functors representation. MRM allows the modular definition of datatypes and functions by pattern matching, using a style similar to the widely popular Datatypes a la Carte (DTC) approach. However, unlike DTC, MRM uses a fixpoint of list-of-functors approach to two-level types. This approach has advantages that help with various aspects of extensibility, modularity and reuse. For more information, please refer to http://www.iis.sinica.edu.tw/~scm/2015/mrm/.
[Skip to Readme]
Modules
- Data
- Data.ConstrainedList
- Data.Match
- Data.Match.Effects
- Data.Match.Fix
- Data.Match.Membership
- Data.Match.Monadic
- Data.Match.Query
- Data.Match.Subset
Downloads
- mrm-0.1.0.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.1.0.0 |
|---|---|
| Dependencies | base (>=4.7 && <4.8) [details] |
| License | BSD-3-Clause |
| Copyright | Copyright (c) 2016, brunosoliveira, scmu, suhorng |
| Author | brunosoliveira, scmu, suhorng |
| Maintainer | suhorng@gmail.com |
| Category | Data |
| Home page | https://github.com/scmu/mrm |
| Source repo | head: git clone https://github.com/scmu/mrm |
| Uploaded | by suhorng at 2016-03-07T14:18:58Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 923 total (2 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs not available [build log] All reported builds failed as of 2016-11-27 [all 3 reports] |