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
10 lines
485 B
Plaintext
10 lines
485 B
Plaintext
// AffineGapPenalty: the score of a gap of Length positions under an affine
|
|
// gap model (Gotoh, 1982): Open for the first position and Extend for each
|
|
// one after it, so one long gap costs less than many short ones. With
|
|
// Open == Extend it is the linear model.
|
|
FUNCTION AffineGapPenalty(Length : INTEGER, Open : INTEGER, Extend : INTEGER) RETURNS INTEGER
|
|
REQUIRE Length >= 1
|
|
ENSURE RESULT == Open + (Length - 1) * Extend
|
|
RETURN Open + (Length - 1) * Extend
|
|
ENDFUNCTION
|