mrm alternatives and similar packages
Based on the "Data" category.
Alternatively, view mrm alternatives based on common mentions on social networks and blogs.
-
semantic-source
Parsing, analyzing, and comparing source code across many languages -
-
code-builder
Packages for defining APIs, running them, generating client code and documentation. -
text
Haskell library for space- and time-efficient operations over Unicode text. -
-
compendium-client
Mu (μ) is a purely functional framework for building micro services. -
cassava
A CSV parsing and encoding library optimized for ease of use and high performance -
-
primitive
This package provides various primitive memory-related operations. -
-
resource-pool
A high-performance striped resource pooling implementation for Haskell -
-
-
-
discrimination
Fast linear time sorting and discrimination for a large class of data types -
-
reflection
Reifies arbitrary Haskell terms into types that can be reflected back into terms -
dependent-sum
Dependent sums and supporting typeclasses for comparing and displaying them -
-
dependent-map
Dependently-typed finite maps (partial dependent products) -
text-icu
This package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text. -
-
orgmode-parse
Attoparsec parser combinators for parsing org-mode structured text! -
-
streaming
An optimized general monad transformer for streaming applications, with a simple prelude of functions -
-
-
-
-
scientific
Arbitrary-precision floating-point numbers represented using scientific notation
ONLYOFFICE Docs — document collaboration in your environment
Do you think we are missing an alternative of mrm or a related project?
|
Access the most powerful time series database as a service
sponsored
www.influxdata.com
|
Popular Comparisons
-
mrmvscertificate
-
protobufvsCBOR
-
radiusvsnetwork-address
-
attemptvstext
-
json-autotypevsbase58string
|
Clean code begins in your IDE with SonarLint
sponsored
www.sonarlint.org
|
README
mrm
Modular Reifiable Matching, A List-of-Functors Approach to Two-Level Types
Modular Reifiable Matching (MRM) is 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 à la Carte (DTC) approach. However, unlike DTC, which uses the more conventional two-level types approach using fixpoints of functors, MRM uses a fixpoint of list-of-functors.
This approach has advantages that help with various aspects of extensibility, modularity and reuse. Firstly, modular pattern matching definitions are collected using a list of matches that is fully reifiable. This allows for extensible pattern matching definitions to be easily reused/inherited, and particular matches to be overridden. Such flexibility is used, among other things, to implement extensible generic traversals.
Secondly, the subtyping relation between lists of functors is quite simple, does not require backtracking, and is easy to model in languages like Haskell.
This repository implements MRM as a Haskell library, and illustrates its use and applicability through some examples.
More details of MRM can be found in Bruno C. d. S. Oliveira, Shin-Cheng Mu, and Shu-Hung You. Modular reifiable matching: a list-of-functors approach to two-level types. In the 8th ACM SIGPLAN Symposium on Haskell (Haskell 2015), pages 82-93. Sep. 2015.