data-reify alternatives and similar packages
Based on the "Data" category.
Alternatively, view data-reify alternatives based on common mentions on social networks and blogs.
-
semantic-source
Parsing, analyzing, and comparing source code across many languages -
lens
Lenses, Folds, and Traversals - Join us on web.libera.chat #haskell-lens -
-
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. -
unordered-containers
Efficient hashing-based container types -
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 -
holmes
A reference library for constraint-solving with propagators and CDCL. -
resource-pool
A high-performance striped resource pooling implementation for Haskell -
binary
Efficient, pure binary serialisation using ByteStrings in Haskell. -
-
primitive
This package provides various primitive memory-related operations. -
-
-
-
-
discrimination
Fast linear time sorting and discrimination for a large class of data types -
audiovisual
Extensible records, variants, structs, effects, tangles -
-
dependent-sum
Dependent sums and supporting typeclasses for comparing and displaying them -
-
dependent-map
Dependently-typed finite maps (partial dependent products) -
IORefCAS
A collection of different packages for CAS based data structures. -
safecopy
An extension to Data.Serialize with built-in version control -
reflection
Reifies arbitrary Haskell terms into types that can be reflected back into terms -
streaming
An optimized general monad transformer for streaming applications, with a simple prelude of functions -
-
-
orgmode-parse
Attoparsec parser combinators for parsing org-mode structured text! -
scientific
Arbitrary-precision floating-point numbers represented using scientific notation -
uuid-types
A Haskell library for creating, printing and parsing UUIDs -
text-icu
This package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text. -
Learn any GitHub repo in 59 seconds
Do you think we are missing an alternative of data-reify or a related project?
|
Collect and Analyze Billions of Data Points in Real Time
sponsored
www.influxdata.com
|
Popular Comparisons
-
data-reifyvsencode-string
-
aeson-qqvsData-Angle
-
aeson-qqvsjson-rpc-client
-
CBORvsprotobuf
-
radiusvsnetwork-address
|
SaaSHub - Software Alternatives and Reviews
sponsored
www.saashub.com
|
README
data-reify 
data-reify provided the ability to turn recursive structures into explicit graphs. Many (implicitly or explicitly) recursive data structure can be given this ability, via a type class instance. This gives an alternative to using Ref for observable sharing.
Observable sharing in general is unsafe, so we use the IO monad to bound this effect, but can be used safely even with unsafePerformIO if some simple conditions are met. Typically this package will be used to tie the knot with DSLs that depend of observable sharing, like Lava.
Providing an instance for MuRef is the mechanism for allowing a structure to be reified into a graph, and several examples of this are provided.
History: Version 0.1 used unsafe pointer compares. Version 0.2 of data-reify used StableNames, and was much faster. Version 0.3 provided two versions of MuRef, the mono-typed version, for trees of a single type, and the dynamic-typed version, for trees of different types. Version 0.4 used Int as a synonym for Unique rather than Data.Unique for node ids, by popular demand. Version 0.5 merged the mono-typed and dynamic version again, by using DynStableName, an unphantomized version of StableName.