Hoogle Search
Within LTS Haskell 24.18 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
-
what4 What4.Solver No documentation available.
-
This module provides an interface for running Boolector and parsing the results back.
-
what4 What4.Solver.Boolector No documentation available.
-
what4 What4.Solver.Boolector No documentation available.
-
yaml-unscrambler YamlUnscrambler.Expectations No documentation available.
-
Representation of Set Bool as a 4-element enum type. All operations in constant time and space. Mimics the interface of Set. Import as: import qualified Agda.Utils.BoolSet as BoolSet import Agda.Utils.BoolSet (BoolSet)
-
Agda Agda.Utils.BoolSet Isomorphic to Set Bool.
-
Boolean algebras and types isomorphic to Bool. There are already solutions for Boolean algebras in the Haskell ecosystem, but they do not offer easy instantiations for types isomorphic to Bool. In particular, if type a is isomorphic to Bool, so it satisfies `IsBool a`, we would like to instantiate 'Boolean a' by just giving true and false. To facilitate this within the limits of the Haskell class system, we define the class Boolean mutually with class IsBool, so that operations not, (&&), and (||) can get default implementations. Usage: import Prelude hiding ( not, (&&), (||) ) import Agda.Utils.Boolean
-
Agda Agda.Utils.Boolean Boolean algebras.
-
Generalized booleans and numbers Some classes for generalized boolean operations. Starting with 0.1.0, this package uses type families. Up to version 0.0.2, it used MPTCs with functional dependencies. My thanks to Andy Gill for suggesting & helping with the change. Thanks also to Alex Horsman for Data.Boolean.Overload and to Jan Bracker for Data.Boolean.Numbers. Copyright 2009-2013 Conal Elliott; BSD3 license.