Data.Number.Erf:$dmerfcx from erf-2.0.0.0

Percentage Accurate: 100.0% → 100.0%

Time: 6.9s

Alternatives: 12

Speedup: 1.0×

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

Specification

Math

\[\begin{array}{l} \\ x \cdot e^{y \cdot y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* x (exp (* y y))))

C

double code(double x, double y) {
	return x * exp((y * y));
}

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

Java

public static double code(double x, double y) {
	return x * Math.exp((y * y));
}

Python

def code(x, y):
	return x * math.exp((y * y))

Julia

function code(x, y)
	return Float64(x * exp(Float64(y * y)))
end

MATLAB

function tmp = code(x, y)
	tmp = x * exp((y * y));
end

Wolfram

code[x_, y_] := N[(x * N[Exp[N[(y * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Initial Program: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot e^{y \cdot y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* x (exp (* y y))))

C

double code(double x, double y) {
	return x * exp((y * y));
}

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

Java

public static double code(double x, double y) {
	return x * Math.exp((y * y));
}

Python

def code(x, y):
	return x * math.exp((y * y))

Julia

function code(x, y)
	return Float64(x * exp(Float64(y * y)))
end

MATLAB

function tmp = code(x, y)
	tmp = x * exp((y * y));
end

Wolfram

code[x_, y_] := N[(x * N[Exp[N[(y * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Alternative 1: 100.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ x \cdot {\left(e^{y + y}\right)}^{\left(0.5 \cdot y\right)} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* x (pow (exp (+ y y)) (* 0.5 y))))

C

double code(double x, double y) {
	return x * pow(exp((y + y)), (0.5 * y));
}

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(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x * (exp((y + y)) ** (0.5d0 * y))
end function

Java

public static double code(double x, double y) {
	return x * Math.pow(Math.exp((y + y)), (0.5 * y));
}

Python

def code(x, y):
	return x * math.pow(math.exp((y + y)), (0.5 * y))

Julia

function code(x, y)
	return Float64(x * (exp(Float64(y + y)) ^ Float64(0.5 * y)))
end

MATLAB

function tmp = code(x, y)
	tmp = x * (exp((y + y)) ^ (0.5 * y));
end

Wolfram

code[x_, y_] := N[(x * N[Power[N[Exp[N[(y + y), $MachinePrecision]], $MachinePrecision], N[(0.5 * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[x \cdot e^{y \cdot y} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-exp.f64 N/A

      \[\leadsto x \cdot \color{blue}{e^{y \cdot y}} \]

   2. lift-*.f64 N/A

      \[\leadsto x \cdot e^{\color{blue}{y \cdot y}} \]

   3. exp-prod N/A

      \[\leadsto x \cdot \color{blue}{{\left(e^{y}\right)}^{y}} \]

   4. sqr-pow N/A

      \[\leadsto x \cdot \color{blue}{\left({\left(e^{y}\right)}^{\left(\frac{y}{2}\right)} \cdot {\left(e^{y}\right)}^{\left(\frac{y}{2}\right)}\right)} \]

   5. pow-prod-down N/A

      \[\leadsto x \cdot \color{blue}{{\left(e^{y} \cdot e^{y}\right)}^{\left(\frac{y}{2}\right)}} \]

   6. lower-pow.f64 N/A

      \[\leadsto x \cdot \color{blue}{{\left(e^{y} \cdot e^{y}\right)}^{\left(\frac{y}{2}\right)}} \]

   7. lower-*.f64 N/A

      \[\leadsto x \cdot {\color{blue}{\left(e^{y} \cdot e^{y}\right)}}^{\left(\frac{y}{2}\right)} \]

   8. lower-exp.f64 N/A

      \[\leadsto x \cdot {\left(\color{blue}{e^{y}} \cdot e^{y}\right)}^{\left(\frac{y}{2}\right)} \]

   9. lower-exp.f64 N/A

      \[\leadsto x \cdot {\left(e^{y} \cdot \color{blue}{e^{y}}\right)}^{\left(\frac{y}{2}\right)} \]

   10. lower-/.f64 100.0

       \[\leadsto x \cdot {\left(e^{y} \cdot e^{y}\right)}^{\color{blue}{\left(\frac{y}{2}\right)}} \]

4. Applied rewrites 100.0%

   \[\leadsto x \cdot \color{blue}{{\left(e^{y} \cdot e^{y}\right)}^{\left(\frac{y}{2}\right)}} \]
5. Step-by-step derivation

   1. lift-*.f64 N/A

      \[\leadsto x \cdot {\color{blue}{\left(e^{y} \cdot e^{y}\right)}}^{\left(\frac{y}{2}\right)} \]

   2. lift-exp.f64 N/A

      \[\leadsto x \cdot {\left(\color{blue}{e^{y}} \cdot e^{y}\right)}^{\left(\frac{y}{2}\right)} \]

   3. lift-exp.f64 N/A

      \[\leadsto x \cdot {\left(e^{y} \cdot \color{blue}{e^{y}}\right)}^{\left(\frac{y}{2}\right)} \]

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

      \[\leadsto x \cdot {\color{blue}{\left(e^{y \cdot 2}\right)}}^{\left(\frac{y}{2}\right)} \]

   5. lower-exp.f64 N/A

      \[\leadsto x \cdot {\color{blue}{\left(e^{y \cdot 2}\right)}}^{\left(\frac{y}{2}\right)} \]

   6. *-commutative N/A

      \[\leadsto x \cdot {\left(e^{\color{blue}{2 \cdot y}}\right)}^{\left(\frac{y}{2}\right)} \]

   7. lower-*.f64 100.0

      \[\leadsto x \cdot {\left(e^{\color{blue}{2 \cdot y}}\right)}^{\left(\frac{y}{2}\right)} \]

6. Applied rewrites 100.0%

   \[\leadsto x \cdot {\color{blue}{\left(e^{2 \cdot y}\right)}}^{\left(\frac{y}{2}\right)} \]

7. Taylor expanded in y around 0

   \[\leadsto x \cdot {\left(e^{2 \cdot y}\right)}^{\color{blue}{\left(\frac{1}{2} \cdot y\right)}} \]
8. Step-by-step derivation

   1. lower-*.f64 100.0

      \[\leadsto x \cdot {\left(e^{2 \cdot y}\right)}^{\color{blue}{\left(0.5 \cdot y\right)}} \]

9. Applied rewrites 100.0%

   \[\leadsto x \cdot {\left(e^{2 \cdot y}\right)}^{\color{blue}{\left(0.5 \cdot y\right)}} \]
10. Step-by-step derivation

    1. lift-*.f64 N/A

       \[\leadsto x \cdot {\left(e^{\color{blue}{2 \cdot y}}\right)}^{\left(\frac{1}{2} \cdot y\right)} \]

    2. count-2-rev N/A

       \[\leadsto x \cdot {\left(e^{\color{blue}{y + y}}\right)}^{\left(\frac{1}{2} \cdot y\right)} \]

    3. lower-+.f64 100.0

       \[\leadsto x \cdot {\left(e^{\color{blue}{y + y}}\right)}^{\left(0.5 \cdot y\right)} \]

11. Applied rewrites 100.0%

    \[\leadsto x \cdot {\left(e^{\color{blue}{y + y}}\right)}^{\left(0.5 \cdot y\right)} \]
12. Add Preprocessing

Alternative 2: 100.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ {\left(e^{y}\right)}^{y} \cdot x \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* (pow (exp y) y) x))

C

double code(double x, double y) {
	return pow(exp(y), y) * x;
}

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

Java

public static double code(double x, double y) {
	return Math.pow(Math.exp(y), y) * x;
}

Python

def code(x, y):
	return math.pow(math.exp(y), y) * x

Julia

function code(x, y)
	return Float64((exp(y) ^ y) * x)
end

MATLAB

function tmp = code(x, y)
	tmp = (exp(y) ^ y) * x;
end

Wolfram

code[x_, y_] := N[(N[Power[N[Exp[y], $MachinePrecision], y], $MachinePrecision] * x), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[x \cdot e^{y \cdot y} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-*.f64 N/A

      \[\leadsto \color{blue}{x \cdot e^{y \cdot y}} \]

   2. *-commutative N/A

      \[\leadsto \color{blue}{e^{y \cdot y} \cdot x} \]

   3. lower-*.f64 99.9

      \[\leadsto \color{blue}{e^{y \cdot y} \cdot x} \]

   4. lift-exp.f64 N/A

      \[\leadsto \color{blue}{e^{y \cdot y}} \cdot x \]

   5. lift-*.f64 N/A

      \[\leadsto e^{\color{blue}{y \cdot y}} \cdot x \]

   6. exp-prod N/A

      \[\leadsto \color{blue}{{\left(e^{y}\right)}^{y}} \cdot x \]

   7. lower-pow.f64 N/A

      \[\leadsto \color{blue}{{\left(e^{y}\right)}^{y}} \cdot x \]

   8. lower-exp.f64 100.0

      \[\leadsto {\color{blue}{\left(e^{y}\right)}}^{y} \cdot x \]

4. Applied rewrites 100.0%

   \[\leadsto \color{blue}{{\left(e^{y}\right)}^{y} \cdot x} \]
5. Add Preprocessing

Alternative 3: 100.0% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ x \cdot e^{y \cdot y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* x (exp (* y y))))

C

double code(double x, double y) {
	return x * exp((y * y));
}

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

Java

public static double code(double x, double y) {
	return x * Math.exp((y * y));
}

Python

def code(x, y):
	return x * math.exp((y * y))

Julia

function code(x, y)
	return Float64(x * exp(Float64(y * y)))
end

MATLAB

function tmp = code(x, y)
	tmp = x * exp((y * y));
end

Wolfram

code[x_, y_] := N[(x * N[Exp[N[(y * y), $MachinePrecision]], $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[x \cdot e^{y \cdot y} \]
2. Add Preprocessing
3. Add Preprocessing

Alternative 4: 74.6% accurate, 1.0× speedup

Math

\[\begin{array}{l} \\ {\left(1 + y\right)}^{y} \cdot x \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* (pow (+ 1.0 y) y) x))

C

double code(double x, double y) {
	return pow((1.0 + y), y) * x;
}

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(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = ((1.0d0 + y) ** y) * x
end function

Java

public static double code(double x, double y) {
	return Math.pow((1.0 + y), y) * x;
}

Python

def code(x, y):
	return math.pow((1.0 + y), y) * x

Julia

function code(x, y)
	return Float64((Float64(1.0 + y) ^ y) * x)
end

MATLAB

function tmp = code(x, y)
	tmp = ((1.0 + y) ^ y) * x;
end

Wolfram

code[x_, y_] := N[(N[Power[N[(1.0 + y), $MachinePrecision], y], $MachinePrecision] * x), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[x \cdot e^{y \cdot y} \]
2. Add Preprocessing
3. Step-by-step derivation

   1. lift-*.f64 N/A

      \[\leadsto \color{blue}{x \cdot e^{y \cdot y}} \]

   2. *-commutative N/A

      \[\leadsto \color{blue}{e^{y \cdot y} \cdot x} \]

   3. lower-*.f64 99.9

      \[\leadsto \color{blue}{e^{y \cdot y} \cdot x} \]

   4. lift-exp.f64 N/A

      \[\leadsto \color{blue}{e^{y \cdot y}} \cdot x \]

   5. lift-*.f64 N/A

      \[\leadsto e^{\color{blue}{y \cdot y}} \cdot x \]

   6. exp-prod N/A

      \[\leadsto \color{blue}{{\left(e^{y}\right)}^{y}} \cdot x \]

   7. lower-pow.f64 N/A

      \[\leadsto \color{blue}{{\left(e^{y}\right)}^{y}} \cdot x \]

   8. lower-exp.f64 100.0

      \[\leadsto {\color{blue}{\left(e^{y}\right)}}^{y} \cdot x \]

4. Applied rewrites 100.0%

   \[\leadsto \color{blue}{{\left(e^{y}\right)}^{y} \cdot x} \]

5. Taylor expanded in y around 0

   \[\leadsto {\color{blue}{\left(1 + y\right)}}^{y} \cdot x \]
6. Step-by-step derivation

   1. lower-+.f64 76.7

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

7. Applied rewrites 76.7%

   \[\leadsto {\color{blue}{\left(1 + y\right)}}^{y} \cdot x \]
8. Add Preprocessing

Alternative 5: 93.4% accurate, 2.8× speedup

Math

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

FPCore

(FPCore (x y)
 :precision binary64
 (fma y (* (* (fma (fma (* y y) 0.16666666666666666 0.5) (* y y) 1.0) y) x) x))

C

double code(double x, double y) {
	return fma(y, ((fma(fma((y * y), 0.16666666666666666, 0.5), (y * y), 1.0) * y) * x), x);
}

Julia

function code(x, y)
	return fma(y, Float64(Float64(fma(fma(Float64(y * y), 0.16666666666666666, 0.5), Float64(y * y), 1.0) * y) * x), x)
end

Wolfram

code[x_, y_] := N[(y * N[(N[(N[(N[(N[(y * y), $MachinePrecision] * 0.16666666666666666 + 0.5), $MachinePrecision] * N[(y * y), $MachinePrecision] + 1.0), $MachinePrecision] * y), $MachinePrecision] * x), $MachinePrecision] + x), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[x \cdot e^{y \cdot y} \]
2. Add Preprocessing

3. Taylor expanded in y around 0

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

5. Applied rewrites 91.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\left(y \cdot y\right) \cdot x, \mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, y \cdot y, 0.5\right), y \cdot y, 1\right), x\right)} \]
6. Step-by-step derivation

7. Applied rewrites 91.0%

   \[\leadsto \mathsf{fma}\left(y, \color{blue}{y \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, y \cdot y, 0.5\right), y \cdot y, 1\right) \cdot x\right)}, x\right) \]
8. Step-by-step derivation

9. Applied rewrites 91.3%

   \[\leadsto \mathsf{fma}\left(y, \left(\mathsf{fma}\left(\mathsf{fma}\left(y \cdot y, 0.16666666666666666, 0.5\right), y \cdot y, 1\right) \cdot y\right) \cdot \color{blue}{x}, x\right) \]
10. Add Preprocessing

Alternative 6: 93.9% accurate, 2.9× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666 \cdot \left(y \cdot y\right), y \cdot y, 1\right) \cdot \left(y \cdot y\right), x, x\right) \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (fma (* (fma (* 0.16666666666666666 (* y y)) (* y y) 1.0) (* y y)) x x))

C

double code(double x, double y) {
	return fma((fma((0.16666666666666666 * (y * y)), (y * y), 1.0) * (y * y)), x, x);
}

Julia

function code(x, y)
	return fma(Float64(fma(Float64(0.16666666666666666 * Float64(y * y)), Float64(y * y), 1.0) * Float64(y * y)), x, x)
end

Wolfram

code[x_, y_] := N[(N[(N[(N[(0.16666666666666666 * N[(y * y), $MachinePrecision]), $MachinePrecision] * N[(y * y), $MachinePrecision] + 1.0), $MachinePrecision] * N[(y * y), $MachinePrecision]), $MachinePrecision] * x + x), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[x \cdot e^{y \cdot y} \]
2. Add Preprocessing

3. Taylor expanded in y around 0

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

5. Applied rewrites 91.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\left(y \cdot y\right) \cdot x, \mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, y \cdot y, 0.5\right), y \cdot y, 1\right), x\right)} \]
6. Step-by-step derivation

7. Applied rewrites 91.3%

   \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, y \cdot y, 0.5\right), y \cdot y, 1\right) \cdot \left(y \cdot y\right), \color{blue}{x}, x\right) \]

8. Taylor expanded in y around inf

   \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(\frac{1}{6} \cdot {y}^{2}, y \cdot y, 1\right) \cdot \left(y \cdot y\right), x, x\right) \]
