name:                mrm
version:             0.1.0.0
synopsis:            Modular Refiable Matching, first-class matches
description:
    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/>.
homepage:            https://github.com/scmu/mrm
license:             BSD3
license-file:        LICENSE
author:              brunosoliveira, scmu, suhorng
maintainer:          suhorng@gmail.com
copyright:           Copyright (c) 2016, brunosoliveira, scmu, suhorng
category:            Data
build-type:          Simple
extra-source-files:  README.md
cabal-version:       >=1.10

source-repository head
  type:                 git
  location:             https://github.com/scmu/mrm

library
  hs-source-dirs:      src
  build-depends:       base >=4.7 && <4.8
  other-extensions:    GADTs
  exposed-modules:     Data.Match,
                       Data.ConstrainedList,
                       Data.Match.Subset,
                       Data.Match.Query,
                       Data.Match.Monadic,
                       Data.Match.Membership,
                       Data.Match.Fix,
                       Data.Match.Effects
  default-language:    Haskell2010