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
18 lines
744 B
Plaintext
18 lines
744 B
Plaintext
// KahanSum: the sum of a list of FLOAT values by compensated summation
|
|
// (Kahan, 1965). C holds the low-order part the last addition lost, and the
|
|
// next addition puts it back, so the error does not grow with the length of
|
|
// the list. In exact arithmetic C is always 0 and this is the plain sum: the
|
|
// compensation exists only because of rounding. A compiler allowed to
|
|
// reorder FLOAT arithmetic (-ffast-math) can simplify C away.
|
|
FUNCTION KahanSum(X : LIST OF FLOAT) RETURNS FLOAT
|
|
DECLARE Total : FLOAT <- 0.0
|
|
DECLARE C : FLOAT <- 0.0
|
|
FOR I <- 0 TO LENGTH(X)
|
|
DECLARE Y : FLOAT <- X[I] - C
|
|
DECLARE T : FLOAT <- Total + Y
|
|
C <- (T - Total) - Y
|
|
Total <- T
|
|
NEXT I
|
|
RETURN Total
|
|
ENDFUNCTION
|