9. Step-by-step derivation

10. Applied rewrites 91.2%

    \[\leadsto \mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666 \cdot \left(y \cdot y\right), y \cdot y, 1\right) \cdot \left(y \cdot y\right), x, x\right) \]
11. Add Preprocessing

Alternative 7: 92.5% accurate, 2.9× speedup

Math

\[\begin{array}{l} \\ \mathsf{fma}\left(y, y \cdot \left(\mathsf{fma}\left(0.16666666666666666 \cdot \left(y \cdot y\right), y \cdot y, 1\right) \cdot x\right), x\right) \end{array} \]

FPCore

(FPCore (x y)
 :precision binary64
 (fma y (* y (* (fma (* 0.16666666666666666 (* y y)) (* y y) 1.0) x)) x))

C

double code(double x, double y) {
	return fma(y, (y * (fma((0.16666666666666666 * (y * y)), (y * y), 1.0) * x)), x);
}

Julia

function code(x, y)
	return fma(y, Float64(y * Float64(fma(Float64(0.16666666666666666 * Float64(y * y)), Float64(y * y), 1.0) * x)), x)
end

Wolfram

code[x_, y_] := N[(y * N[(y * N[(N[(N[(0.16666666666666666 * N[(y * y), $MachinePrecision]), $MachinePrecision] * N[(y * y), $MachinePrecision] + 1.0), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[x \cdot e^{y \cdot y} \]
2. Add Preprocessing

3. Taylor expanded in y around 0

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

5. Applied rewrites 91.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\left(y \cdot y\right) \cdot x, \mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, y \cdot y, 0.5\right), y \cdot y, 1\right), x\right)} \]
6. Step-by-step derivation

7. Applied rewrites 91.0%

   \[\leadsto \mathsf{fma}\left(y, \color{blue}{y \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, y \cdot y, 0.5\right), y \cdot y, 1\right) \cdot x\right)}, x\right) \]

