math.exp on complex, imaginary part

Percentage Accurate: 100.0% → 100.0%

Time: 3.7s

Alternatives: 8

Speedup: 1.0×

• 24.4% of points produce a very large (infinite) output. You may want to add a precondition.

Specification

Math

\[\begin{array}{l} \\ e^{re} \cdot \sin im \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (* (exp re) (sin im)))

C

double code(double re, double im) {
	return exp(re) * sin(im);
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = exp(re) * sin(im)
end function

Java

public static double code(double re, double im) {
	return Math.exp(re) * Math.sin(im);
}

Python

def code(re, im):
	return math.exp(re) * math.sin(im)

Julia

function code(re, im)
	return Float64(exp(re) * sin(im))
end

MATLAB

function tmp = code(re, im)
	tmp = exp(re) * sin(im);
end

Wolfram

code[re_, im_] := N[(N[Exp[re], $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ e^{re} \cdot \sin im \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (* (exp re) (sin im)))

C

double code(double re, double im) {
	return exp(re) * sin(im);
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = exp(re) * sin(im)
end function

Java

public static double code(double re, double im) {
	return Math.exp(re) * Math.sin(im);
}

Python

def code(re, im):
	return math.exp(re) * math.sin(im)

Julia

function code(re, im)
	return Float64(exp(re) * sin(im))
end

MATLAB

function tmp = code(re, im)
	tmp = exp(re) * sin(im);
end

Wolfram

code[re_, im_] := N[(N[Exp[re], $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ e^{re} \cdot \sin im \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (* (exp re) (sin im)))

C

double code(double re, double im) {
	return exp(re) * sin(im);
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = exp(re) * sin(im)
end function

Java

public static double code(double re, double im) {
	return Math.exp(re) * Math.sin(im);
}

Python

def code(re, im):
	return math.exp(re) * math.sin(im)

Julia

function code(re, im)
	return Float64(exp(re) * sin(im))
end

MATLAB

function tmp = code(re, im)
	tmp = exp(re) * sin(im);
end

Wolfram

code[re_, im_] := N[(N[Exp[re], $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[e^{re} \cdot \sin im \]
2. Add Preprocessing

Alternative 2: 92.4% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{re} \cdot im\\ t_1 := e^{re} \cdot \sin im\\ t_2 := \sin im \cdot \left(re - -1\right)\\ \mathbf{if}\;t\_1 \leq -\infty:\\ \;\;\;\;e^{re} \cdot \left(im \cdot \mathsf{fma}\left(-0.16666666666666666 \cdot im, im, 1\right)\right)\\ \mathbf{elif}\;t\_1 \leq -0.1:\\ \;\;\;\;t\_2\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{-79}:\\ \;\;\;\;t\_0\\ \mathbf{elif}\;t\_1 \leq 4 \cdot 10^{+86}:\\ \;\;\;\;t\_2\\ \mathbf{else}:\\ \;\;\;\;t\_0\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) im))
        (t_1 (* (exp re) (sin im)))
        (t_2 (* (sin im) (- re -1.0))))
   (if (<= t_1 (- INFINITY))
     (* (exp re) (* im (fma (* -0.16666666666666666 im) im 1.0)))
     (if (<= t_1 -0.1)
       t_2
       (if (<= t_1 4e-79) t_0 (if (<= t_1 4e+86) t_2 t_0))))))

C

double code(double re, double im) {
	double t_0 = exp(re) * im;
	double t_1 = exp(re) * sin(im);
	double t_2 = sin(im) * (re - -1.0);
	double tmp;
	if (t_1 <= -((double) INFINITY)) {
		tmp = exp(re) * (im * fma((-0.16666666666666666 * im), im, 1.0));
	} else if (t_1 <= -0.1) {
		tmp = t_2;
	} else if (t_1 <= 4e-79) {
		tmp = t_0;
	} else if (t_1 <= 4e+86) {
		tmp = t_2;
	} else {
		tmp = t_0;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(exp(re) * im)
	t_1 = Float64(exp(re) * sin(im))
	t_2 = Float64(sin(im) * Float64(re - -1.0))
	tmp = 0.0
	if (t_1 <= Float64(-Inf))
		tmp = Float64(exp(re) * Float64(im * fma(Float64(-0.16666666666666666 * im), im, 1.0)));
	elseif (t_1 <= -0.1)
		tmp = t_2;
	elseif (t_1 <= 4e-79)
		tmp = t_0;
	elseif (t_1 <= 4e+86)
		tmp = t_2;
	else
		tmp = t_0;
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision]}, Block[{t$95$1 = N[(N[Exp[re], $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$2 = N[(N[Sin[im], $MachinePrecision] * N[(re - -1.0), $MachinePrecision]), $MachinePrecision]}, If[LessEqual[t$95$1, (-Infinity)], N[(N[Exp[re], $MachinePrecision] * N[(im * N[(N[(-0.16666666666666666 * im), $MachinePrecision] * im + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$1, -0.1], t$95$2, If[LessEqual[t$95$1, 4e-79], t$95$0, If[LessEqual[t$95$1, 4e+86], t$95$2, t$95$0]]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -inf.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]

   2. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{\left(im \cdot \left(1 + \frac{-1}{6} \cdot {im}^{2}\right)\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \color{blue}{\left(1 + \frac{-1}{6} \cdot {im}^{2}\right)}\right) \]

      2. lower-+.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(1 + \color{blue}{\frac{-1}{6} \cdot {im}^{2}}\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(1 + \frac{-1}{6} \cdot \color{blue}{{im}^{2}}\right)\right) \]

      4. lower-pow.f64 60.8

         \[\leadsto e^{re} \cdot \left(im \cdot \left(1 + -0.16666666666666666 \cdot {im}^{\color{blue}{2}}\right)\right) \]

   4. Applied rewrites 60.8%

      \[\leadsto e^{re} \cdot \color{blue}{\left(im \cdot \left(1 + -0.16666666666666666 \cdot {im}^{2}\right)\right)} \]
   5. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(1 + \color{blue}{\frac{-1}{6} \cdot {im}^{2}}\right)\right) \]

      2. +-commutative N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(\frac{-1}{6} \cdot {im}^{2} + \color{blue}{1}\right)\right) \]

      3. lift-*.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(\frac{-1}{6} \cdot {im}^{2} + 1\right)\right) \]

      4. lift-pow.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(\frac{-1}{6} \cdot {im}^{2} + 1\right)\right) \]

      5. unpow2 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(\frac{-1}{6} \cdot \left(im \cdot im\right) + 1\right)\right) \]

      6. associate-*r* N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(\left(\frac{-1}{6} \cdot im\right) \cdot im + 1\right)\right) \]

      7. lower-fma.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \mathsf{fma}\left(\frac{-1}{6} \cdot im, \color{blue}{im}, 1\right)\right) \]

      8. lower-*.f64 60.8

         \[\leadsto e^{re} \cdot \left(im \cdot \mathsf{fma}\left(-0.16666666666666666 \cdot im, im, 1\right)\right) \]

   6. Applied rewrites 60.8%

      \[\leadsto e^{re} \cdot \left(im \cdot \mathsf{fma}\left(-0.16666666666666666 \cdot im, \color{blue}{im}, 1\right)\right) \]

   if -inf.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < -0.10000000000000001 or 4e-79 < (*.f64 (exp.f64 re) (sin.f64 im)) < 4.0000000000000001e86

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\left(1 + re\right)} \cdot \sin im \]
   3. Step-by-step derivation

      1. lower-+.f64 50.8

         \[\leadsto \left(1 + \color{blue}{re}\right) \cdot \sin im \]

   4. Applied rewrites 50.8%

      \[\leadsto \color{blue}{\left(1 + re\right)} \cdot \sin im \]
   5. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{\left(1 + re\right) \cdot \sin im} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\sin im \cdot \left(1 + re\right)} \]

      3. lower-*.f64 50.8

         \[\leadsto \color{blue}{\sin im \cdot \left(1 + re\right)} \]

      4. lift-+.f64 N/A

         \[\leadsto \sin im \cdot \left(1 + \color{blue}{re}\right) \]

      5. +-commutative N/A

         \[\leadsto \sin im \cdot \left(re + \color{blue}{1}\right) \]

      6. add-flip N/A

         \[\leadsto \sin im \cdot \left(re - \color{blue}{\left(\mathsf{neg}\left(1\right)\right)}\right) \]

      7. lower--.f64 N/A

         \[\leadsto \sin im \cdot \left(re - \color{blue}{\left(\mathsf{neg}\left(1\right)\right)}\right) \]

      8. metadata-eval 50.8

         \[\leadsto \sin im \cdot \left(re - -1\right) \]

   6. Applied rewrites 50.8%

      \[\leadsto \color{blue}{\sin im \cdot \left(re - -1\right)} \]

   if -0.10000000000000001 < (*.f64 (exp.f64 re) (sin.f64 im)) < 4e-79 or 4.0000000000000001e86 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]

   2. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{im} \]
   3. Step-by-step derivation

   4. Applied rewrites 69.4%

      \[\leadsto e^{re} \cdot \color{blue}{im} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 3: 92.1% accurate, 0.2× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} t_0 := e^{re} \cdot \sin im\\ t_1 := e^{re} \cdot im\\ \mathbf{if}\;t\_0 \leq -\infty:\\ \;\;\;\;e^{re} \cdot \left(im \cdot \mathsf{fma}\left(-0.16666666666666666 \cdot im, im, 1\right)\right)\\ \mathbf{elif}\;t\_0 \leq -0.1:\\ \;\;\;\;\sin im\\ \mathbf{elif}\;t\_0 \leq 4 \cdot 10^{-79}:\\ \;\;\;\;t\_1\\ \mathbf{elif}\;t\_0 \leq 4 \cdot 10^{+86}:\\ \;\;\;\;\sin im\\ \mathbf{else}:\\ \;\;\;\;t\_1\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (let* ((t_0 (* (exp re) (sin im))) (t_1 (* (exp re) im)))
   (if (<= t_0 (- INFINITY))
     (* (exp re) (* im (fma (* -0.16666666666666666 im) im 1.0)))
     (if (<= t_0 -0.1)
       (sin im)
       (if (<= t_0 4e-79) t_1 (if (<= t_0 4e+86) (sin im) t_1))))))

