Text.Parsec.Token:makeTokenParser from parsec-3.1.9, A

Average Error: 0.0 → 0.0

Time: 3.4s

Precision: binary64

Cost: 320

Math

\[\frac{x + y}{10} \]

↓

\[\frac{x + y}{10} \]

FPCore

(FPCore (x y) :precision binary64 (/ (+ x y) 10.0))

↓

(FPCore (x y) :precision binary64 (/ (+ x y) 10.0))

C

double code(double x, double y) {
	return (x + y) / 10.0;
}

↓

double code(double x, double y) {
	return (x + y) / 10.0;
}

Fortran

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x + y) / 10.0d0
end function

↓

real(8) function code(x, y)
    real(8), intent (in) :: x
    real(8), intent (in) :: y
    code = (x + y) / 10.0d0
end function

Java

public static double code(double x, double y) {
	return (x + y) / 10.0;
}

↓

public static double code(double x, double y) {
	return (x + y) / 10.0;
}

Python

def code(x, y):
	return (x + y) / 10.0

↓

def code(x, y):
	return (x + y) / 10.0

Julia

function code(x, y)
	return Float64(Float64(x + y) / 10.0)
end

↓

function code(x, y)
	return Float64(Float64(x + y) / 10.0)
end

MATLAB

function tmp = code(x, y)
	tmp = (x + y) / 10.0;
end

↓

function tmp = code(x, y)
	tmp = (x + y) / 10.0;
end

Wolfram

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

↓

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

Derivation

1. Initial program 0.0

   \[\frac{x + y}{10} \]

2. Final simplification 0.0

   \[\leadsto \frac{x + y}{10} \]

Alternatives

Alternative 1
Error	25.0
Cost	589

\[\begin{array}{l} \mathbf{if}\;y \leq 1.5 \cdot 10^{-100} \lor \neg \left(y \leq 6.5 \cdot 10^{-13}\right) \land y \leq 8.8 \cdot 10^{+50}:\\ \;\;\;\;x \cdot 0.1\\ \mathbf{else}:\\ \;\;\;\;y \cdot 0.1\\ \end{array} \]

Alternative 2
Error	31.5
Cost	192

\[x \cdot 0.1 \]

Reproduce

herbie shell --seed 2022364 
(FPCore (x y)
  :name "Text.Parsec.Token:makeTokenParser from parsec-3.1.9, A"
  :precision binary64
  (/ (+ x y) 10.0))