8. Taylor expanded in y around inf

   \[\leadsto \mathsf{fma}\left(y, y \cdot \left(\mathsf{fma}\left(\frac{1}{6} \cdot {y}^{2}, y \cdot y, 1\right) \cdot x\right), x\right) \]
9. Step-by-step derivation

10. Applied rewrites 90.8%

    \[\leadsto \mathsf{fma}\left(y, y \cdot \left(\mathsf{fma}\left(0.16666666666666666 \cdot \left(y \cdot y\right), y \cdot y, 1\right) \cdot x\right), x\right) \]
11. Add Preprocessing

Alternative 8: 91.0% accurate, 4.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (fma (* y (* (fma (* y y) 0.5 1.0) y)) x x))

C

double code(double x, double y) {
	return fma((y * (fma((y * y), 0.5, 1.0) * y)), x, x);
}

Julia

function code(x, y)
	return fma(Float64(y * Float64(fma(Float64(y * y), 0.5, 1.0) * y)), x, x)
end

Wolfram

code[x_, y_] := N[(N[(y * N[(N[(N[(y * y), $MachinePrecision] * 0.5 + 1.0), $MachinePrecision] * y), $MachinePrecision]), $MachinePrecision] * x + x), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[x \cdot e^{y \cdot y} \]
2. Add Preprocessing

3. Taylor expanded in y around 0

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

5. Applied rewrites 91.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\left(y \cdot y\right) \cdot x, \mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, y \cdot y, 0.5\right), y \cdot y, 1\right), x\right)} \]
6. Step-by-step derivation

