aig: And-inverter graphs in Haskell.
This package provides a generic interfaces for working with And-Inverter graphs (AIGs) in Haskell. And-Inverter graphs are a useful format for representing combinatorial and sequential boolean circuits in a way that is amenable to simulation and analysis. These interfaces allow clients to write code that can create and use AIGs without depending on a particular AIG package.
|Versions [RSS] [faq]||0.1.0.0, 0.2, 0.2.1, 0.2.3, 0.2.4, 0.2.5, 0.2.6|
|Dependencies||base (==4.*), base-compat (>=0.6.0 && <0.11.0), mtl, QuickCheck (>=2.7), vector [details]|
|Copyright||(c) 2014-2015 Galois Inc.|
|Revised||Revision 1 made by EricMertens at 2019-09-24T21:06:03Z|
|Source repo||head: git clone https://github.com/GaloisInc/aig.git|
|Uploaded||by RobertDockins at 2015-12-12T00:22:26Z|
|Downloads||5591 total (14 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs available [build log]
Last success reported on 2015-12-12 [all 1 reports]
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.