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
12 lines
458 B
Plaintext
12 lines
458 B
Plaintext
// Trapezoid: the integral of samples Y taken H apart, by the composite
|
|
// trapezoidal rule: the ends count half, every inside sample counts whole.
|
|
// The error shrinks with H^2 for a smooth function.
|
|
FUNCTION Trapezoid(Y : LIST OF FLOAT, H : FLOAT) RETURNS FLOAT
|
|
REQUIRE LENGTH(Y) >= 2
|
|
DECLARE Total : FLOAT <- (Y[0] + Y[LENGTH(Y) - 1]) / 2.0
|
|
FOR I <- 1 TO LENGTH(Y) - 1
|
|
Total <- Total + Y[I]
|
|
NEXT I
|
|
RETURN Total * H
|
|
ENDFUNCTION
|