Popularity

3.8

Growing

Activity

0.0

Stable

Stars 9

Watchers 1

Forks 2

Last Commit about 8 years ago

Monthly Downloads: 1

Programming language: Haskell

License: BSD 3-clause "New" or "Revised" License

Tags: Data

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

10.0 8.9 mrm VS semantic-source

DISCONTINUED. Parsing, analyzing, and comparing source code across many languages
lens

10.0 7.7 mrm VS lens

Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens

InfluxDB – Built for High-Performance Time Series Workloads

InfluxDB 3 OSS is now GA. Transform, enrich, and act on time series data directly in the database. Automate critical tasks and eliminate the need to move data externally. Download now.

Promo www.influxdata.com

hnix

9.9 6.8 mrm VS hnix

A Haskell re-implementation of the Nix expression language
code-builder

9.8 0.0 mrm VS code-builder

Packages for defining APIs, running them, generating client code and documentation.
text

9.8 7.0 mrm VS text

Haskell library for space- and time-efficient operations over Unicode text.
Frames

9.7 6.1 mrm VS Frames

Data frames for tabular data.
massiv

9.7 5.3 mrm VS massiv

Efficient Haskell Arrays featuring Parallel computation
compendium-client

9.7 0.0 mrm VS compendium-client

DISCONTINUED. Mu (μ) is a purely functional framework for building micro services.
unordered-containers

9.7 2.9 mrm VS unordered-containers

Efficient hashing-based container types
cassava

9.7 3.5 mrm VS cassava

A CSV parsing and encoding library optimized for ease of use and high performance
holmes

9.6 0.0 mrm VS holmes

A reference library for constraint-solving with propagators and CDCL.
primitive

9.6 5.2 mrm VS primitive

This package provides various primitive memory-related operations.
resource-pool

9.5 0.0 mrm VS resource-pool

A high-performance striped resource pooling implementation for Haskell
hashable

9.5 5.7 mrm VS hashable

A class for types that can be converted to a hash value
binary

9.5 2.8 mrm VS binary

Efficient, pure binary serialisation using ByteStrings in Haskell.
refined

9.5 4.8 mrm VS refined

Refinement types with static checking
critbit

9.5 0.0 mrm VS critbit

A Haskell implementation of crit-bit trees.
alfred-margaret

9.5 6.0 mrm VS alfred-margaret

Fast Aho-Corasick string searching
higgledy

9.4 2.6 mrm VS higgledy

Higher-kinded data via generics
jump

9.4 0.0 mrm VS jump

Jump start your Haskell development
diskhash

9.4 3.2 mrm VS diskhash

Diskbased (persistent) hashtable
cereal

9.4 0.0 mrm VS cereal

A binary serialization library
aeson-qq

9.4 3.6 mrm VS aeson-qq

JSON quasiquoter for Haskell
hashtables

9.4 7.2 mrm VS hashtables

Mutable hash tables for Haskell, in the ST monad
network-msgpack-rpc

9.4 mrm VS network-msgpack-rpc

A MessagePack-RPC Implementation
data-msgpack

9.4 mrm VS data-msgpack

A Haskell implementation of MessagePack
caledon

9.4 0.0 mrm VS caledon

higher order dependently typed logic programing
IORefCAS

9.3 5.7 mrm VS IORefCAS

A collection of different packages for CAS based data structures.
audiovisual

9.3 4.7 mrm VS audiovisual

Extensible records, variants, structs, effects, tangles
dependent-map

9.3 4.7 mrm VS dependent-map

Dependently-typed finite maps (partial dependent products)
certificate

9.3 0.0 mrm VS certificate

Certificate and Key Reader/Writer in haskell
discrimination

9.3 3.6 mrm VS discrimination

Fast linear time sorting and discrimination for a large class of data types
dependent-sum

9.3 4.3 mrm VS dependent-sum

Dependent sums and supporting typeclasses for comparing and displaying them
json-autotype

9.3 0.0 mrm VS json-autotype

Automatic Haskell type inference from JSON input
rei

9.2 0.0 mrm VS rei

Process lists easily
orgmode-parse

9.2 0.0 mrm VS orgmode-parse

Attoparsec parser combinators for parsing org-mode structured text!
uuid

9.2 3.9 mrm VS uuid

A Haskell library for creating, printing and parsing UUIDs
bifunctors

9.2 4.4 mrm VS bifunctors

Haskell 98 bifunctors, bifoldables and bitraversables
protobuf

9.2 2.6 mrm VS protobuf

An implementation of Google's Protocol Buffers in Haskell.
scientific

9.2 0.0 mrm VS scientific

Arbitrary-precision floating-point numbers represented using scientific notation
uuid-types

9.2 3.9 mrm VS uuid-types

A Haskell library for creating, printing and parsing UUIDs
reflection

9.2 4.7 mrm VS reflection

Reifies arbitrary Haskell terms into types that can be reflected back into terms
streaming

9.2 0.0 mrm VS streaming

An optimized general monad transformer for streaming applications, with a simple prelude of functions
safecopy

9.2 4.2 mrm VS safecopy

An extension to Data.Serialize with built-in version control
avro

9.2 5.2 mrm VS avro

Haskell Avro Encoding and Decoding Native Support (no RPC)
b-tree

9.1 1.8 mrm VS b-tree

Haskell on-disk B* tree implementation
witherable

9.1 2.4 mrm VS witherable

Filter with effects
text-icu

9.1 3.8 mrm VS text-icu

This package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text.
typerep-map

9.1 2.1 mrm VS typerep-map

⚡️Efficient implementation of Map with types as keys
tables

9.1 0.0 mrm VS tables

Deprecated because of

Do you think we are missing an alternative of mrm or a related project?

Add another 'Data' Package

Popular Comparisons

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.