AST node for the Fourier transform: fourier(e, t, w) in the grammar.
Computes the unilateral Fourier transform F{e(t)} with frequency variable w via the Laplace-to-Fourier substitution s -> i*w (see fourierOf). Results are generally complex-valued. The binder t is excluded from children; w appears free in the result.
eval applies fourierOf and guards against the fixpoint.
Value parameters
e
the time-domain expression to transform
t
the time variable (binder -- excluded from children)
w
the angular frequency variable (free in the result)