exp-w (used to crash)

Percentage Accurate: 99.4% → 99.3%

Time: 13.2s

Alternatives: 15

Speedup: 1.0×

• could not determine a ground truth

  1. w = 3.724828925590435e-284
  2. l = -1.6144394270808916e+242

Specification

Math

\[\begin{array}{l} \\ e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \end{array} \]

FPCore

(FPCore (w l) :precision binary64 (* (exp (- w)) (pow l (exp w))))

C

double code(double w, double l) {
	return exp(-w) * pow(l, exp(w));
}

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(w, l)
use fmin_fmax_functions
    real(8), intent (in) :: w
    real(8), intent (in) :: l
    code = exp(-w) * (l ** exp(w))
end function

Java

public static double code(double w, double l) {
	return Math.exp(-w) * Math.pow(l, Math.exp(w));
}

Python

def code(w, l):
	return math.exp(-w) * math.pow(l, math.exp(w))

Julia

function code(w, l)
	return Float64(exp(Float64(-w)) * (l ^ exp(w)))
end

MATLAB

function tmp = code(w, l)
	tmp = exp(-w) * (l ^ exp(w));
end

Wolfram

code[w_, l_] := N[(N[Exp[(-w)], $MachinePrecision] * N[Power[l, N[Exp[w], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Initial Program: 99.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \end{array} \]

FPCore

(FPCore (w l) :precision binary64 (* (exp (- w)) (pow l (exp w))))

C

double code(double w, double l) {
	return exp(-w) * pow(l, exp(w));
}

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(w, l)
use fmin_fmax_functions
    real(8), intent (in) :: w
    real(8), intent (in) :: l
    code = exp(-w) * (l ** exp(w))
end function

Java

public static double code(double w, double l) {
	return Math.exp(-w) * Math.pow(l, Math.exp(w));
}

Python

def code(w, l):
	return math.exp(-w) * math.pow(l, math.exp(w))

Julia

function code(w, l)
	return Float64(exp(Float64(-w)) * (l ^ exp(w)))
end

MATLAB

function tmp = code(w, l)
	tmp = exp(-w) * (l ^ exp(w));
end

Wolfram

code[w_, l_] := N[(N[Exp[(-w)], $MachinePrecision] * N[Power[l, N[Exp[w], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Alternative 1: 99.3% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;w \leq -1.1 \cdot 10^{-14}:\\ \;\;\;\;e^{\mathsf{fma}\left(\log \ell, e^{w}, -w\right)}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot {\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, w, 0.5\right), w, 1\right), w, 1\right)\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -1.1e-14)
   (exp (fma (log l) (exp w) (- w)))
   (* 1.0 (pow l (fma (fma (fma 0.16666666666666666 w 0.5) w 1.0) w 1.0)))))

C

double code(double w, double l) {
	double tmp;
	if (w <= -1.1e-14) {
		tmp = exp(fma(log(l), exp(w), -w));
	} else {
		tmp = 1.0 * pow(l, fma(fma(fma(0.16666666666666666, w, 0.5), w, 1.0), w, 1.0));
	}
	return tmp;
}

Julia

function code(w, l)
	tmp = 0.0
	if (w <= -1.1e-14)
		tmp = exp(fma(log(l), exp(w), Float64(-w)));
	else
		tmp = Float64(1.0 * (l ^ fma(fma(fma(0.16666666666666666, w, 0.5), w, 1.0), w, 1.0)));
	end
	return tmp
end

Wolfram

code[w_, l_] := If[LessEqual[w, -1.1e-14], N[Exp[N[(N[Log[l], $MachinePrecision] * N[Exp[w], $MachinePrecision] + (-w)), $MachinePrecision]], $MachinePrecision], N[(1.0 * N[Power[l, N[(N[(N[(0.16666666666666666 * w + 0.5), $MachinePrecision] * w + 1.0), $MachinePrecision] * w + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if w < -1.1e-14

   1. Initial program 99.8%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing
   3. Step-by-step derivation

      1. lift-*.f64 N/A

         \[\leadsto \color{blue}{e^{-w} \cdot {\ell}^{\left(e^{w}\right)}} \]

      2. lift-neg.f64 N/A

         \[\leadsto e^{\color{blue}{\mathsf{neg}\left(w\right)}} \cdot {\ell}^{\left(e^{w}\right)} \]

      3. lift-exp.f64 N/A

         \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)}} \cdot {\ell}^{\left(e^{w}\right)} \]

      4. lift-exp.f64 N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \cdot {\ell}^{\color{blue}{\left(e^{w}\right)}} \]

      5. lift-pow.f64 N/A

         \[\leadsto e^{\mathsf{neg}\left(w\right)} \cdot \color{blue}{{\ell}^{\left(e^{w}\right)}} \]

      6. *-commutative N/A

         \[\leadsto \color{blue}{{\ell}^{\left(e^{w}\right)} \cdot e^{\mathsf{neg}\left(w\right)}} \]

      7. pow-to-exp N/A

         \[\leadsto \color{blue}{e^{\log \ell \cdot e^{w}}} \cdot e^{\mathsf{neg}\left(w\right)} \]

      8. prod-exp N/A

         \[\leadsto \color{blue}{e^{\log \ell \cdot e^{w} + \left(\mathsf{neg}\left(w\right)\right)}} \]

      9. lower-exp.f64 N/A

         \[\leadsto \color{blue}{e^{\log \ell \cdot e^{w} + \left(\mathsf{neg}\left(w\right)\right)}} \]

      10. lower-fma.f64 N/A

          \[\leadsto e^{\color{blue}{\mathsf{fma}\left(\log \ell, e^{w}, \mathsf{neg}\left(w\right)\right)}} \]

      11. lower-log.f64 N/A

          \[\leadsto e^{\mathsf{fma}\left(\color{blue}{\log \ell}, e^{w}, \mathsf{neg}\left(w\right)\right)} \]

      12. lift-exp.f64 N/A

          \[\leadsto e^{\mathsf{fma}\left(\log \ell, \color{blue}{e^{w}}, \mathsf{neg}\left(w\right)\right)} \]

      13. lift-neg.f64 99.7

          \[\leadsto e^{\mathsf{fma}\left(\log \ell, e^{w}, \color{blue}{-w}\right)} \]

   4. Applied rewrites 99.7%

      \[\leadsto \color{blue}{e^{\mathsf{fma}\left(\log \ell, e^{w}, -w\right)}} \]

   if -1.1e-14 < w

   1. Initial program 99.3%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around 0

      \[\leadsto \color{blue}{1} \cdot {\ell}^{\left(e^{w}\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 99.7%

      \[\leadsto \color{blue}{1} \cdot {\ell}^{\left(e^{w}\right)} \]

   6. Taylor expanded in w around 0

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

      1. +-commutative N/A

         \[\leadsto 1 \cdot {\ell}^{\left(w \cdot \left(1 + w \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot w\right)\right) + \color{blue}{1}\right)} \]

      2. *-commutative N/A

         \[\leadsto 1 \cdot {\ell}^{\left(\left(1 + w \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot w\right)\right) \cdot w + 1\right)} \]

      3. lower-fma.f64 N/A

         \[\leadsto 1 \cdot {\ell}^{\left(\mathsf{fma}\left(1 + w \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot w\right), \color{blue}{w}, 1\right)\right)} \]

      4. +-commutative N/A

         \[\leadsto 1 \cdot {\ell}^{\left(\mathsf{fma}\left(w \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot w\right) + 1, w, 1\right)\right)} \]

      5. *-commutative N/A

         \[\leadsto 1 \cdot {\ell}^{\left(\mathsf{fma}\left(\left(\frac{1}{2} + \frac{1}{6} \cdot w\right) \cdot w + 1, w, 1\right)\right)} \]

      6. lower-fma.f64 N/A

         \[\leadsto 1 \cdot {\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2} + \frac{1}{6} \cdot w, w, 1\right), w, 1\right)\right)} \]

      7. +-commutative N/A

         \[\leadsto 1 \cdot {\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{6} \cdot w + \frac{1}{2}, w, 1\right), w, 1\right)\right)} \]

      8. lower-fma.f64 99.7

         \[\leadsto 1 \cdot {\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, w, 0.5\right), w, 1\right), w, 1\right)\right)} \]

   8. Applied rewrites 99.7%

      \[\leadsto 1 \cdot {\ell}^{\color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, w, 0.5\right), w, 1\right), w, 1\right)\right)}} \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 2: 73.3% accurate, 0.9× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \leq 5 \cdot 10^{+297}:\\ \;\;\;\;\ell\\ \mathbf{else}:\\ \;\;\;\;\left(\left(w \cdot w\right) \cdot 0.5\right) \cdot \ell\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= (* (exp (- w)) (pow l (exp w))) 5e+297) l (* (* (* w w) 0.5) l)))