7. Applied rewrites 91.0%

   \[\leadsto \mathsf{fma}\left(y, \color{blue}{y \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, y \cdot y, 0.5\right), y \cdot y, 1\right) \cdot x\right)}, x\right) \]

8. Taylor expanded in y around 0

   \[\leadsto \mathsf{fma}\left(y, y \cdot \left(\mathsf{fma}\left(\frac{1}{2}, y \cdot y, 1\right) \cdot x\right), x\right) \]
9. Step-by-step derivation

10. Applied rewrites 84.7%

    \[\leadsto \mathsf{fma}\left(y, y \cdot \left(\mathsf{fma}\left(0.5, y \cdot y, 1\right) \cdot x\right), x\right) \]
11. Step-by-step derivation

12. Applied rewrites 88.3%

    \[\leadsto \mathsf{fma}\left(y \cdot \left(\mathsf{fma}\left(y \cdot y, 0.5, 1\right) \cdot y\right), \color{blue}{x}, x\right) \]
13. Add Preprocessing

Alternative 9: 89.7% accurate, 4.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (fma y (* (* (fma (* y y) 0.5 1.0) y) x) x))

C

double code(double x, double y) {
	return fma(y, ((fma((y * y), 0.5, 1.0) * y) * x), x);
}

Julia

function code(x, y)
	return fma(y, Float64(Float64(fma(Float64(y * y), 0.5, 1.0) * y) * x), x)
