exp

exp :: Floating a => a -> a
base Prelude Numeric GHC.Float, hedgehog Hedgehog.Internal.Prelude, ghc GHC.Prelude.Basic, base-compat Prelude.Compat, protolude Protolude Protolude.Base, relude Relude.Numeric, rio RIO.Prelude, base-prelude BasePrelude, classy-prelude ClassyPrelude, Cabal-syntax Distribution.Compat.Prelude, basic-prelude CorePrelude, universum Universum.Base, clash-prelude Clash.HaskellPrelude, github GitHub.Internal.Prelude, ghc-lib-parser GHC.Prelude.Basic, prelude-compat Prelude2010, ghc-internal GHC.Internal.Float GHC.Internal.Numeric, haxl Haxl.Prelude, rebase Rebase.Prelude, 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, vcr Imports, verset Verset, yesod-paginator Yesod.Paginator.Prelude, distribution-opensuse OpenSuse.Prelude, funcmp FMP.Types, hledger-web Hledger.Web.Import, termonad Termonad.Prelude
exp :: QuasiQuoter
inline-c Language.C.Inline Language.C.Inline.Interruptible Language.C.Inline.Unsafe
C expressions.
exp :: C a => a -> a
numeric-prelude Algebra.Transcendental NumericPrelude NumericPrelude NumericPrelude.Numeric NumericPrelude.Numeric
exp :: C a => (a -> a) -> [a] -> [a]
numeric-prelude MathObj.PowerSeries.Core
The first term needs a transcendent computation but the others do not. That's why we accept a function which computes the first term. 
(exp . x)' =   (exp . x) * x'
(sin . x)' =   (cos . x) * x'
(cos . x)' = - (sin . x) * x'

equalTrunc 500 PSE.expExpl (PS.exp (\0 -> 1) [0,1])

equalTrunc 100 (1:1:repeat 0) (PS.exp (\0 -> 1) PSE.log)

checkHoles 30 (PS.exp (\0 -> 1)) 0
exp :: C a => [a]
numeric-prelude MathObj.PowerSeries.Example
exp :: C a => T a -> T a
numeric-prelude Number.Complex
Exponential of a complex number with minimal type class constraints.
exp :: Integer -> Integer -> Integer
numeric-prelude Number.FixedPoint
exp :: Basis -> T -> T
numeric-prelude Number.Positional
exp :: ExpField a => a -> a
numhask NumHask NumHask.Algebra.Field
exp :: (Exp property, Packing pack, PowerStrip lower, PowerStrip upper, C sh, Floating a) => Quadratic pack property lower upper sh a -> Quadratic pack property lower upper sh a
lapack Numeric.LAPACK.Matrix.Function
exp :: Floating a => Dimensionless a -> Dimensionless a
dimensional Numeric.Units.Dimensional Numeric.Units.Dimensional.Prelude
exp :: CanExp t => t -> ExpType t
mixed-types-num Numeric.MixedTypes.Elementary
exp :: (CanExp t, ExpType t ~ t, Floating t) => t -> ExpType t
mixed-types-num Numeric.MixedTypes.Elementary
exp :: Double -> Double
hmatrix-special Numeric.GSL.Special.Exp
exp :: Rational -> Rational -> Rational
numbers Data.Number.FixedFunctions
exp :: P Exp
language-java Language.Java.Parser
exp :: Parser Exp
language-lua Language.Lua Language.Lua.Parser
exp :: Parser (Exp SourceRange)
language-lua Language.Lua.Annotated Language.Lua.Annotated.Parser
exp :: MMPFR s -> MMPFR s -> RoundMode -> ST s Int
hmpfr Data.Number.MPFR.Mutable.Special
exp :: RoundMode -> Precision -> MPFR -> MPFR
hmpfr Data.Number.MPFR.Special
exp :: QuasiQuoter
BNFC-meta Language.LBNF.Grammar
exp :: forall x m . (ExpField x, Show x, MonadLogger m) => Backprop (Kleisli m) x x
inf-backprop Debug.LoggingBackprop
Differentiable logging exponent function.
exp :: forall x . ExpField x => BackpropFunc x x
inf-backprop InfBackprop Prelude.InfBackprop
Natural logarithm differentiable function.

Examples of usage

>>> import Prelude (Float)

>>> import InfBackprop (call, derivative)

>>> call exp 2
7.38905609893065

>>> import Debug.SimpleExpr.Expr (variable)

>>> x = variable "x"

>>> derivative exp x
1·exp(x)
data Exp
template-haskell Language.Haskell.TH Language.Haskell.TH.Syntax
data Exp l
haskell-src-exts Language.Haskell.Exts.Syntax
Haskell expressions.