C

double code(double w, double l) {
	double tmp;
	if ((exp(-w) * pow(l, exp(w))) <= 5e+297) {
		tmp = l;
	} else {
		tmp = ((w * w) * 0.5) * l;
	}
	return tmp;
}

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(w, l)
use fmin_fmax_functions
    real(8), intent (in) :: w
    real(8), intent (in) :: l
    real(8) :: tmp
    if ((exp(-w) * (l ** exp(w))) <= 5d+297) then
        tmp = l
    else
        tmp = ((w * w) * 0.5d0) * l
    end if
    code = tmp
end function

Java

public static double code(double w, double l) {
	double tmp;
	if ((Math.exp(-w) * Math.pow(l, Math.exp(w))) <= 5e+297) {
		tmp = l;
	} else {
		tmp = ((w * w) * 0.5) * l;
	}
	return tmp;
}

Python

def code(w, l):
	tmp = 0
	if (math.exp(-w) * math.pow(l, math.exp(w))) <= 5e+297:
		tmp = l
	else:
		tmp = ((w * w) * 0.5) * l
	return tmp

Julia

function code(w, l)
	tmp = 0.0
	if (Float64(exp(Float64(-w)) * (l ^ exp(w))) <= 5e+297)
		tmp = l;
	else
		tmp = Float64(Float64(Float64(w * w) * 0.5) * l);
	end
	return tmp
end

MATLAB

function tmp_2 = code(w, l)
	tmp = 0.0;
	if ((exp(-w) * (l ^ exp(w))) <= 5e+297)
		tmp = l;
	else
		tmp = ((w * w) * 0.5) * l;
	end
	tmp_2 = tmp;
end

Wolfram