end

Wolfram

code[x_, y_] := N[(y * N[(N[(N[(N[(y * y), $MachinePrecision] * 0.5 + 1.0), $MachinePrecision] * y), $MachinePrecision] * x), $MachinePrecision] + x), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[x \cdot e^{y \cdot y} \]
2. Add Preprocessing

3. Taylor expanded in y around 0

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

5. Applied rewrites 91.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\left(y \cdot y\right) \cdot x, \mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, y \cdot y, 0.5\right), y \cdot y, 1\right), x\right)} \]
6. Step-by-step derivation

7. Applied rewrites 91.0%

   \[\leadsto \mathsf{fma}\left(y, \color{blue}{y \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, y \cdot y, 0.5\right), y \cdot y, 1\right) \cdot x\right)}, x\right) \]

8. Taylor expanded in y around 0

   \[\leadsto \mathsf{fma}\left(y, y \cdot \left(\mathsf{fma}\left(\frac{1}{2}, y \cdot y, 1\right) \cdot x\right), x\right) \]
9. Step-by-step derivation

10. Applied rewrites 84.7%

    \[\leadsto \mathsf{fma}\left(y, y \cdot \left(\mathsf{fma}\left(0.5, y \cdot y, 1\right) \cdot x\right), x\right) \]
11. Step-by-step derivation

