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,9 @@
def variance(x: List[Float64]) -> Float64:
var m: Float64 = 0.0
for i in range(len(x)):
m = m + x[i]
m = m / Float64(len(x))
var total: Float64 = 0.0
for i in range(len(x)):
total = total + (x[i] - m) * (x[i] - m)
return total / Float64(len(x) - 1)
@@ -0,0 +1,9 @@
def variance(x):
m = 0.0
for v in x:
m += v
m /= len(x)
total = 0.0
for v in x:
total += (v - m) * (v - m)
return total / (len(x) - 1)
@@ -0,0 +1,5 @@
import statistics
def variance(x):
return statistics.variance(x)
+46
View File
@@ -0,0 +1,46 @@
{
"name": "Variance",
"summary": "The sample variance of a list of numbers (dividing by N - 1), computed in two passes.",
"tags": [
"statistics",
"cancellation"
],
"sources": [
{
"title": "Chan, Golub and LeVeque, Algorithms for computing the sample variance (1983)",
"url": "https://doi.org/10.1080/00031305.1983.10483115"
}
],
"cases": [
{
"call": "Variance([2.0, 4.0, 4.0, 4.0, 5.0, 5.0, 7.0, 9.0])"
},
{
"call": "Variance([1.0, 2.0])"
},
{
"call": "Variance([1.0e9 + 4.0, 1.0e9 + 7.0, 1.0e9 + 13.0, 1.0e9 + 16.0])"
}
],
"references": [
{
"lang": "python",
"level": "plain",
"file": "ref/python/plain.py",
"note": "The same two passes."
},
{
"lang": "python",
"level": "statistics",
"file": "ref/python/statistics.py",
"note": "The standard library's statistics.variance, which works with exact fractions inside: a different method, held to agree to 12 digits.",
"rel": 1e-12
},
{
"lang": "mojo",
"level": "plain",
"file": "ref/mojo/plain.mojo",
"note": "The same two passes in Mojo."
}
]
}
+14
View File
@@ -0,0 +1,14 @@
// Variance: the sample variance (dividing by N - 1), in two passes: the mean
// first, then the squared distances from it. The one-pass formula
// (SUM X^2 - N * MEAN^2) / (N - 1) subtracts two nearly equal large numbers
// and loses every digit when the values sit far from 0, as the third case shows.
USE stats.Mean
FUNCTION Variance(X : LIST OF FLOAT) RETURNS FLOAT
REQUIRE LENGTH(X) >= 2
DECLARE M : FLOAT <- Mean(X)
DECLARE Total : FLOAT <- 0.0
FOR I <- 0 TO LENGTH(X)
Total <- Total + (X[I] - M) * (X[I] - M)
NEXT I
RETURN Total / (LENGTH(X) - 1)
ENDFUNCTION