code[w_, l_] := If[LessEqual[N[(N[Exp[(-w)], $MachinePrecision] * N[Power[l, N[Exp[w], $MachinePrecision]], $MachinePrecision]), $MachinePrecision], 5e+297], l, N[(N[(N[(w * w), $MachinePrecision] * 0.5), $MachinePrecision] * l), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if (*.f64 (exp.f64 (neg.f64 w)) (pow.f64 l (exp.f64 w))) < 4.9999999999999998e297

   1. Initial program 99.7%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around 0

      \[\leadsto \color{blue}{\ell} \]
   4. Step-by-step derivation

   5. Applied rewrites 82.6%

      \[\leadsto \color{blue}{\ell} \]

   if 4.9999999999999998e297 < (*.f64 (exp.f64 (neg.f64 w)) (pow.f64 l (exp.f64 w)))

   1. Initial program 98.6%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around 0

      \[\leadsto \color{blue}{\left(1 + w \cdot \left(\frac{1}{2} \cdot w - 1\right)\right)} \cdot {\ell}^{\left(e^{w}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

         \[\leadsto \left(\left(\frac{1}{2} \cdot w - 1\right) \cdot w + 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w - 1, \color{blue}{w}, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

      4. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w - 1 \cdot 1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

      5. fp-cancel-sub-sign-inv N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w + \left(\mathsf{neg}\left(1\right)\right) \cdot 1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

      6. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w + -1 \cdot 1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

      7. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w + -1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

      8. lower-fma.f64 62.8

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   5. Applied rewrites 62.8%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

   6. Taylor expanded in w around 0

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, w, -1\right), w, 1\right) \cdot \color{blue}{\ell} \]
   7. Step-by-step derivation

   8. Applied rewrites 73.1%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right) \cdot \color{blue}{\ell} \]

   9. Taylor expanded in w around inf

      \[\leadsto \left(\frac{1}{2} \cdot \color{blue}{{w}^{2}}\right) \cdot \ell \]
   10. Step-by-step derivation

       1. *-commutative N/A

          \[\leadsto \left({w}^{2} \cdot \frac{1}{2}\right) \cdot \ell \]

       2. lower-*.f64 N/A

          \[\leadsto \left({w}^{2} \cdot \frac{1}{2}\right) \cdot \ell \]

       3. unpow2 N/A

          \[\leadsto \left(\left(w \cdot w\right) \cdot \frac{1}{2}\right) \cdot \ell \]

       4. lower-*.f64 73.1

          \[\leadsto \left(\left(w \cdot w\right) \cdot 0.5\right) \cdot \ell \]

   11. Applied rewrites 73.1%

       \[\leadsto \left(\left(w \cdot w\right) \cdot \color{blue}{0.5}\right) \cdot \ell \]
3. Recombined 2 regimes into one program.
4. Add Preprocessing

Alternative 3: 99.4% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \end{array} \]

FPCore

(FPCore (w l) :precision binary64 (* (exp (- w)) (pow l (exp w))))

C

double code(double w, double l) {
	return exp(-w) * pow(l, exp(w));
}

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(w, l)
use fmin_fmax_functions
    real(8), intent (in) :: w
    real(8), intent (in) :: l
    code = exp(-w) * (l ** exp(w))
end function

Java

public static double code(double w, double l) {
	return Math.exp(-w) * Math.pow(l, Math.exp(w));
}

Python

def code(w, l):
	return math.exp(-w) * math.pow(l, math.exp(w))

Julia

function code(w, l)
	return Float64(exp(Float64(-w)) * (l ^ exp(w)))
end

MATLAB

function tmp = code(w, l)
	tmp = exp(-w) * (l ^ exp(w));
end

Wolfram

code[w_, l_] := N[(N[Exp[(-w)], $MachinePrecision] * N[Power[l, N[Exp[w], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.4%

   \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 4: 98.7% accurate, 1.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;w \leq -4:\\ \;\;\;\;e^{-w}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot {\ell}^{\left(e^{w}\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -4.0) (exp (- w)) (* 1.0 (pow l (exp w)))))

C

double code(double w, double l) {
	double tmp;
	if (w <= -4.0) {
		tmp = exp(-w);
	} else {
		tmp = 1.0 * pow(l, exp(w));
	}
	return tmp;
}

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(w, l)
use fmin_fmax_functions
    real(8), intent (in) :: w
    real(8), intent (in) :: l
    real(8) :: tmp
    if (w <= (-4.0d0)) then
        tmp = exp(-w)
    else
        tmp = 1.0d0 * (l ** exp(w))
    end if
    code = tmp
end function

Java

public static double code(double w, double l) {
	double tmp;
	if (w <= -4.0) {
		tmp = Math.exp(-w);
	} else {
		tmp = 1.0 * Math.pow(l, Math.exp(w));
	}
	return tmp;
}

Python

def code(w, l):
	tmp = 0
	if w <= -4.0:
		tmp = math.exp(-w)
	else:
		tmp = 1.0 * math.pow(l, math.exp(w))
	return tmp

Julia

function code(w, l)
	tmp = 0.0
	if (w <= -4.0)
		tmp = exp(Float64(-w));
	else
		tmp = Float64(1.0 * (l ^ exp(w)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(w, l)
	tmp = 0.0;
	if (w <= -4.0)
		tmp = exp(-w);
	else
		tmp = 1.0 * (l ^ exp(w));
	end
	tmp_2 = tmp;
end

Wolfram

code[w_, l_] := If[LessEqual[w, -4.0], N[Exp[(-w)], $MachinePrecision], N[(1.0 * N[Power[l, N[Exp[w], $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if w < -4

   1. Initial program 100.0%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)} \cdot e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot \color{blue}{e^{\mathsf{neg}\left(w\right)}} \]

      2. exp-prod N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot e^{\color{blue}{\mathsf{neg}\left(w\right)}} \]

      3. mul-1-neg N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot e^{-1 \cdot w} \]

      4. exp-prod N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot {\left(e^{-1}\right)}^{\color{blue}{w}} \]

      5. pow-prod-up N/A

         \[\leadsto {\left(e^{-1}\right)}^{\color{blue}{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right) + w\right)}} \]

      6. lower-pow.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\color{blue}{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right) + w\right)}} \]

      7. lower-exp.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(\color{blue}{e^{w} \cdot \log \left(\frac{1}{\ell}\right)} + w\right)} \]

      8. *-commutative N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(\log \left(\frac{1}{\ell}\right) \cdot e^{w} + w\right)} \]

      9. lower-fma.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(\log \left(\frac{1}{\ell}\right), \color{blue}{e^{w}}, w\right)\right)} \]

      10. log-rec N/A

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(\mathsf{neg}\left(\log \ell\right), e^{\color{blue}{w}}, w\right)\right)} \]

      11. lower-neg.f64 N/A

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{\color{blue}{w}}, w\right)\right)} \]

      12. lower-log.f64 N/A

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{w}, w\right)\right)} \]

      13. lift-exp.f64 99.8

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{w}, w\right)\right)} \]

   5. Applied rewrites 99.8%

      \[\leadsto \color{blue}{{\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{w}, w\right)\right)}} \]

   6. Taylor expanded in w around inf

      \[\leadsto {\left(e^{-1}\right)}^{w} \]
   7. Step-by-step derivation

   8. Applied rewrites 99.8%

      \[\leadsto {\left(e^{-1}\right)}^{w} \]
   9. Step-by-step derivation

      1. lift-exp.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{w} \]

      2. lift-pow.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\color{blue}{w}} \]

      3. pow-exp N/A

         \[\leadsto e^{-1 \cdot w} \]

      4. lower-exp.f64 N/A

         \[\leadsto e^{-1 \cdot w} \]

      5. lower-*.f64 100.0

         \[\leadsto e^{-1 \cdot w} \]

   10. Applied rewrites 100.0%

       \[\leadsto e^{-1 \cdot w} \]

   if -4 < w

   1. Initial program 99.2%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around 0

      \[\leadsto \color{blue}{1} \cdot {\ell}^{\left(e^{w}\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 98.9%

      \[\leadsto \color{blue}{1} \cdot {\ell}^{\left(e^{w}\right)} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;w \leq -4:\\ \;\;\;\;e^{-w}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot {\ell}^{\left(e^{w}\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 5: 98.7% accurate, 2.4× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;w \leq -1.6:\\ \;\;\;\;e^{-w}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot {\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, w, 0.5\right), w, 1\right), w, 1\right)\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -1.6)
   (exp (- w))
   (* 1.0 (pow l (fma (fma (fma 0.16666666666666666 w 0.5) w 1.0) w 1.0)))))

C

double code(double w, double l) {
	double tmp;
	if (w <= -1.6) {
		tmp = exp(-w);
	} else {
		tmp = 1.0 * pow(l, fma(fma(fma(0.16666666666666666, w, 0.5), w, 1.0), w, 1.0));
	}
	return tmp;
}

Julia

function code(w, l)
	tmp = 0.0
	if (w <= -1.6)
		tmp = exp(Float64(-w));
	else
		tmp = Float64(1.0 * (l ^ fma(fma(fma(0.16666666666666666, w, 0.5), w, 1.0), w, 1.0)));
	end
	return tmp
end

Wolfram

code[w_, l_] := If[LessEqual[w, -1.6], N[Exp[(-w)], $MachinePrecision], N[(1.0 * N[Power[l, N[(N[(N[(0.16666666666666666 * w + 0.5), $MachinePrecision] * w + 1.0), $MachinePrecision] * w + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if w < -1.6000000000000001

   1. Initial program 100.0%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)} \cdot e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot \color{blue}{e^{\mathsf{neg}\left(w\right)}} \]

      2. exp-prod N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot e^{\color{blue}{\mathsf{neg}\left(w\right)}} \]

      3. mul-1-neg N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot e^{-1 \cdot w} \]

      4. exp-prod N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot {\left(e^{-1}\right)}^{\color{blue}{w}} \]

      5. pow-prod-up N/A

         \[\leadsto {\left(e^{-1}\right)}^{\color{blue}{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right) + w\right)}} \]

      6. lower-pow.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\color{blue}{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right) + w\right)}} \]

      7. lower-exp.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(\color{blue}{e^{w} \cdot \log \left(\frac{1}{\ell}\right)} + w\right)} \]

      8. *-commutative N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(\log \left(\frac{1}{\ell}\right) \cdot e^{w} + w\right)} \]

      9. lower-fma.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(\log \left(\frac{1}{\ell}\right), \color{blue}{e^{w}}, w\right)\right)} \]

      10. log-rec N/A

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(\mathsf{neg}\left(\log \ell\right), e^{\color{blue}{w}}, w\right)\right)} \]

      11. lower-neg.f64 N/A

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{\color{blue}{w}}, w\right)\right)} \]

      12. lower-log.f64 N/A

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{w}, w\right)\right)} \]

      13. lift-exp.f64 99.8

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{w}, w\right)\right)} \]

   5. Applied rewrites 99.8%

      \[\leadsto \color{blue}{{\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{w}, w\right)\right)}} \]

   6. Taylor expanded in w around inf

      \[\leadsto {\left(e^{-1}\right)}^{w} \]
   7. Step-by-step derivation

   8. Applied rewrites 99.8%

      \[\leadsto {\left(e^{-1}\right)}^{w} \]
   9. Step-by-step derivation

      1. lift-exp.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{w} \]

      2. lift-pow.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\color{blue}{w}} \]

      3. pow-exp N/A

         \[\leadsto e^{-1 \cdot w} \]

      4. lower-exp.f64 N/A

         \[\leadsto e^{-1 \cdot w} \]

      5. lower-*.f64 100.0

         \[\leadsto e^{-1 \cdot w} \]

   10. Applied rewrites 100.0%

       \[\leadsto e^{-1 \cdot w} \]

   if -1.6000000000000001 < w

   1. Initial program 99.2%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around 0

      \[\leadsto \color{blue}{1} \cdot {\ell}^{\left(e^{w}\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 98.9%

      \[\leadsto \color{blue}{1} \cdot {\ell}^{\left(e^{w}\right)} \]

   6. Taylor expanded in w around 0

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

      1. +-commutative N/A

         \[\leadsto 1 \cdot {\ell}^{\left(w \cdot \left(1 + w \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot w\right)\right) + \color{blue}{1}\right)} \]

      2. *-commutative N/A

         \[\leadsto 1 \cdot {\ell}^{\left(\left(1 + w \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot w\right)\right) \cdot w + 1\right)} \]

      3. lower-fma.f64 N/A

         \[\leadsto 1 \cdot {\ell}^{\left(\mathsf{fma}\left(1 + w \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot w\right), \color{blue}{w}, 1\right)\right)} \]

      4. +-commutative N/A

         \[\leadsto 1 \cdot {\ell}^{\left(\mathsf{fma}\left(w \cdot \left(\frac{1}{2} + \frac{1}{6} \cdot w\right) + 1, w, 1\right)\right)} \]

      5. *-commutative N/A

         \[\leadsto 1 \cdot {\ell}^{\left(\mathsf{fma}\left(\left(\frac{1}{2} + \frac{1}{6} \cdot w\right) \cdot w + 1, w, 1\right)\right)} \]

      6. lower-fma.f64 N/A

         \[\leadsto 1 \cdot {\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2} + \frac{1}{6} \cdot w, w, 1\right), w, 1\right)\right)} \]

      7. +-commutative N/A

         \[\leadsto 1 \cdot {\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{6} \cdot w + \frac{1}{2}, w, 1\right), w, 1\right)\right)} \]

      8. lower-fma.f64 98.8

         \[\leadsto 1 \cdot {\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, w, 0.5\right), w, 1\right), w, 1\right)\right)} \]

   8. Applied rewrites 98.8%

      \[\leadsto 1 \cdot {\ell}^{\color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, w, 0.5\right), w, 1\right), w, 1\right)\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;w \leq -1.6:\\ \;\;\;\;e^{-w}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot {\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, w, 0.5\right), w, 1\right), w, 1\right)\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 6: 98.7% accurate, 2.5× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;w \leq -1.25:\\ \;\;\;\;e^{-w}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot {\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(0.5, w, 1\right), w, 1\right)\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -1.25) (exp (- w)) (* 1.0 (pow l (fma (fma 0.5 w 1.0) w 1.0)))))

