/ -package:inf-backprop

(/) :: Fractional a => a -> a -> a
base Prelude GHC.Real, hedgehog Hedgehog.Internal.Prelude, base-compat Prelude.Compat, protolude Protolude Protolude.Base, relude Relude.Numeric, rio RIO.Prelude, base-prelude BasePrelude BasePrelude.Operators, classy-prelude ClassyPrelude, Cabal-syntax Distribution.Compat.Prelude, universum Universum.Base, ihaskell IHaskellPrelude, clash-prelude Clash.HaskellPrelude, ghc-lib-parser GHC.Prelude.Basic, ghc-internal GHC.Internal.Real, rebase Rebase.Prelude, opaleye Opaleye.Operators, xmonad-contrib XMonad.Config.Prime, constrained-categories Control.Category.Constrained.Prelude Control.Category.Hask, copilot-language Copilot.Language.Prelude, LambdaHack Game.LambdaHack.Core.Prelude, cabal-install-solver Distribution.Solver.Compat.Prelude, faktory Faktory.Prelude, verset Verset, yesod-paginator Yesod.Paginator.Prelude, distribution-opensuse OpenSuse.Prelude, hledger-web Hledger.Web.Import, termonad Termonad.Prelude
Fractional division.
(/) :: Fractional a => a -> a -> a
ghc GHC.Prelude.Basic
(/) :: C a => a -> a -> a
numeric-prelude Algebra.Field NumericPrelude NumericPrelude.Numeric
(/) :: Fractional a => a -> a -> a
basic-prelude CorePrelude, prelude-compat Prelude2010
fractional division
(/) :: Field a => a -> a -> a
semirings Data.Field
Infix shorthand for divide.
(/) :: Divisible a => a -> a -> a
basement Basement.Numerical.Multiplicative, foundation Foundation Foundation.Numerical
(/) :: Divisive a => a -> a -> a
numhask NumHask NumHask.Algebra.Multiplicative
type family (a :: Dimension) / (d :: Dimension)
dimensional Numeric.Units.Dimensional Numeric.Units.Dimensional.Dimensions.TypeLevel Numeric.Units.Dimensional.FixedPoint Numeric.Units.Dimensional.Prelude
Division of dimensions corresponds to subtraction of the base dimensions' exponents.
(/) :: (KnownVariant v1, KnownVariant v2, KnownVariant (v1 / v2), Fractional a) => Dimensional v1 d1 a -> Dimensional v2 d2 a -> Dimensional (v1 / v2) (d1 / d2) a
dimensional Numeric.Units.Dimensional Numeric.Units.Dimensional.FixedPoint Numeric.Units.Dimensional.Prelude
Divides one Quantity by another or one Unit by another. The intimidating type signature captures the similarity between these operations and ensures that composite Units are NonMetric.
(/) :: Dimension' -> Dimension' -> Dimension'
dimensional Numeric.Units.Dimensional.Dimensions.TermLevel
Forms the quotient of two dimensions.
(/) :: AnyUnit -> AnyUnit -> AnyUnit
dimensional Numeric.Units.Dimensional.Dynamic
Forms the quotient of two dynamic units.
(/) :: UnitName m1 -> UnitName m2 -> UnitName 'NonMetric
dimensional Numeric.Units.Dimensional.UnitNames
Form a UnitName by dividing one by another.
type family (v1 :: Variant) / (v2 :: Variant) :: Variant
dimensional Numeric.Units.Dimensional.Variants
Forms the quotient of two Variants. The quotient of units is a non-metric unit. The quotient of quantities is a quantity.
type family (/) (a :: k1) (b :: k2) :: DivK k1 k2
o-clock Time.Rational
Overloaded division.
(/) :: CanDiv t1 t2 => t1 -> t2 -> DivType t1 t2
mixed-types-num Numeric.MixedTypes.Div
(/) :: Division r => r -> r -> r
algebra Numeric.Algebra Numeric.Algebra.Division
type family (a :: ExactPi') / (b :: ExactPi') :: ExactPi'
exact-pi Data.ExactPi.TypeLevel
Forms the quotient of ExactPi' types (in the arithmetic sense).
(/) :: (Eq a, Fractional a) => a -> a -> Maybe a
incipit-base Incipit.Fractional
Fractional division.
type family (i :: TypeInt) / (i' :: TypeInt) :: TypeInt
numtype-dk Numeric.NumType.DK.Integers
TypeInt division.
(/) :: Proxy i -> Proxy i' -> Proxy (i / i')
numtype-dk Numeric.NumType.DK.Integers
type (/) a b = RatDiv a b
typenums Data.TypeLits Data.TypeNums
The ratio of two type-level numbers
(/=) :: Eq a => a -> a -> Bool
base Prelude Data.Eq GHC.Base
(//) :: Ix i => Array i e -> [(i, e)] -> Array i e
base GHC.Arr
Constructs an array identical to the first argument except that it has been updated by the associations in the right argument. For example, if m is a 1-origin, n by n matrix, then 
m//[((i,i), 0) | i <- [1..n]]
is the same matrix, except with the diagonal zeroed. Repeated indices in the association list are handled as for array: Haskell 2010 specifies that the resulting array is undefined (i.e. bottom), but GHC's implementation uses the last association for each index.
(/##) :: Double# -> Double# -> Double#
base GHC.Base
(/=#) :: Int# -> Int# -> Int#
base GHC.Base