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.

  1. type family SubstVar :: k1 -> k2 -> k2

    type-errors Type.Errors

    This type family is always stuck. It must be used in the context of te. Like Subst, but uses the explicit meta-variable VAR to mark substitution points. 

    >>> :kind! $(te[t| SubstVar (Either VAR VAR) Bool |])
...
= Either Bool Bool

    >>> :kind! $(te[t| SubstVar (Either VAR Bool) [Char] |])
...
= Either [Char] Bool

    >>> :kind! $(te[t| SubstVar (VAR Int Bool) (,) |])
...
= (Int, Bool)

  2. bestVariant :: Strategy a -> Frequency a

    LambdaHack Game.LambdaHack.Client.AI.Strategy

    When better choices are towards the start of the list, this is the best frequency of the strategy.

  3. collectVar :: (Foldable t, Functor t, Backprop a, Reifies s W) => t (BVar s a) -> BVar s (t a)

    backprop Numeric.Backprop

    Collect all of the BVars in a container into a BVar of that container's contents. Note that this associates gradients in order of occurrence in the original data structure; the second item in the total derivative and gradient is assumed to correspond with the second item in the input, etc.; this can cause unexpected behavior in Foldable instances that don't have a fixed number of items. Note that this does not suffer from the same performance overhead issues as sequenceVar. collectVar is <math>, with a very small constant factor that consistent for all types. This reveals a general property of reverse-mode automatic differentiation; "many to one" is cheap, but "one to many" is expensive.

  4. constVar :: a -> BVar s a

    backprop Numeric.Backprop

    Lift a value into a BVar representing a constant value. This value will not be considered an input, and its gradients will not be backpropagated.

  5. setVar :: (Backprop a, Backprop b, Reifies s W) => Lens' b a -> BVar s a -> BVar s b -> BVar s b

    backprop Numeric.Backprop

    Using a Lens', set a value inside a BVar. Meant to evoke parallels to "set" from lens. See documentation for .~~ for more information.

  6. collectVar :: forall t a s . (Reifies s W, Foldable t, Functor t) => AddFunc a -> ZeroFunc a -> t (BVar s a) -> BVar s (t a)

    backprop Numeric.Backprop.Explicit

    collectVar, but with explicit add and zero.

  7. constVar :: a -> BVar s a

    backprop Numeric.Backprop.Explicit

    Lift a value into a BVar representing a constant value. This value will not be considered an input, and its gradients will not be backpropagated.

  8. setVar :: forall a b s . Reifies s W => AddFunc a -> AddFunc b -> ZeroFunc a -> Lens' b a -> BVar s a -> BVar s b -> BVar s b

    backprop Numeric.Backprop.Explicit

    setVar, but with explicit add and zero.

  9. collectVar :: forall t a s . (Reifies s W, Foldable t, Functor t) => AddFunc a -> ZeroFunc a -> t (BVar s a) -> BVar s (t a)

    backprop Numeric.Backprop.Internal

    collectVar, but with explicit add and zero.

  10. constVar :: a -> BVar s a

    backprop Numeric.Backprop.Internal

    Lift a value into a BVar representing a constant value. This value will not be considered an input, and its gradients will not be backpropagated.

Page 42 of many | Previous | Next