C

double code(double w, double l) {
	double tmp;
	if (w <= -1.25) {
		tmp = exp(-w);
	} else {
		tmp = 1.0 * pow(l, fma(fma(0.5, w, 1.0), w, 1.0));
	}
	return tmp;
}

Julia

function code(w, l)
	tmp = 0.0
	if (w <= -1.25)
		tmp = exp(Float64(-w));
	else
		tmp = Float64(1.0 * (l ^ fma(fma(0.5, w, 1.0), w, 1.0)));
	end
	return tmp
end

Wolfram

code[w_, l_] := If[LessEqual[w, -1.25], N[Exp[(-w)], $MachinePrecision], N[(1.0 * N[Power[l, N[(N[(0.5 * w + 1.0), $MachinePrecision] * w + 1.0), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if w < -1.25

   1. Initial program 100.0%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)} \cdot e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot \color{blue}{e^{\mathsf{neg}\left(w\right)}} \]

      2. exp-prod N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot e^{\color{blue}{\mathsf{neg}\left(w\right)}} \]

      3. mul-1-neg N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot e^{-1 \cdot w} \]

      4. exp-prod N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot {\left(e^{-1}\right)}^{\color{blue}{w}} \]

      5. pow-prod-up N/A

         \[\leadsto {\left(e^{-1}\right)}^{\color{blue}{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right) + w\right)}} \]

      6. lower-pow.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\color{blue}{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right) + w\right)}} \]

      7. lower-exp.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(\color{blue}{e^{w} \cdot \log \left(\frac{1}{\ell}\right)} + w\right)} \]

      8. *-commutative N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(\log \left(\frac{1}{\ell}\right) \cdot e^{w} + w\right)} \]

      9. lower-fma.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(\log \left(\frac{1}{\ell}\right), \color{blue}{e^{w}}, w\right)\right)} \]

      10. log-rec N/A

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(\mathsf{neg}\left(\log \ell\right), e^{\color{blue}{w}}, w\right)\right)} \]

      11. lower-neg.f64 N/A

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{\color{blue}{w}}, w\right)\right)} \]

      12. lower-log.f64 N/A

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{w}, w\right)\right)} \]

      13. lift-exp.f64 99.8

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{w}, w\right)\right)} \]

   5. Applied rewrites 99.8%

      \[\leadsto \color{blue}{{\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{w}, w\right)\right)}} \]

   6. Taylor expanded in w around inf

      \[\leadsto {\left(e^{-1}\right)}^{w} \]
   7. Step-by-step derivation

   8. Applied rewrites 99.8%

      \[\leadsto {\left(e^{-1}\right)}^{w} \]
   9. Step-by-step derivation

      1. lift-exp.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{w} \]

      2. lift-pow.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\color{blue}{w}} \]

      3. pow-exp N/A

         \[\leadsto e^{-1 \cdot w} \]

      4. lower-exp.f64 N/A

         \[\leadsto e^{-1 \cdot w} \]

      5. lower-*.f64 100.0

         \[\leadsto e^{-1 \cdot w} \]

   10. Applied rewrites 100.0%

       \[\leadsto e^{-1 \cdot w} \]

   if -1.25 < w

   1. Initial program 99.2%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around 0

      \[\leadsto \color{blue}{1} \cdot {\ell}^{\left(e^{w}\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 98.9%

      \[\leadsto \color{blue}{1} \cdot {\ell}^{\left(e^{w}\right)} \]

   6. Taylor expanded in w around 0

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

      1. +-commutative N/A

         \[\leadsto 1 \cdot {\ell}^{\left(w \cdot \left(1 + \frac{1}{2} \cdot w\right) + \color{blue}{1}\right)} \]

      2. *-commutative N/A

         \[\leadsto 1 \cdot {\ell}^{\left(\left(1 + \frac{1}{2} \cdot w\right) \cdot w + 1\right)} \]

      3. lower-fma.f64 N/A

         \[\leadsto 1 \cdot {\ell}^{\left(\mathsf{fma}\left(1 + \frac{1}{2} \cdot w, \color{blue}{w}, 1\right)\right)} \]

      4. +-commutative N/A

         \[\leadsto 1 \cdot {\ell}^{\left(\mathsf{fma}\left(\frac{1}{2} \cdot w + 1, w, 1\right)\right)} \]

      5. lower-fma.f64 98.8

         \[\leadsto 1 \cdot {\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(0.5, w, 1\right), w, 1\right)\right)} \]

   8. Applied rewrites 98.8%

      \[\leadsto 1 \cdot {\ell}^{\color{blue}{\left(\mathsf{fma}\left(\mathsf{fma}\left(0.5, w, 1\right), w, 1\right)\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;w \leq -1.25:\\ \;\;\;\;e^{-w}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot {\ell}^{\left(\mathsf{fma}\left(\mathsf{fma}\left(0.5, w, 1\right), w, 1\right)\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 7: 98.3% accurate, 2.6× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;w \leq -0.7:\\ \;\;\;\;e^{-w}\\ \mathbf{elif}\;w \leq 1:\\ \;\;\;\;\ell\\ \mathbf{else}:\\ \;\;\;\;1 \cdot {\ell}^{w}\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -0.7) (exp (- w)) (if (<= w 1.0) l (* 1.0 (pow l w)))))

C

double code(double w, double l) {
	double tmp;
	if (w <= -0.7) {
		tmp = exp(-w);
	} else if (w <= 1.0) {
		tmp = l;
	} else {
		tmp = 1.0 * pow(l, w);
	}
	return tmp;
}

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(w, l)
use fmin_fmax_functions
    real(8), intent (in) :: w
    real(8), intent (in) :: l
    real(8) :: tmp
    if (w <= (-0.7d0)) then
        tmp = exp(-w)
    else if (w <= 1.0d0) then
        tmp = l
    else
        tmp = 1.0d0 * (l ** w)
    end if
    code = tmp
end function

Java

public static double code(double w, double l) {
	double tmp;
	if (w <= -0.7) {
		tmp = Math.exp(-w);
	} else if (w <= 1.0) {
		tmp = l;
	} else {
		tmp = 1.0 * Math.pow(l, w);
	}
	return tmp;
}

Python

def code(w, l):
	tmp = 0
	if w <= -0.7:
		tmp = math.exp(-w)
	elif w <= 1.0:
		tmp = l
	else:
		tmp = 1.0 * math.pow(l, w)
	return tmp

Julia

function code(w, l)
	tmp = 0.0
	if (w <= -0.7)
		tmp = exp(Float64(-w));
	elseif (w <= 1.0)
		tmp = l;
	else
		tmp = Float64(1.0 * (l ^ w));
	end
	return tmp
end

MATLAB

function tmp_2 = code(w, l)
	tmp = 0.0;
	if (w <= -0.7)
		tmp = exp(-w);
	elseif (w <= 1.0)
		tmp = l;
	else
		tmp = 1.0 * (l ^ w);
	end
	tmp_2 = tmp;
end

Wolfram

code[w_, l_] := If[LessEqual[w, -0.7], N[Exp[(-w)], $MachinePrecision], If[LessEqual[w, 1.0], l, N[(1.0 * N[Power[l, w], $MachinePrecision]), $MachinePrecision]]]

Derivation

1. Split input into 3 regimes

2. if w < -0.69999999999999996

   1. Initial program 100.0%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)} \cdot e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot \color{blue}{e^{\mathsf{neg}\left(w\right)}} \]

      2. exp-prod N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot e^{\color{blue}{\mathsf{neg}\left(w\right)}} \]

      3. mul-1-neg N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot e^{-1 \cdot w} \]

      4. exp-prod N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot {\left(e^{-1}\right)}^{\color{blue}{w}} \]

      5. pow-prod-up N/A

         \[\leadsto {\left(e^{-1}\right)}^{\color{blue}{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right) + w\right)}} \]

      6. lower-pow.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\color{blue}{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right) + w\right)}} \]

      7. lower-exp.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(\color{blue}{e^{w} \cdot \log \left(\frac{1}{\ell}\right)} + w\right)} \]

      8. *-commutative N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(\log \left(\frac{1}{\ell}\right) \cdot e^{w} + w\right)} \]

      9. lower-fma.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(\log \left(\frac{1}{\ell}\right), \color{blue}{e^{w}}, w\right)\right)} \]

      10. log-rec N/A

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(\mathsf{neg}\left(\log \ell\right), e^{\color{blue}{w}}, w\right)\right)} \]

      11. lower-neg.f64 N/A

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{\color{blue}{w}}, w\right)\right)} \]

      12. lower-log.f64 N/A

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{w}, w\right)\right)} \]

      13. lift-exp.f64 99.8

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{w}, w\right)\right)} \]

   5. Applied rewrites 99.8%

      \[\leadsto \color{blue}{{\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{w}, w\right)\right)}} \]

   6. Taylor expanded in w around inf

      \[\leadsto {\left(e^{-1}\right)}^{w} \]
   7. Step-by-step derivation

   8. Applied rewrites 99.8%

      \[\leadsto {\left(e^{-1}\right)}^{w} \]
   9. Step-by-step derivation

      1. lift-exp.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{w} \]

      2. lift-pow.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\color{blue}{w}} \]

      3. pow-exp N/A

         \[\leadsto e^{-1 \cdot w} \]

      4. lower-exp.f64 N/A

         \[\leadsto e^{-1 \cdot w} \]

      5. lower-*.f64 100.0

         \[\leadsto e^{-1 \cdot w} \]

   10. Applied rewrites 100.0%

       \[\leadsto e^{-1 \cdot w} \]

   if -0.69999999999999996 < w < 1

   1. Initial program 99.6%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around 0

      \[\leadsto \color{blue}{\ell} \]
   4. Step-by-step derivation

   5. Applied rewrites 98.2%

      \[\leadsto \color{blue}{\ell} \]

   if 1 < w

   1. Initial program 96.8%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around 0

      \[\leadsto \color{blue}{1} \cdot {\ell}^{\left(e^{w}\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 100.0%

      \[\leadsto \color{blue}{1} \cdot {\ell}^{\left(e^{w}\right)} \]

   6. Taylor expanded in w around 0

      \[\leadsto 1 \cdot {\ell}^{\color{blue}{\left(1 + w\right)}} \]
   7. Step-by-step derivation

      1. lower-+.f64 100.0

         \[\leadsto 1 \cdot {\ell}^{\left(1 + \color{blue}{w}\right)} \]

   8. Applied rewrites 100.0%

      \[\leadsto 1 \cdot {\ell}^{\color{blue}{\left(1 + w\right)}} \]

   9. Taylor expanded in w around inf

      \[\leadsto 1 \cdot {\ell}^{w} \]
   10. Step-by-step derivation

   11. Applied rewrites 100.0%

       \[\leadsto 1 \cdot {\ell}^{w} \]
3. Recombined 3 regimes into one program.

4. Final simplification 98.9%

   \[\leadsto \begin{array}{l} \mathbf{if}\;w \leq -0.7:\\ \;\;\;\;e^{-w}\\ \mathbf{elif}\;w \leq 1:\\ \;\;\;\;\ell\\ \mathbf{else}:\\ \;\;\;\;1 \cdot {\ell}^{w}\\ \end{array} \]
5. Add Preprocessing

Alternative 8: 98.7% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;w \leq -1:\\ \;\;\;\;e^{-w}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot {\ell}^{\left(1 + w\right)}\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (<= w -1.0) (exp (- w)) (* 1.0 (pow l (+ 1.0 w)))))

C

double code(double w, double l) {
	double tmp;
	if (w <= -1.0) {
		tmp = exp(-w);
	} else {
		tmp = 1.0 * pow(l, (1.0 + w));
	}
	return tmp;
}

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(w, l)
use fmin_fmax_functions
    real(8), intent (in) :: w
    real(8), intent (in) :: l
    real(8) :: tmp
    if (w <= (-1.0d0)) then
        tmp = exp(-w)
    else
        tmp = 1.0d0 * (l ** (1.0d0 + w))
    end if
    code = tmp
end function

Java

public static double code(double w, double l) {
	double tmp;
	if (w <= -1.0) {
		tmp = Math.exp(-w);
	} else {
		tmp = 1.0 * Math.pow(l, (1.0 + w));
	}
	return tmp;
}

Python

def code(w, l):
	tmp = 0
	if w <= -1.0:
		tmp = math.exp(-w)
	else:
		tmp = 1.0 * math.pow(l, (1.0 + w))
	return tmp

Julia

function code(w, l)
	tmp = 0.0
	if (w <= -1.0)
		tmp = exp(Float64(-w));
	else
		tmp = Float64(1.0 * (l ^ Float64(1.0 + w)));
	end
	return tmp
end

MATLAB

function tmp_2 = code(w, l)
	tmp = 0.0;
	if (w <= -1.0)
		tmp = exp(-w);
	else
		tmp = 1.0 * (l ^ (1.0 + w));
	end
	tmp_2 = tmp;
end

Wolfram

code[w_, l_] := If[LessEqual[w, -1.0], N[Exp[(-w)], $MachinePrecision], N[(1.0 * N[Power[l, N[(1.0 + w), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if w < -1

   1. Initial program 100.0%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)} \cdot e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot \color{blue}{e^{\mathsf{neg}\left(w\right)}} \]

      2. exp-prod N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot e^{\color{blue}{\mathsf{neg}\left(w\right)}} \]

      3. mul-1-neg N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot e^{-1 \cdot w} \]

      4. exp-prod N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot {\left(e^{-1}\right)}^{\color{blue}{w}} \]

      5. pow-prod-up N/A

         \[\leadsto {\left(e^{-1}\right)}^{\color{blue}{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right) + w\right)}} \]

      6. lower-pow.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\color{blue}{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right) + w\right)}} \]

      7. lower-exp.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(\color{blue}{e^{w} \cdot \log \left(\frac{1}{\ell}\right)} + w\right)} \]

      8. *-commutative N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(\log \left(\frac{1}{\ell}\right) \cdot e^{w} + w\right)} \]

      9. lower-fma.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(\log \left(\frac{1}{\ell}\right), \color{blue}{e^{w}}, w\right)\right)} \]

      10. log-rec N/A

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(\mathsf{neg}\left(\log \ell\right), e^{\color{blue}{w}}, w\right)\right)} \]

      11. lower-neg.f64 N/A

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{\color{blue}{w}}, w\right)\right)} \]

      12. lower-log.f64 N/A

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{w}, w\right)\right)} \]

      13. lift-exp.f64 99.8

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{w}, w\right)\right)} \]

   5. Applied rewrites 99.8%

      \[\leadsto \color{blue}{{\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{w}, w\right)\right)}} \]

   6. Taylor expanded in w around inf

      \[\leadsto {\left(e^{-1}\right)}^{w} \]
   7. Step-by-step derivation

   8. Applied rewrites 99.8%

      \[\leadsto {\left(e^{-1}\right)}^{w} \]
   9. Step-by-step derivation

      1. lift-exp.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{w} \]

      2. lift-pow.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\color{blue}{w}} \]

      3. pow-exp N/A

         \[\leadsto e^{-1 \cdot w} \]

      4. lower-exp.f64 N/A

         \[\leadsto e^{-1 \cdot w} \]

      5. lower-*.f64 100.0

         \[\leadsto e^{-1 \cdot w} \]

   10. Applied rewrites 100.0%

       \[\leadsto e^{-1 \cdot w} \]

   if -1 < w

   1. Initial program 99.2%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around 0

      \[\leadsto \color{blue}{1} \cdot {\ell}^{\left(e^{w}\right)} \]
   4. Step-by-step derivation

   5. Applied rewrites 98.9%

      \[\leadsto \color{blue}{1} \cdot {\ell}^{\left(e^{w}\right)} \]

   6. Taylor expanded in w around 0

      \[\leadsto 1 \cdot {\ell}^{\color{blue}{\left(1 + w\right)}} \]
   7. Step-by-step derivation

      1. lower-+.f64 98.8

         \[\leadsto 1 \cdot {\ell}^{\left(1 + \color{blue}{w}\right)} \]

   8. Applied rewrites 98.8%

      \[\leadsto 1 \cdot {\ell}^{\color{blue}{\left(1 + w\right)}} \]