C

double code(double re, double im) {
	double t_0 = exp(re) * sin(im);
	double t_1 = exp(re) * im;
	double tmp;
	if (t_0 <= -((double) INFINITY)) {
		tmp = exp(re) * (im * fma((-0.16666666666666666 * im), im, 1.0));
	} else if (t_0 <= -0.1) {
		tmp = sin(im);
	} else if (t_0 <= 4e-79) {
		tmp = t_1;
	} else if (t_0 <= 4e+86) {
		tmp = sin(im);
	} else {
		tmp = t_1;
	}
	return tmp;
}

Julia

function code(re, im)
	t_0 = Float64(exp(re) * sin(im))
	t_1 = Float64(exp(re) * im)
	tmp = 0.0
	if (t_0 <= Float64(-Inf))
		tmp = Float64(exp(re) * Float64(im * fma(Float64(-0.16666666666666666 * im), im, 1.0)));
	elseif (t_0 <= -0.1)
		tmp = sin(im);
	elseif (t_0 <= 4e-79)
		tmp = t_1;
	elseif (t_0 <= 4e+86)
		tmp = sin(im);
	else
		tmp = t_1;
	end
	return tmp
end

Wolfram

code[re_, im_] := Block[{t$95$0 = N[(N[Exp[re], $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision]}, Block[{t$95$1 = N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision]}, If[LessEqual[t$95$0, (-Infinity)], N[(N[Exp[re], $MachinePrecision] * N[(im * N[(N[(-0.16666666666666666 * im), $MachinePrecision] * im + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], If[LessEqual[t$95$0, -0.1], N[Sin[im], $MachinePrecision], If[LessEqual[t$95$0, 4e-79], t$95$1, If[LessEqual[t$95$0, 4e+86], N[Sin[im], $MachinePrecision], t$95$1]]]]]]

Derivation

1. Split input into 3 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -inf.0

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]

   2. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{\left(im \cdot \left(1 + \frac{-1}{6} \cdot {im}^{2}\right)\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \color{blue}{\left(1 + \frac{-1}{6} \cdot {im}^{2}\right)}\right) \]

      2. lower-+.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(1 + \color{blue}{\frac{-1}{6} \cdot {im}^{2}}\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(1 + \frac{-1}{6} \cdot \color{blue}{{im}^{2}}\right)\right) \]

      4. lower-pow.f64 60.8

         \[\leadsto e^{re} \cdot \left(im \cdot \left(1 + -0.16666666666666666 \cdot {im}^{\color{blue}{2}}\right)\right) \]

   4. Applied rewrites 60.8%

      \[\leadsto e^{re} \cdot \color{blue}{\left(im \cdot \left(1 + -0.16666666666666666 \cdot {im}^{2}\right)\right)} \]
   5. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(1 + \color{blue}{\frac{-1}{6} \cdot {im}^{2}}\right)\right) \]

      2. +-commutative N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(\frac{-1}{6} \cdot {im}^{2} + \color{blue}{1}\right)\right) \]

      3. lift-*.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(\frac{-1}{6} \cdot {im}^{2} + 1\right)\right) \]

      4. lift-pow.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(\frac{-1}{6} \cdot {im}^{2} + 1\right)\right) \]

      5. unpow2 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(\frac{-1}{6} \cdot \left(im \cdot im\right) + 1\right)\right) \]

      6. associate-*r* N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(\left(\frac{-1}{6} \cdot im\right) \cdot im + 1\right)\right) \]

      7. lower-fma.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \mathsf{fma}\left(\frac{-1}{6} \cdot im, \color{blue}{im}, 1\right)\right) \]

      8. lower-*.f64 60.8

         \[\leadsto e^{re} \cdot \left(im \cdot \mathsf{fma}\left(-0.16666666666666666 \cdot im, im, 1\right)\right) \]

   6. Applied rewrites 60.8%

      \[\leadsto e^{re} \cdot \left(im \cdot \mathsf{fma}\left(-0.16666666666666666 \cdot im, \color{blue}{im}, 1\right)\right) \]

   if -inf.0 < (*.f64 (exp.f64 re) (sin.f64 im)) < -0.10000000000000001 or 4e-79 < (*.f64 (exp.f64 re) (sin.f64 im)) < 4.0000000000000001e86

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\sin im} \]
   3. Step-by-step derivation

      1. lower-sin.f64 50.3

         \[\leadsto \sin im \]

   4. Applied rewrites 50.3%

      \[\leadsto \color{blue}{\sin im} \]

   if -0.10000000000000001 < (*.f64 (exp.f64 re) (sin.f64 im)) < 4e-79 or 4.0000000000000001e86 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]

   2. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{im} \]
   3. Step-by-step derivation

   4. Applied rewrites 69.4%

      \[\leadsto e^{re} \cdot \color{blue}{im} \]
