zsdd alternatives and similar packages
Based on the "Data" category.
Alternatively, view zsdd alternatives based on common mentions on social networks and blogs.
-
semantic-source
Parsing, analyzing, and comparing source code across many languages -
-
text
Haskell library for space- and time-efficient operations over Unicode text. -
code-builder
Packages for defining APIs, running them, generating client code and documentation. -
-
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 -
-
resource-pool
A high-performance striped resource pooling implementation for Haskell -
-
primitive
This package provides various primitive memory-related operations. -
-
-
-
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-map
Dependently-typed finite maps (partial dependent products) -
dependent-sum
Dependent sums and supporting typeclasses for comparing and displaying them -
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! -
text-icu
This package provides the Haskell Data.Text.ICU library, for performing complex manipulation of Unicode text. -
-
-
-
scientific
Arbitrary-precision floating-point numbers represented using scientific notation -
-
Static code analysis for 29 languages.
Do you think we are missing an alternative of zsdd or a related project?
|
Access the most powerful time series database as a service
sponsored
www.influxdata.com
|
Popular Comparisons
-
CBORvsprotobuf
-
network-addressvsradius
-
textvsattempt
-
json-autotypevsbase58string
-
boringvsbinary
|
SaaSHub - Software Alternatives and Reviews
sponsored
www.saashub.com
|
README
ZSDD 
This package provides an efficient representation of propositions as directed acyclic graphs. Intnerally this is acutally a Free monad with shared subterms. All operations are linear in the size of the diagram, but the size of the diagram is also proportional to the number of operations.
There are two reduction stratergies Simple and ZeroSup.
The former is generic and widely applicable, whereas the latter is specialised to sparse formulas.
Sparse formulas are those with few models or where most atoms are false.
A typical use cases of this mode is when modelling families of sets.
Shin-ichi Minato, "Zero-suppressed BDDs for set manipulation in combinatorial problems", DAC '93: Proceedings of the 30th international Design Automation Conference https://dl.acm.org/doi/10.1145/157485.164890