3. Recombined 2 regimes into one program.

4. Final simplification 99.1%

   \[\leadsto \begin{array}{l} \mathbf{if}\;w \leq -1:\\ \;\;\;\;e^{-w}\\ \mathbf{else}:\\ \;\;\;\;1 \cdot {\ell}^{\left(1 + w\right)}\\ \end{array} \]
5. Add Preprocessing

Alternative 9: 97.7% accurate, 2.7× speedup

Math

\[\begin{array}{l} \\ \begin{array}{l} \mathbf{if}\;w \leq -0.7 \lor \neg \left(w \leq 350000\right):\\ \;\;\;\;e^{-w}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right) \cdot \ell\\ \end{array} \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (if (or (<= w -0.7) (not (<= w 350000.0)))
   (exp (- w))
   (* (fma (fma 0.5 w -1.0) w 1.0) l)))

C

double code(double w, double l) {
	double tmp;
	if ((w <= -0.7) || !(w <= 350000.0)) {
		tmp = exp(-w);
	} else {
		tmp = fma(fma(0.5, w, -1.0), w, 1.0) * l;
	}
	return tmp;
}

Julia

function code(w, l)
	tmp = 0.0
	if ((w <= -0.7) || !(w <= 350000.0))
		tmp = exp(Float64(-w));
	else
		tmp = Float64(fma(fma(0.5, w, -1.0), w, 1.0) * l);
	end
	return tmp