3. Recombined 3 regimes into one program.
4. Add Preprocessing

Alternative 4: 69.4% accurate, 0.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{re} \cdot \sin im \leq -0.1:\\ \;\;\;\;e^{re} \cdot \left(im \cdot \mathsf{fma}\left(-0.16666666666666666 \cdot im, im, 1\right)\right)\\ \mathbf{else}:\\ \;\;\;\;e^{re} \cdot im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (exp re) (sin im)) -0.1)
   (* (exp re) (* im (fma (* -0.16666666666666666 im) im 1.0)))
   (* (exp re) im)))

C

double code(double re, double im) {
	double tmp;
	if ((exp(re) * sin(im)) <= -0.1) {
		tmp = exp(re) * (im * fma((-0.16666666666666666 * im), im, 1.0));
	} else {
		tmp = exp(re) * im;
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(exp(re) * sin(im)) <= -0.1)
		tmp = Float64(exp(re) * Float64(im * fma(Float64(-0.16666666666666666 * im), im, 1.0)));
	else
		tmp = Float64(exp(re) * im);
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[N[(N[Exp[re], $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision], -0.1], N[(N[Exp[re], $MachinePrecision] * N[(im * N[(N[(-0.16666666666666666 * im), $MachinePrecision] * im + 1.0), $MachinePrecision]), $MachinePrecision]), $MachinePrecision], N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -0.10000000000000001

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]

   2. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{\left(im \cdot \left(1 + \frac{-1}{6} \cdot {im}^{2}\right)\right)} \]
   3. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \color{blue}{\left(1 + \frac{-1}{6} \cdot {im}^{2}\right)}\right) \]

      2. lower-+.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(1 + \color{blue}{\frac{-1}{6} \cdot {im}^{2}}\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(1 + \frac{-1}{6} \cdot \color{blue}{{im}^{2}}\right)\right) \]

      4. lower-pow.f64 60.8

         \[\leadsto e^{re} \cdot \left(im \cdot \left(1 + -0.16666666666666666 \cdot {im}^{\color{blue}{2}}\right)\right) \]

   4. Applied rewrites 60.8%

      \[\leadsto e^{re} \cdot \color{blue}{\left(im \cdot \left(1 + -0.16666666666666666 \cdot {im}^{2}\right)\right)} \]
   5. Step-by-step derivation

      1. lift-+.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(1 + \color{blue}{\frac{-1}{6} \cdot {im}^{2}}\right)\right) \]

      2. +-commutative N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(\frac{-1}{6} \cdot {im}^{2} + \color{blue}{1}\right)\right) \]

      3. lift-*.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(\frac{-1}{6} \cdot {im}^{2} + 1\right)\right) \]

      4. lift-pow.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(\frac{-1}{6} \cdot {im}^{2} + 1\right)\right) \]

      5. unpow2 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(\frac{-1}{6} \cdot \left(im \cdot im\right) + 1\right)\right) \]

      6. associate-*r* N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \left(\left(\frac{-1}{6} \cdot im\right) \cdot im + 1\right)\right) \]

      7. lower-fma.f64 N/A

         \[\leadsto e^{re} \cdot \left(im \cdot \mathsf{fma}\left(\frac{-1}{6} \cdot im, \color{blue}{im}, 1\right)\right) \]

      8. lower-*.f64 60.8

         \[\leadsto e^{re} \cdot \left(im \cdot \mathsf{fma}\left(-0.16666666666666666 \cdot im, im, 1\right)\right) \]

   6. Applied rewrites 60.8%

      \[\leadsto e^{re} \cdot \left(im \cdot \mathsf{fma}\left(-0.16666666666666666 \cdot im, \color{blue}{im}, 1\right)\right) \]

   if -0.10000000000000001 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]

   2. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{im} \]
   3. Step-by-step derivation

   4. Applied rewrites 69.4%

      \[\leadsto e^{re} \cdot \color{blue}{im} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 5: 69.2% accurate, 0.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{re} \cdot \sin im \leq -0.1:\\ \;\;\;\;\left(\mathsf{fma}\left(-0.16666666666666666 \cdot im, im, 1\right) \cdot im\right) \cdot \left(re - -1\right)\\ \mathbf{else}:\\ \;\;\;\;e^{re} \cdot im\\ \end{array} \end{array} \]