12. Applied rewrites 86.5%

    \[\leadsto \mathsf{fma}\left(y, \left(\mathsf{fma}\left(y \cdot y, 0.5, 1\right) \cdot y\right) \cdot \color{blue}{x}, x\right) \]
13. Add Preprocessing

Alternative 10: 88.5% accurate, 4.0× speedup

Math

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

FPCore

(FPCore (x y) :precision binary64 (fma y (* y (* (fma 0.5 (* y y) 1.0) x)) x))

C

double code(double x, double y) {
	return fma(y, (y * (fma(0.5, (y * y), 1.0) * x)), x);
}

Julia

function code(x, y)
	return fma(y, Float64(y * Float64(fma(0.5, Float64(y * y), 1.0) * x)), x)
end

Wolfram

code[x_, y_] := N[(y * N[(y * N[(N[(0.5 * N[(y * y), $MachinePrecision] + 1.0), $MachinePrecision] * x), $MachinePrecision]), $MachinePrecision] + x), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[x \cdot e^{y \cdot y} \]
2. Add Preprocessing

3. Taylor expanded in y around 0

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

5. Applied rewrites 91.0%

   \[\leadsto \color{blue}{\mathsf{fma}\left(\left(y \cdot y\right) \cdot x, \mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, y \cdot y, 0.5\right), y \cdot y, 1\right), x\right)} \]
6. Step-by-step derivation

7. Applied rewrites 91.0%

   \[\leadsto \mathsf{fma}\left(y, \color{blue}{y \cdot \left(\mathsf{fma}\left(\mathsf{fma}\left(0.16666666666666666, y \cdot y, 0.5\right), y \cdot y, 1\right) \cdot x\right)}, x\right) \]