end

Wolfram

code[w_, l_] := If[Or[LessEqual[w, -0.7], N[Not[LessEqual[w, 350000.0]], $MachinePrecision]], N[Exp[(-w)], $MachinePrecision], N[(N[(N[(0.5 * w + -1.0), $MachinePrecision] * w + 1.0), $MachinePrecision] * l), $MachinePrecision]]

Derivation

1. Split input into 2 regimes

2. if w < -0.69999999999999996 or 3.5e5 < w

   1. Initial program 100.0%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in l around inf

      \[\leadsto \color{blue}{e^{\mathsf{neg}\left(w\right)} \cdot e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)}} \]
   4. Step-by-step derivation

      1. *-commutative N/A

         \[\leadsto e^{-1 \cdot \left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot \color{blue}{e^{\mathsf{neg}\left(w\right)}} \]

      2. exp-prod N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot e^{\color{blue}{\mathsf{neg}\left(w\right)}} \]

      3. mul-1-neg N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot e^{-1 \cdot w} \]

      4. exp-prod N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right)\right)} \cdot {\left(e^{-1}\right)}^{\color{blue}{w}} \]

      5. pow-prod-up N/A

         \[\leadsto {\left(e^{-1}\right)}^{\color{blue}{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right) + w\right)}} \]

      6. lower-pow.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\color{blue}{\left(e^{w} \cdot \log \left(\frac{1}{\ell}\right) + w\right)}} \]

      7. lower-exp.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(\color{blue}{e^{w} \cdot \log \left(\frac{1}{\ell}\right)} + w\right)} \]

      8. *-commutative N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(\log \left(\frac{1}{\ell}\right) \cdot e^{w} + w\right)} \]

      9. lower-fma.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(\log \left(\frac{1}{\ell}\right), \color{blue}{e^{w}}, w\right)\right)} \]

      10. log-rec N/A

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(\mathsf{neg}\left(\log \ell\right), e^{\color{blue}{w}}, w\right)\right)} \]

      11. lower-neg.f64 N/A

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{\color{blue}{w}}, w\right)\right)} \]

      12. lower-log.f64 N/A

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{w}, w\right)\right)} \]

      13. lift-exp.f64 99.8

          \[\leadsto {\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{w}, w\right)\right)} \]

   5. Applied rewrites 99.8%

      \[\leadsto \color{blue}{{\left(e^{-1}\right)}^{\left(\mathsf{fma}\left(-\log \ell, e^{w}, w\right)\right)}} \]

   6. Taylor expanded in w around inf

      \[\leadsto {\left(e^{-1}\right)}^{w} \]
   7. Step-by-step derivation

   8. Applied rewrites 99.8%

      \[\leadsto {\left(e^{-1}\right)}^{w} \]
   9. Step-by-step derivation

      1. lift-exp.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{w} \]

      2. lift-pow.f64 N/A

         \[\leadsto {\left(e^{-1}\right)}^{\color{blue}{w}} \]

      3. pow-exp N/A

         \[\leadsto e^{-1 \cdot w} \]

      4. lower-exp.f64 N/A

         \[\leadsto e^{-1 \cdot w} \]

      5. lower-*.f64 100.0

         \[\leadsto e^{-1 \cdot w} \]

   10. Applied rewrites 100.0%

       \[\leadsto e^{-1 \cdot w} \]

   if -0.69999999999999996 < w < 3.5e5

   1. Initial program 99.0%

      \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
   2. Add Preprocessing

   3. Taylor expanded in w around 0

      \[\leadsto \color{blue}{\left(1 + w \cdot \left(\frac{1}{2} \cdot w - 1\right)\right)} \cdot {\ell}^{\left(e^{w}\right)} \]
   4. Step-by-step derivation

      1. +-commutative N/A

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

      2. *-commutative N/A

         \[\leadsto \left(\left(\frac{1}{2} \cdot w - 1\right) \cdot w + 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

      3. lower-fma.f64 N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w - 1, \color{blue}{w}, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

      4. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w - 1 \cdot 1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

      5. fp-cancel-sub-sign-inv N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w + \left(\mathsf{neg}\left(1\right)\right) \cdot 1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

      6. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w + -1 \cdot 1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

      7. metadata-eval N/A

         \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w + -1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

      8. lower-fma.f64 99.0

         \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   5. Applied rewrites 99.0%

      \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

   6. Taylor expanded in w around 0

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, w, -1\right), w, 1\right) \cdot \color{blue}{\ell} \]
   7. Step-by-step derivation

   8. Applied rewrites 97.0%

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right) \cdot \color{blue}{\ell} \]
3. Recombined 2 regimes into one program.