FPCore

(FPCore (re im)
 :precision binary64
 (if (<= (* (exp re) (sin im)) -0.1)
   (* (* (fma (* -0.16666666666666666 im) im 1.0) im) (- re -1.0))
   (* (exp re) im)))

C

double code(double re, double im) {
	double tmp;
	if ((exp(re) * sin(im)) <= -0.1) {
		tmp = (fma((-0.16666666666666666 * im), im, 1.0) * im) * (re - -1.0);
	} else {
		tmp = exp(re) * im;
	}
	return tmp;
}

Julia

function code(re, im)
	tmp = 0.0
	if (Float64(exp(re) * sin(im)) <= -0.1)
		tmp = Float64(Float64(fma(Float64(-0.16666666666666666 * im), im, 1.0) * im) * Float64(re - -1.0));
	else
		tmp = Float64(exp(re) * im);
	end
	return tmp
end

Wolfram

code[re_, im_] := If[LessEqual[N[(N[Exp[re], $MachinePrecision] * N[Sin[im], $MachinePrecision]), $MachinePrecision], -0.1], N[(N[(N[(N[(-0.16666666666666666 * im), $MachinePrecision] * im + 1.0), $MachinePrecision] * im), $MachinePrecision] * N[(re - -1.0), $MachinePrecision]), $MachinePrecision], N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 re) (sin.f64 im)) < -0.10000000000000001

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]

   2. Taylor expanded in re around 0

      \[\leadsto \color{blue}{\left(1 + re\right)} \cdot \sin im \]
   3. Step-by-step derivation

      1. lower-+.f64 50.8

         \[\leadsto \left(1 + \color{blue}{re}\right) \cdot \sin im \]

   4. Applied rewrites 50.8%

      \[\leadsto \color{blue}{\left(1 + re\right)} \cdot \sin im \]

   5. Taylor expanded in im around 0

      \[\leadsto \left(1 + re\right) \cdot \color{blue}{\left(im \cdot \left(1 + \frac{-1}{6} \cdot {im}^{2}\right)\right)} \]
   6. Step-by-step derivation

      1. lower-*.f64 N/A

         \[\leadsto \left(1 + re\right) \cdot \left(im \cdot \color{blue}{\left(1 + \frac{-1}{6} \cdot {im}^{2}\right)}\right) \]

      2. lower-+.f64 N/A

         \[\leadsto \left(1 + re\right) \cdot \left(im \cdot \left(1 + \color{blue}{\frac{-1}{6} \cdot {im}^{2}}\right)\right) \]

      3. lower-*.f64 N/A

         \[\leadsto \left(1 + re\right) \cdot \left(im \cdot \left(1 + \frac{-1}{6} \cdot \color{blue}{{im}^{2}}\right)\right) \]

      4. lower-pow.f64 31.1

         \[\leadsto \left(1 + re\right) \cdot \left(im \cdot \left(1 + -0.16666666666666666 \cdot {im}^{\color{blue}{2}}\right)\right) \]

   7. Applied rewrites 31.1%

      \[\leadsto \left(1 + re\right) \cdot \color{blue}{\left(im \cdot \left(1 + -0.16666666666666666 \cdot {im}^{2}\right)\right)} \]
   8. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{\left(1 + re\right) \cdot \left(im \cdot \left(1 + \frac{-1}{6} \cdot {im}^{2}\right)\right)} \]

      2. *-commutative N/A

         \[\leadsto \color{blue}{\left(im \cdot \left(1 + \frac{-1}{6} \cdot {im}^{2}\right)\right) \cdot \left(1 + re\right)} \]

   9. Applied rewrites 31.1%

      \[\leadsto \color{blue}{\left(\mathsf{fma}\left(-0.16666666666666666 \cdot im, im, 1\right) \cdot im\right) \cdot \left(re - -1\right)} \]

   if -0.10000000000000001 < (*.f64 (exp.f64 re) (sin.f64 im))

   1. Initial program 100.0%

      \[e^{re} \cdot \sin im \]

   2. Taylor expanded in im around 0

      \[\leadsto e^{re} \cdot \color{blue}{im} \]
   3. Step-by-step derivation

   4. Applied rewrites 69.4%

      \[\leadsto e^{re} \cdot \color{blue}{im} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 6: 62.7% accurate, 3.3× speedup

Math

\[\begin{array}{l} \\ e^{re} \cdot im \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (* (exp re) im))

C

double code(double re, double im) {
	return exp(re) * im;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = exp(re) * im
end function

Java

public static double code(double re, double im) {
	return Math.exp(re) * im;
}

Python

def code(re, im):
	return math.exp(re) * im

Julia

function code(re, im)
	return Float64(exp(re) * im)
end

MATLAB

function tmp = code(re, im)
	tmp = exp(re) * im;
end

Wolfram

code[re_, im_] := N[(N[Exp[re], $MachinePrecision] * im), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[e^{re} \cdot \sin im \]

2. Taylor expanded in im around 0

   \[\leadsto e^{re} \cdot \color{blue}{im} \]
3. Step-by-step derivation

4. Applied rewrites 69.4%

   \[\leadsto e^{re} \cdot \color{blue}{im} \]
5. Add Preprocessing

Alternative 7: 29.1% accurate, 7.0× speedup

Math

\[\begin{array}{l} \\ \left(re - -1\right) \cdot im \end{array} \]

FPCore

(FPCore (re im) :precision binary64 (* (- re -1.0) im))

C

double code(double re, double im) {
	return (re - -1.0) * im;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = (re - (-1.0d0)) * im
end function

Java

public static double code(double re, double im) {
	return (re - -1.0) * im;
}

Python

def code(re, im):
	return (re - -1.0) * im

Julia

function code(re, im)
	return Float64(Float64(re - -1.0) * im)
end

MATLAB

function tmp = code(re, im)
	tmp = (re - -1.0) * im;
end

Wolfram

code[re_, im_] := N[(N[(re - -1.0), $MachinePrecision] * im), $MachinePrecision]

Derivation

1. Initial program 100.0%

   \[e^{re} \cdot \sin im \]
2. Step-by-step derivation

   1. lift-exp.f64 N/A

      \[\leadsto \color{blue}{e^{re}} \cdot \sin im \]

   2. exp-fabs N/A

      \[\leadsto \color{blue}{\left|e^{re}\right|} \cdot \sin im \]

   3. lift-exp.f64 N/A

      \[\leadsto \left|\color{blue}{e^{re}}\right| \cdot \sin im \]

   4. rem-sqrt-square-rev N/A

      \[\leadsto \color{blue}{\sqrt{e^{re} \cdot e^{re}}} \cdot \sin im \]

   5. lower-sqrt.f64 N/A

      \[\leadsto \color{blue}{\sqrt{e^{re} \cdot e^{re}}} \cdot \sin im \]

   6. lift-exp.f64 N/A

      \[\leadsto \sqrt{\color{blue}{e^{re}} \cdot e^{re}} \cdot \sin im \]

   7. lift-exp.f64 N/A

      \[\leadsto \sqrt{e^{re} \cdot \color{blue}{e^{re}}} \cdot \sin im \]

   8. exp-lft-sqr-rev N/A

      \[\leadsto \sqrt{\color{blue}{e^{re \cdot 2}}} \cdot \sin im \]

   9. lower-exp.f64 N/A

      \[\leadsto \sqrt{\color{blue}{e^{re \cdot 2}}} \cdot \sin im \]

   10. *-commutative N/A

       \[\leadsto \sqrt{e^{\color{blue}{2 \cdot re}}} \cdot \sin im \]

   11. count-2 N/A

       \[\leadsto \sqrt{e^{\color{blue}{re + re}}} \cdot \sin im \]

   12. lower-+.f64 100.0

       \[\leadsto \sqrt{e^{\color{blue}{re + re}}} \cdot \sin im \]

3. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\sqrt{e^{re + re}}} \cdot \sin im \]

4. Taylor expanded in im around 0

   \[\leadsto \color{blue}{im \cdot \sqrt{e^{2 \cdot re}}} \]
5. Step-by-step derivation

   1. lower-*.f64 N/A

      \[\leadsto im \cdot \color{blue}{\sqrt{e^{2 \cdot re}}} \]

   2. lower-sqrt.f64 N/A

      \[\leadsto im \cdot \sqrt{e^{2 \cdot re}} \]

   3. lower-exp.f64 N/A

      \[\leadsto im \cdot \sqrt{e^{2 \cdot re}} \]

   4. lower-*.f64 69.4

      \[\leadsto im \cdot \sqrt{e^{2 \cdot re}} \]

6. Applied rewrites 69.4%

   \[\leadsto \color{blue}{im \cdot \sqrt{e^{2 \cdot re}}} \]

7. Taylor expanded in re around 0

   \[\leadsto im \cdot \left(1 + \color{blue}{re}\right) \]
8. Step-by-step derivation

   1. lower-+.f64 29.1

      \[\leadsto im \cdot \left(1 + re\right) \]

9. Applied rewrites 29.1%

   \[\leadsto im \cdot \left(1 + \color{blue}{re}\right) \]
10. Step-by-step derivation

    1. lift-*.f64 N/A

       \[\leadsto im \cdot \color{blue}{\left(1 + re\right)} \]

    2. *-commutative N/A

       \[\leadsto \left(1 + re\right) \cdot \color{blue}{im} \]

    3. *-commutative N/A

       \[\leadsto \left(1 + re\right) \cdot im \]

    4. exp-lft-sqr-rev N/A

       \[\leadsto \left(1 + re\right) \cdot im \]

    5. rem-sqrt-square-rev N/A

       \[\leadsto \left(1 + re\right) \cdot im \]

    6. exp-fabs N/A

       \[\leadsto \left(1 + re\right) \cdot im \]

    7. lift-+.f64 N/A

       \[\leadsto \left(1 + re\right) \cdot im \]

    8. +-commutative N/A

       \[\leadsto \left(re + 1\right) \cdot im \]

    9. metadata-eval N/A

       \[\leadsto \left(re + \left(\mathsf{neg}\left(-1\right)\right)\right) \cdot im \]

    10. sub-flip N/A

        \[\leadsto \left(re - -1\right) \cdot im \]

    11. lift--.f64 N/A

        \[\leadsto \left(re - -1\right) \cdot im \]

    12. lower-*.f64 29.1

        \[\leadsto \left(re - -1\right) \cdot \color{blue}{im} \]

11. Applied rewrites 29.1%

    \[\leadsto \color{blue}{\left(re - -1\right) \cdot im} \]
12. Add Preprocessing

Alternative 8: 26.3% accurate, 45.8× speedup

Math

\[\begin{array}{l} \\ im \end{array} \]

FPCore

(FPCore (re im) :precision binary64 im)

C

double code(double re, double im) {
	return im;
}

Fortran

module fmin_fmax_functions
    implicit none
    private
    public fmax
    public fmin

    interface fmax
        module procedure fmax88
        module procedure fmax44
        module procedure fmax84
        module procedure fmax48
    end interface
    interface fmin
        module procedure fmin88
        module procedure fmin44
        module procedure fmin84
        module procedure fmin48
    end interface
contains
    real(8) function fmax88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(4) function fmax44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, max(x, y), y /= y), x /= x)
    end function
    real(8) function fmax84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, max(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmax48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), max(dble(x), y), y /= y), x /= x)
    end function
    real(8) function fmin88(x, y) result (res)
        real(8), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(4) function fmin44(x, y) result (res)
        real(4), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(y, merge(x, min(x, y), y /= y), x /= x)
    end function
    real(8) function fmin84(x, y) result(res)
        real(8), intent (in) :: x
        real(4), intent (in) :: y
        res = merge(dble(y), merge(x, min(x, dble(y)), y /= y), x /= x)
    end function
    real(8) function fmin48(x, y) result(res)
        real(4), intent (in) :: x
        real(8), intent (in) :: y
        res = merge(y, merge(dble(x), min(dble(x), y), y /= y), x /= x)
    end function
