Hoogle Search
Within LTS Haskell 24.3 (ghc-9.10.2)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
Sum :: forall a1 c b . (a1 :-> c) -> (b :-> c) -> Either a1 b :-> chedgehog-fn Hedgehog.Function.Internal No documentation available.
-
hvega Graphics.Vega.VegaLite Sum of field values to be used in an aggregate operation.
data
Sum (f :: k -> Type) (g :: k -> Type) (a :: k)rank2classes Rank2 Lifted sum of functors.
Examples
>>> fmap (+1) (InL (Just 1)) :: Sum Maybe [] Int InL (Just 2)
>>> fmap (+1) (InR [1, 2, 3]) :: Sum Maybe [] Int InR [2,3,4]
module Data.Aeson.Schema.Utils.
Sum The SumType data type that represents a sum type consisting of types specified in a type-level list.
module Documentation.SBV.Examples.ProofTools.
Sum Example inductive proof to show partial correctness of the traditional for-loop sum algorithm:
s = 0 i = 0 while i <= n: s += i i++
We prove the loop invariant and establish partial correctness that s is the sum of all numbers up to and including n upon termination.module Documentation.SBV.Examples.WeakestPreconditions.
Sum Proof of correctness of an imperative summation algorithm, using weakest preconditions. We investigate a few different invariants and see how different versions lead to proofs and failures.
-
set-cover Math.SetCover.Bit No documentation available.
-
set-cover Math.SetCover.Bit No documentation available.
-
sql-words Language.SQL.Keyword.Type No documentation available.
-
testing-feat Test.Feat.Enumerate Monoid under addition.
Sum a <> Sum b = Sum (a + b)
Examples
>>> Sum 1 <> Sum 2 <> mempty Sum {getSum = 3}>>> mconcat [ Sum n | n <- [3 .. 9]] Sum {getSum = 42}