4. Final simplification 98.2%

   \[\leadsto \begin{array}{l} \mathbf{if}\;w \leq -0.7 \lor \neg \left(w \leq 350000\right):\\ \;\;\;\;e^{-w}\\ \mathbf{else}:\\ \;\;\;\;\mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right) \cdot \ell\\ \end{array} \]
5. Add Preprocessing

Alternative 10: 97.8% accurate, 2.9× speedup

Math

\[\begin{array}{l} \\ e^{-w} \cdot \ell \end{array} \]

FPCore

(FPCore (w l) :precision binary64 (* (exp (- w)) l))

C

double code(double w, double l) {
	return exp(-w) * l;
}

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(w, l)
use fmin_fmax_functions
    real(8), intent (in) :: w
    real(8), intent (in) :: l
    code = exp(-w) * l
end function

Java

public static double code(double w, double l) {
	return Math.exp(-w) * l;
}

Python

def code(w, l):
	return math.exp(-w) * l

Julia

function code(w, l)
	return Float64(exp(Float64(-w)) * l)
end

MATLAB

function tmp = code(w, l)
	tmp = exp(-w) * l;
end

Wolfram

code[w_, l_] := N[(N[Exp[(-w)], $MachinePrecision] * l), $MachinePrecision]

Derivation

1. Initial program 99.4%

   \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
2. Add Preprocessing

3. Taylor expanded in w around 0

   \[\leadsto e^{-w} \cdot \color{blue}{\ell} \]
4. Step-by-step derivation

5. Applied rewrites 97.4%

   \[\leadsto e^{-w} \cdot \color{blue}{\ell} \]
6. Add Preprocessing

Alternative 11: 77.2% accurate, 11.9× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, w, 0.5\right) \cdot w - 1, w, 1\right) \cdot \ell \end{array} \]

FPCore

(FPCore (w l)
 :precision binary64
 (* (fma (- (* (fma -0.16666666666666666 w 0.5) w) 1.0) w 1.0) l))

C

double code(double w, double l) {
	return fma(((fma(-0.16666666666666666, w, 0.5) * w) - 1.0), w, 1.0) * l;
}

Julia

function code(w, l)
	return Float64(fma(Float64(Float64(fma(-0.16666666666666666, w, 0.5) * w) - 1.0), w, 1.0) * l)
end

Wolfram

code[w_, l_] := N[(N[(N[(N[(N[(-0.16666666666666666 * w + 0.5), $MachinePrecision] * w), $MachinePrecision] - 1.0), $MachinePrecision] * w + 1.0), $MachinePrecision] * l), $MachinePrecision]

Derivation

1. Initial program 99.4%

   \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
2. Add Preprocessing

3. Taylor expanded in w around 0

   \[\leadsto \color{blue}{\left(1 + w \cdot \left(\frac{1}{2} \cdot w - 1\right)\right)} \cdot {\ell}^{\left(e^{w}\right)} \]
4. Step-by-step derivation

   1. +-commutative N/A

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

   2. *-commutative N/A

      \[\leadsto \left(\left(\frac{1}{2} \cdot w - 1\right) \cdot w + 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   3. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w - 1, \color{blue}{w}, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   4. metadata-eval N/A

      \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w - 1 \cdot 1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   5. fp-cancel-sub-sign-inv N/A

      \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w + \left(\mathsf{neg}\left(1\right)\right) \cdot 1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   6. metadata-eval N/A

      \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w + -1 \cdot 1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   7. metadata-eval N/A

      \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w + -1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   8. lower-fma.f64 81.7

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

5. Applied rewrites 81.7%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

6. Taylor expanded in w around 0

   \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, w, -1\right), w, 1\right) \cdot \color{blue}{\ell} \]
7. Step-by-step derivation

8. Applied rewrites 79.6%

   \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right) \cdot \color{blue}{\ell} \]

9. Taylor expanded in w around 0

   \[\leadsto \mathsf{fma}\left(-1, w, 1\right) \cdot \ell \]
10. Step-by-step derivation

11. Applied rewrites 68.7%

    \[\leadsto \mathsf{fma}\left(-1, w, 1\right) \cdot \ell \]

12. Taylor expanded in w around 0

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

    1. +-commutative N/A

       \[\leadsto \left(w \cdot \left(w \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot w\right) - 1\right) + \color{blue}{1}\right) \cdot \ell \]

    2. *-commutative N/A

       \[\leadsto \left(\left(w \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot w\right) - 1\right) \cdot w + 1\right) \cdot \ell \]

    3. lower-fma.f64 N/A

       \[\leadsto \mathsf{fma}\left(w \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot w\right) - 1, \color{blue}{w}, 1\right) \cdot \ell \]

    4. lower--.f64 N/A

       \[\leadsto \mathsf{fma}\left(w \cdot \left(\frac{1}{2} + \frac{-1}{6} \cdot w\right) - 1, w, 1\right) \cdot \ell \]

    5. *-commutative N/A

       \[\leadsto \mathsf{fma}\left(\left(\frac{1}{2} + \frac{-1}{6} \cdot w\right) \cdot w - 1, w, 1\right) \cdot \ell \]

    6. lower-*.f64 N/A

       \[\leadsto \mathsf{fma}\left(\left(\frac{1}{2} + \frac{-1}{6} \cdot w\right) \cdot w - 1, w, 1\right) \cdot \ell \]

    7. +-commutative N/A

       \[\leadsto \mathsf{fma}\left(\left(\frac{-1}{6} \cdot w + \frac{1}{2}\right) \cdot w - 1, w, 1\right) \cdot \ell \]

    8. lower-fma.f64 82.2

       \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, w, 0.5\right) \cdot w - 1, w, 1\right) \cdot \ell \]

14. Applied rewrites 82.2%

    \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(-0.16666666666666666, w, 0.5\right) \cdot w - 1, w, 1\right)} \cdot \ell \]
15. Add Preprocessing

Alternative 12: 74.0% accurate, 17.2× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right) \cdot \ell \end{array} \]

FPCore