end module

real(8) function code(re, im)
use fmin_fmax_functions
    real(8), intent (in) :: re
    real(8), intent (in) :: im
    code = im
end function

Java

public static double code(double re, double im) {
	return im;
}

Python

def code(re, im):
	return im

Julia

function code(re, im)
	return im
end

MATLAB

function tmp = code(re, im)
	tmp = im;
end

Wolfram

code[re_, im_] := im

Derivation

1. Initial program 100.0%

   \[e^{re} \cdot \sin im \]
2. Step-by-step derivation

   1. lift-exp.f64 N/A

      \[\leadsto \color{blue}{e^{re}} \cdot \sin im \]

   2. exp-fabs N/A

      \[\leadsto \color{blue}{\left|e^{re}\right|} \cdot \sin im \]

   3. lift-exp.f64 N/A

      \[\leadsto \left|\color{blue}{e^{re}}\right| \cdot \sin im \]

   4. rem-sqrt-square-rev N/A

      \[\leadsto \color{blue}{\sqrt{e^{re} \cdot e^{re}}} \cdot \sin im \]

   5. lower-sqrt.f64 N/A

      \[\leadsto \color{blue}{\sqrt{e^{re} \cdot e^{re}}} \cdot \sin im \]

   6. lift-exp.f64 N/A

      \[\leadsto \sqrt{\color{blue}{e^{re}} \cdot e^{re}} \cdot \sin im \]

   7. lift-exp.f64 N/A

      \[\leadsto \sqrt{e^{re} \cdot \color{blue}{e^{re}}} \cdot \sin im \]

   8. exp-lft-sqr-rev N/A

      \[\leadsto \sqrt{\color{blue}{e^{re \cdot 2}}} \cdot \sin im \]

   9. lower-exp.f64 N/A

      \[\leadsto \sqrt{\color{blue}{e^{re \cdot 2}}} \cdot \sin im \]

   10. *-commutative N/A

       \[\leadsto \sqrt{e^{\color{blue}{2 \cdot re}}} \cdot \sin im \]

   11. count-2 N/A

       \[\leadsto \sqrt{e^{\color{blue}{re + re}}} \cdot \sin im \]

   12. lower-+.f64 100.0

       \[\leadsto \sqrt{e^{\color{blue}{re + re}}} \cdot \sin im \]

