Routines written once in pseudo and checked at every level, so programs can use them by name instead of rewriting and re-verifying them: - stats: Mean, Variance (two-pass) - numerics: KahanSum, LinearInterp, Trapezoid - align: LinearGapPenalty, AffineGapPenalty, MatchScore, NeedlemanWunschScore - md: LennardJones, LennardJonesForce, MinimumImage, PairDistance - seq: GCContent, HammingDistance - special: ErfApprox (Abramowitz and Stegun 7.1.26) Each has contracts, cases, reference implementations in Python, Mojo and (for the numerical ones) C at more than one level, and nine have a Dafny proof over exact numbers. status.json and STATUS.md are written by pplus-core's library-check: every check passes or is open/unverified as listed there. The Mojo references still need the pinned compiler's answers (library-verify-mojo, network). Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01FgvbRdoEheAHqsRmr2WuKZ
16 lines
710 B
Plaintext
16 lines
710 B
Plaintext
// ErfApprox: the error function by Abramowitz and Stegun's formula 7.1.26,
|
|
// with an absolute error below 1.5e-7 for every X. It is an approximation
|
|
// with a stated bound, not the correctly rounded erf: the libm reference
|
|
// holds it to that bound. ERF(X) for X < 0 is -ERF(-X), so the sign is set
|
|
// aside first.
|
|
FUNCTION ErfApprox(X : FLOAT) RETURNS FLOAT
|
|
DECLARE Sign : FLOAT <- 1.0
|
|
IF X < 0.0 THEN
|
|
Sign <- -1.0
|
|
ENDIF
|
|
DECLARE A : FLOAT <- ABS(X)
|
|
DECLARE T : FLOAT <- 1.0 / (1.0 + 0.3275911 * A)
|
|
DECLARE Poly : FLOAT <- ((((1.061405429 * T - 1.453152027) * T + 1.421413741) * T - 0.284496736) * T + 0.254829592) * T
|
|
RETURN Sign * (1.0 - Poly * EXP(-A * A))
|
|
ENDFUNCTION
|