(FPCore (w l) :precision binary64 (* (fma (fma 0.5 w -1.0) w 1.0) l))

C

double code(double w, double l) {
	return fma(fma(0.5, w, -1.0), w, 1.0) * l;
}

Julia

function code(w, l)
	return Float64(fma(fma(0.5, w, -1.0), w, 1.0) * l)
end

Wolfram

code[w_, l_] := N[(N[(N[(0.5 * w + -1.0), $MachinePrecision] * w + 1.0), $MachinePrecision] * l), $MachinePrecision]

Derivation

1. Initial program 99.4%

   \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
2. Add Preprocessing

3. Taylor expanded in w around 0

   \[\leadsto \color{blue}{\left(1 + w \cdot \left(\frac{1}{2} \cdot w - 1\right)\right)} \cdot {\ell}^{\left(e^{w}\right)} \]
4. Step-by-step derivation

   1. +-commutative N/A

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

   2. *-commutative N/A

      \[\leadsto \left(\left(\frac{1}{2} \cdot w - 1\right) \cdot w + 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   3. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w - 1, \color{blue}{w}, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   4. metadata-eval N/A

      \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w - 1 \cdot 1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   5. fp-cancel-sub-sign-inv N/A

      \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w + \left(\mathsf{neg}\left(1\right)\right) \cdot 1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   6. metadata-eval N/A

      \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w + -1 \cdot 1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   7. metadata-eval N/A

      \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w + -1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   8. lower-fma.f64 81.7

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

5. Applied rewrites 81.7%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

6. Taylor expanded in w around 0

   \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, w, -1\right), w, 1\right) \cdot \color{blue}{\ell} \]
7. Step-by-step derivation

8. Applied rewrites 79.6%

   \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right) \cdot \color{blue}{\ell} \]
9. Add Preprocessing

Alternative 13: 74.0% accurate, 18.2× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(0.5 \cdot w, w, 1\right) \cdot \ell \end{array} \]

FPCore

(FPCore (w l) :precision binary64 (* (fma (* 0.5 w) w 1.0) l))

C

double code(double w, double l) {
	return fma((0.5 * w), w, 1.0) * l;
}

Julia

function code(w, l)
	return Float64(fma(Float64(0.5 * w), w, 1.0) * l)
end

Wolfram

code[w_, l_] := N[(N[(N[(0.5 * w), $MachinePrecision] * w + 1.0), $MachinePrecision] * l), $MachinePrecision]

Derivation

1. Initial program 99.4%

   \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
2. Add Preprocessing

3. Taylor expanded in w around 0

   \[\leadsto \color{blue}{\left(1 + w \cdot \left(\frac{1}{2} \cdot w - 1\right)\right)} \cdot {\ell}^{\left(e^{w}\right)} \]
4. Step-by-step derivation

   1. +-commutative N/A

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

   2. *-commutative N/A

      \[\leadsto \left(\left(\frac{1}{2} \cdot w - 1\right) \cdot w + 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   3. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w - 1, \color{blue}{w}, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   4. metadata-eval N/A

      \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w - 1 \cdot 1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   5. fp-cancel-sub-sign-inv N/A

      \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w + \left(\mathsf{neg}\left(1\right)\right) \cdot 1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   6. metadata-eval N/A

      \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w + -1 \cdot 1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   7. metadata-eval N/A

      \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w + -1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   8. lower-fma.f64 81.7

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

5. Applied rewrites 81.7%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

6. Taylor expanded in w around 0

   \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, w, -1\right), w, 1\right) \cdot \color{blue}{\ell} \]
7. Step-by-step derivation

8. Applied rewrites 79.6%

   \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right) \cdot \color{blue}{\ell} \]

9. Taylor expanded in w around inf

   \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w, w, 1\right) \cdot \ell \]
10. Step-by-step derivation

    1. lower-*.f64 79.6

       \[\leadsto \mathsf{fma}\left(0.5 \cdot w, w, 1\right) \cdot \ell \]

11. Applied rewrites 79.6%

    \[\leadsto \mathsf{fma}\left(0.5 \cdot w, w, 1\right) \cdot \ell \]
12. Add Preprocessing

Alternative 14: 63.5% accurate, 25.8× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(-1, w, 1\right) \cdot \ell \end{array} \]

FPCore

(FPCore (w l) :precision binary64 (* (fma -1.0 w 1.0) l))

C

double code(double w, double l) {
	return fma(-1.0, w, 1.0) * l;
}

Julia

function code(w, l)
	return Float64(fma(-1.0, w, 1.0) * l)
end

Wolfram

code[w_, l_] := N[(N[(-1.0 * w + 1.0), $MachinePrecision] * l), $MachinePrecision]

Derivation

1. Initial program 99.4%

   \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
2. Add Preprocessing

3. Taylor expanded in w around 0

   \[\leadsto \color{blue}{\left(1 + w \cdot \left(\frac{1}{2} \cdot w - 1\right)\right)} \cdot {\ell}^{\left(e^{w}\right)} \]
4. Step-by-step derivation

   1. +-commutative N/A

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

   2. *-commutative N/A

      \[\leadsto \left(\left(\frac{1}{2} \cdot w - 1\right) \cdot w + 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   3. lower-fma.f64 N/A

      \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w - 1, \color{blue}{w}, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   4. metadata-eval N/A

      \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w - 1 \cdot 1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   5. fp-cancel-sub-sign-inv N/A

      \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w + \left(\mathsf{neg}\left(1\right)\right) \cdot 1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   6. metadata-eval N/A

      \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w + -1 \cdot 1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   7. metadata-eval N/A

      \[\leadsto \mathsf{fma}\left(\frac{1}{2} \cdot w + -1, w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

   8. lower-fma.f64 81.7

      \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right) \cdot {\ell}^{\left(e^{w}\right)} \]

5. Applied rewrites 81.7%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right)} \cdot {\ell}^{\left(e^{w}\right)} \]

6. Taylor expanded in w around 0

   \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{2}, w, -1\right), w, 1\right) \cdot \color{blue}{\ell} \]
7. Step-by-step derivation

8. Applied rewrites 79.6%

   \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.5, w, -1\right), w, 1\right) \cdot \color{blue}{\ell} \]

9. Taylor expanded in w around 0

   \[\leadsto \mathsf{fma}\left(-1, w, 1\right) \cdot \ell \]
10. Step-by-step derivation

11. Applied rewrites 68.7%

    \[\leadsto \mathsf{fma}\left(-1, w, 1\right) \cdot \ell \]
12. Add Preprocessing

Alternative 15: 57.0% accurate, 309.0× speedup

Math

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

FPCore

(FPCore (w l) :precision binary64 l)

C

double code(double w, double l) {
	return l;
}

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(w, l)
use fmin_fmax_functions
    real(8), intent (in) :: w
    real(8), intent (in) :: l
    code = l
end function

Java

public static double code(double w, double l) {
	return l;
}

Python

def code(w, l):
	return l

Julia

function code(w, l)
	return l
end

MATLAB

function tmp = code(w, l)
	tmp = l;
end

Wolfram

code[w_, l_] := l

Derivation

1. Initial program 99.4%

   \[e^{-w} \cdot {\ell}^{\left(e^{w}\right)} \]
2. Add Preprocessing

3. Taylor expanded in w around 0

   \[\leadsto \color{blue}{\ell} \]
4. Step-by-step derivation

5. Applied rewrites 60.8%

   \[\leadsto \color{blue}{\ell} \]
6. Add Preprocessing

Reproduce

herbie shell --seed 2025082 
(FPCore (w l)
  :name "exp-w (used to crash)"
  :precision binary64
  (* (exp (- w)) (pow l (exp w))))