@hackage mrm0.1.0.0

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