Hoogle Search

Within LTS Haskell 24.48 (ghc-9.10.3)

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

Exact lookup

1. formatMacroSources :: RegexType -> WithCaptures -> MacroEnv -> String

   regex	Text.RE.TestBench

   list the source REs for each macro in plain text

2. formatMacroSummary :: RegexType -> MacroEnv -> MacroID -> String

   regex	Text.RE.TestBench

   generate a plain text summary of a macro

3. formatMacroTable :: RegexType -> MacroEnv -> String

   regex	Text.RE.TestBench

   format a macros table as a markdown table

4. formatTokens :: [Token] -> String

   regex	Text.RE.ZeInternals

   format [Token] into an RE string

5. formatTokens' :: FormatTokenREOptions -> [Token] -> String

   regex	Text.RE.ZeInternals

   the general Token formatter, generating REs according to the options

6. formatTokens0 :: [Token] -> String

   regex	Text.RE.ZeInternals

   No documentation available.

7. forceSVArg :: SV -> IO ()

   sbv	Data.SBV.Internals

   Forcing an argument; this is a necessary evil to make sure all the arguments to an uninterpreted function are evaluated before called; the semantics of uinterpreted functions is necessarily strict; deviating from Haskell's

8. forallConjunction :: IO Proof

   sbv	Documentation.SBV.Examples.KnuckleDragger.Basics

   Pushing a universal through conjunction. We have:

   >>> forallConjunction
   Lemma: forallConjunction                Q.E.D.
   [Proven] forallConjunction
   

9. forallDisjunctionNot :: IO ()

   sbv	Documentation.SBV.Examples.KnuckleDragger.Basics

   We cannot push a universal through a disjunction. We have:

   >>> forallDisjunctionNot `catch` (\(_ :: SomeException) -> pure ())
   Lemma: forallConjunctionNot
   *** Failed to prove forallConjunctionNot.
   Falsifiable. Counter-example:
   p :: T -> Bool
   p T_2 = True
   p T_0 = True
   p _   = False
   
   q :: T -> Bool
   q T_2 = False
   q T_0 = False
   q _   = True
   

   Note how p assigns two selected values to True and everything else to False, while q does the exact opposite. So, there is no common value that satisfies both, providing a counter-example. (It's not clear why the solver finds a model with two distinct values, as one would have sufficed. But it is still a valud model.)

10. forNestedCoords :: (Enum a, Num a) => ([z] -> b) -> ([y] -> z) -> ([x] -> y) -> (Coords a -> x) -> Coords a -> b

    set-cover	Math.SetCover.Cuboid

    No documentation available.

Page 144 of many | Previous | Next