8. Taylor expanded in y around 0

   \[\leadsto \mathsf{fma}\left(y, y \cdot \left(\mathsf{fma}\left(\frac{1}{2}, y \cdot y, 1\right) \cdot x\right), x\right) \]
9. Step-by-step derivation

10. Applied rewrites 84.7%

    \[\leadsto \mathsf{fma}\left(y, y \cdot \left(\mathsf{fma}\left(0.5, y \cdot y, 1\right) \cdot x\right), x\right) \]
11. Add Preprocessing

Alternative 11: 82.6% accurate, 9.3× speedup

Math

\[\begin{array}{l} \\ x \cdot \mathsf{fma}\left(y, y, 1\right) \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* x (fma y y 1.0)))

C

double code(double x, double y) {
	return x * fma(y, y, 1.0);
}

Julia

function code(x, y)
	return Float64(x * fma(y, y, 1.0))
end

Wolfram

code[x_, y_] := N[(x * N[(y * y + 1.0), $MachinePrecision]), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[x \cdot e^{y \cdot y} \]
2. Add Preprocessing

3. Taylor expanded in y around 0

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

   1. +-commutative N/A

      \[\leadsto x \cdot \color{blue}{\left({y}^{2} + 1\right)} \]

   2. unpow2 N/A

      \[\leadsto x \cdot \left(\color{blue}{y \cdot y} + 1\right) \]

   3. lower-fma.f64 81.0

      \[\leadsto x \cdot \color{blue}{\mathsf{fma}\left(y, y, 1\right)} \]

5. Applied rewrites 81.0%

   \[\leadsto x \cdot \color{blue}{\mathsf{fma}\left(y, y, 1\right)} \]
6. Add Preprocessing

Alternative 12: 52.0% accurate, 18.5× speedup

Math

\[\begin{array}{l} \\ x \cdot 1 \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* x 1.0))

C

double code(double x, double y) {
	return x * 1.0;
}

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(x, y)
use fmin_fmax_functions
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = x * 1.0d0
end function

Java

public static double code(double x, double y) {
	return x * 1.0;
}

Python

def code(x, y):
	return x * 1.0

Julia

function code(x, y)
	return Float64(x * 1.0)
end

MATLAB

function tmp = code(x, y)
	tmp = x * 1.0;
end

Wolfram

code[x_, y_] := N[(x * 1.0), $MachinePrecision]

Derivation

1. Initial program 99.9%

   \[x \cdot e^{y \cdot y} \]
2. Add Preprocessing

3. Taylor expanded in y around 0

   \[\leadsto x \cdot \color{blue}{1} \]
4. Step-by-step derivation

5. Applied rewrites 48.9%

   \[\leadsto x \cdot \color{blue}{1} \]
6. Add Preprocessing

Developer Target 1: 100.0% accurate, 0.5× speedup

Math

\[\begin{array}{l} \\ x \cdot {\left(e^{y}\right)}^{y} \end{array} \]

FPCore

(FPCore (x y) :precision binary64 (* x (pow (exp y) y)))

C

double code(double x, double y) {
	return x * pow(exp(y), y);
}

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

Java

public static double code(double x, double y) {
	return x * Math.pow(Math.exp(y), y);
}

Python

def code(x, y):
	return x * math.pow(math.exp(y), y)

Julia

function code(x, y)
	return Float64(x * (exp(y) ^ y))
end

MATLAB

function tmp = code(x, y)
	tmp = x * (exp(y) ^ y);
end

Wolfram

code[x_, y_] := N[(x * N[Power[N[Exp[y], $MachinePrecision], y], $MachinePrecision]), $MachinePrecision]

Reproduce

herbie shell --seed 2024354 
(FPCore (x y)
  :name "Data.Number.Erf:$dmerfcx from erf-2.0.0.0"
  :precision binary64

  :alt
  (! :herbie-platform default (* x (pow (exp y) y)))

  (* x (exp (* y y))))