Hoogle Search

Within LTS Haskell 24.25 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. pattern BoolJson :: Bool -> Json

   aeson-unqualified-ast	Data.Aeson.UnqualifiedAst

   Alias to the Bool constructor and its pattern.

2. module Data.BoolSimplifier

   Machinery for representing and simplifying simple propositional formulas. Type families are used to maintain a simple normal form, taking advantage of the duality between "And" and "Or". Additional tools are provided to pull out common atoms in subformulas and otherwise iterate until a simplified fixpoint. Full and general simplification is NP-hard, but the tools here can take typical machine-generated formulas and perform most simplifications that could be spotted and done by hand by a reasonable programmer. While there are many functions below, only qAtom, andq(s), orq(s), and qNot need be used directly to build expressions. simplifyQueryRep performs a basic simplification, simplifyIons works on expressions with negation to handle their reduction, and fixSimplifyQueryRep takes a function built out of any combination of basic simplifiers (you can write your own ones taking into account any special properties of your atoms) and runs it repeatedly until it ceases to reduce the size of your target expression. The general notion is either that you build up an expression with these combinators directly, simplify it further, and then transform it to a target semantics, or that an expression in some AST may be converted into a normal form expression using such combinators, and then simplified and transformed back to the original AST. Here are some simple interactions:

   Prelude Data.BoolSimplifier> (qAtom "A") `orq` (qAtom "B")
   QOp | fromList [QAtom Pos "A",QAtom Pos "B"] fromList []
   

   Prelude Data.BoolSimplifier> ppQueryRep $ (qAtom "A") `orq` (qAtom "B")
   "(A | B)"
   

   Prelude Data.BoolSimplifier> ppQueryRep $ ((qAtom "A") `orq` (qAtom "B") `andq` (qAtom "A"))
   "(A)"
   

   Prelude Data.BoolSimplifier> ppQueryRep $ ((qAtom "A") `orq` (qAtom "B") `andq` (qAtom "A" `orq` qAtom "C"))
   "((A | B) & (A | C))"
   

   Prelude Data.BoolSimplifier> ppQueryRep $ simplifyQueryRep $ ((qAtom "A") `orq` (qAtom "B") `andq` (qAtom "A" `orq` qAtom "C"))
   "((A | (B & C)))"
   

3. module Copilot.Language.Operators.Boolean

   Boolean operators applied point-wise to streams.

4. module Diagrams.TwoD.Path.Boolean

   Set operations on paths. As a side effect it removes overlapping regions. Since Path is TrailLike, you can use these operations directly with any combinator which generates Loops, like circle or fromSegments. Lines are discarded, only Loops are used. If you have several paths, you can combine them with <> first. Use toPath if you want to convert a Trail or Located Trail to a Path. The FillRule argument determines how insideness is calculated for the input.

5. BoolAnd :: Boolean -> Boolean -> Boolean

   funcmp	FMP.Types

   No documentation available.

6. BoolEQ :: BoolRelat

   funcmp	FMP.Types

   No documentation available.

7. BoolL :: BoolRelat

   funcmp	FMP.Types

   No documentation available.

8. BoolLE :: BoolRelat

   funcmp	FMP.Types

   No documentation available.

9. BoolNE :: BoolRelat

   funcmp	FMP.Types

   No documentation available.

10. BoolNot :: Boolean -> Boolean

    funcmp	FMP.Types

    No documentation available.

Page 35 of many | Previous | Next