:: [a] -> a -> [a] package:numeric-prelude

decomposeVarPositionalInf :: C a => [a] -> a -> [a]
numeric-prelude Algebra.IntegralDomain
approximate :: C a => [a] -> a -> [a]
numeric-prelude MathObj.PowerSeries.Core
decomposeVarPositional :: (C a, C a) => [a] -> a -> [a]
numeric-prelude Algebra.IntegralDomain
decomposeVarPositional [b0,b1,b2,...] x decomposes x into a positional representation with mixed bases x0 + b0*(x1 + b1*(x2 + b2*x3)) E.g. decomposeVarPositional (repeat 10) 123 == [3,2,1]
approximateCoeffVector :: C a v => [v] -> a -> [v]
numeric-prelude MathObj.PowerSeries.Core
approximateArgVector :: (C a v, C v) => [a] -> v -> [v]
numeric-prelude MathObj.PowerSeries.Core
(<$) :: Functor f => a -> f b -> f a
numeric-prelude NumericPrelude NumericPrelude.Base
Replace all locations in the input with the same value. The default definition is fmap . const, but this may be overridden with a more efficient version. Using ApplicativeDo: 'a <$ bs' can be understood as the do expression 
do bs
pure a
with an inferred Functor constraint.