homepage: ''
changelog-type: ''
hash: 3afc8dadc2f6506538f209b8e3a689d030c74ca77313a89a463af2d3597901d9
test-bench-deps: {}
maintainer: jhendrix@galois.com
synopsis: And-inverter graphs in Haskell.
changelog: ''
basic-deps:
  base: ==4.*
  base-compat: ! '>=0.6.0'
  mtl: -any
  QuickCheck: ! '>=2.7'
  vector: -any
all-versions:
- '0.1.0.0'
- '0.2'
- '0.2.1'
- '0.2.3'
- '0.2.4'
author: Galois Inc.
latest: '0.2.4'
description-type: haddock
description: ! '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.'
license-name: BSD3

homepage: ''
changelog-type: ''
hash: 1b1fde0a1b3199d273d8c3138fda9ab78676dac658cfd351a54f312ec2d7a34d
test-bench-deps:
  aig: -any
  base: ==4.*
  tasty-quickcheck: ! '>=0.8.1'
  tasty: -any
  QuickCheck: ! '>=2.7'
  tasty-ant-xml: -any
maintainer: jhendrix@galois.com
synopsis: And-inverter graphs in Haskell.
changelog: ''
basic-deps:
  base: ==4.*
  base-compat: ! '>=0.6.0'
  mtl: -any
  QuickCheck: ! '>=2.7'
  vector: -any
all-versions:
- '0.1.0.0'
- '0.2'
- '0.2.1'
- '0.2.3'
- '0.2.4'
- '0.2.5'
author: Galois Inc.
latest: '0.2.5'
description-type: haddock
description: ! '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.'
license-name: BSD3

Update from Hackage at 2017-04-25T04:36:30Z
Update from Hackage at 2017-04-25T04:36:30Z