3. Applied rewrites 100.0%

   \[\leadsto \color{blue}{\sqrt{e^{re + re}}} \cdot \sin im \]

4. Taylor expanded in im around 0

   \[\leadsto \color{blue}{im \cdot \sqrt{e^{2 \cdot re}}} \]
5. Step-by-step derivation

   1. lower-*.f64 N/A

      \[\leadsto im \cdot \color{blue}{\sqrt{e^{2 \cdot re}}} \]

   2. lower-sqrt.f64 N/A

      \[\leadsto im \cdot \sqrt{e^{2 \cdot re}} \]

   3. lower-exp.f64 N/A

      \[\leadsto im \cdot \sqrt{e^{2 \cdot re}} \]

   4. lower-*.f64 69.4

      \[\leadsto im \cdot \sqrt{e^{2 \cdot re}} \]

6. Applied rewrites 69.4%

   \[\leadsto \color{blue}{im \cdot \sqrt{e^{2 \cdot re}}} \]

7. Taylor expanded in re around 0

   \[\leadsto im \]
8. Step-by-step derivation

9. Applied rewrites 26.3%

   \[\leadsto im \]
10. Add Preprocessing

Reproduce

herbie shell --seed 2025150 
(FPCore (re im)
  :name "math.exp on complex, imaginary part"
  :precision binary64
  (* (exp re) (sin im)))