Start pplus-library: 16 verified routines in six modules

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
This commit is contained in:
alexmandClaude committed 2026-10-05 11:58:22 +00:00
commit df12b2a008
103 files changed
+3025

No files matched your search

@@ -0,0 +1,12 @@
{
"tool": "dafny",
"version": "4.11.0",
"flags": [
"verify",
"--resource-limit",
"20000000"
],
"source_sha256": "374ce6664efd8802bb90e120a1107375c0ab607c9829987b26d73d5f5fd4b009",
"verdict": "verified",
"summary": "1 verified, 0 errors"
}
@@ -0,0 +1,5 @@
method MatchScore(a: char, b: char, match_: int, mismatch: int) returns (r: int)
ensures (a == b && r == match_) || (a != b && r == mismatch)
{
if a == b { r := match_; } else { r := mismatch; }
}
@@ -0,0 +1,4 @@
def match_score(a: String, b: String, match_: Int, mismatch: Int) -> Int:
if a == b:
return match_
return mismatch
@@ -0,0 +1,2 @@
def match_score(a, b, match, mismatch):
return match if a == b else mismatch
+43
View File
@@ -0,0 +1,43 @@
{
"name": "MatchScore",
"summary": "The score of aligning letter A with letter B: Match when they are the same, Mismatch otherwise.",
"tags": [
"alignment",
"scoring"
],
"sources": [
{
"title": "Durbin, Eddy, Krogh and Mitchison, Biological Sequence Analysis, section 2.2"
}
],
"cases": [
{
"call": "MatchScore('A', 'A', 1, -1)"
},
{
"call": "MatchScore('A', 'G', 1, -1)"
},
{
"call": "MatchScore('T', 'T', 5, -4)"
}
],
"references": [
{
"lang": "python",
"level": "plain",
"file": "ref/python/plain.py",
"note": "The same test."
},
{
"lang": "mojo",
"level": "plain",
"file": "ref/mojo/plain.mojo",
"note": "The same test in Mojo; a letter is a String of one character."
}
],
"proof": {
"lang": "dafny",
"file": "proof/match_score.dfy",
"note": "The score is Match exactly when the letters agree."
}
}
+10
View File
@@ -0,0 +1,10 @@
// MatchScore: the score of aligning letter A with letter B: Match when they
// are the same letter, Mismatch otherwise. The simplest substitution score;
// a substitution matrix such as BLOSUM62 replaces it for proteins.
FUNCTION MatchScore(A : CHAR, B : CHAR, Match : INTEGER, Mismatch : INTEGER) RETURNS INTEGER
ENSURE (A == B AND RESULT == Match) OR (A != B AND RESULT == Mismatch)
IF A == B THEN
RETURN Match
ENDIF
RETURN Mismatch
ENDFUNCTION