Routines that many programs need (a mean, a gap penalty, the Lennard-Jones potential, the minimum image convention) were rewritten and re-verified each time, and there was no way to open one and see exactly what it does. They now live in pplus-library, pinned here as the submodule library/, and a program brings them in with USE. - USE module / USE module.Routine (pseudo-study resolveUses): each routine is studied once in its own file (its own USE lines resolved the same way, cycles refused) and handed to the checker as a library routine; unknown-library, unknown-routine, library-clash, use-place. - A run steps over a library routine (one step at the call, one at the return, none of its lines); a broken contract is reported at the call, naming the routine. The prover uses its REQUIRE and ENSURE at the call and does not prove it again; it is not a unit of the program. - pseudo-to-mojo writes each library routine the program calls once, dependencies first, labeled as coming from the library. - src/library: the registry USE reads, generated from library/ (scripts/library.mjs emit), so the site needs no files at run time. - scripts/library.mjs check: every routine at every level: structure, cases, prover, fuzzer, generated Mojo, each reference implementation (CPython; cc at -O0 and -O2; core's Mojo interpreter; the pinned compiler's stored answer) held to the pseudo's results, and the Dafny proof with the pinned Dafny. Writes library/status.json and STATUS.md. scripts/library_godbolt.py stores the compiler's answers (network). - pixi tasks library-check, library-emit, library-verify-mojo, library-harness; CI checks out the submodule and runs library-check. - Tests: tests/library.test.mjs, corpus 53-library; docs/library.md and a library section in trust.md. Gate: 332 pass; library-check: no failing check (16 routines; the Mojo references are unverified until library-verify-mojo runs on the network). Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01FgvbRdoEheAHqsRmr2WuKZ
6.2 KiB
Translation coverage
Each translator in src/sync/ is run over every exercise with pseudo (17), every program in tests/corpus/ (53), and 17 one-construct fixtures (tests/helpers/sync-programs.mjs). 3 of the 87 have pseudo that does not read, by design (they teach the notation's error messages), and are left out below. That leaves 84 programs.
| From pseudo to | Says it completely | Says it with a gap or a checker error | Cannot say it |
|---|---|---|---|
| Mojo | 81 | 3 | 0 |
| lingo | 31 | 0 | 53 |
| matho | 3 | 0 | 81 |
Mojo is a program-for-program translation that always produces something: a line with no faithful spelling becomes a visible raise Error("not translated: pseudo line N") and a warning. Lingo and matho must read back as the same program, so what they cannot say exactly they refuse, with the construct and its line, and the pane keeps its last good text.
Mojo: lines that become a visible gap
These programs translate, with the listed lines left as a raise Error.
| What it has no form for | Programs | Which |
|---|---|---|
| Programming+ could not translate this line into Mojo (the built-in EXACT, which Mojo's standard library has no function for). The generated code stops here with an error instead of guessing. | 1 | 50-float32.pseudo |
Mojo: programs the translator refuses
Pseudo the course itself rejects is not translated.
Nothing.
lingo: what English has no sentence for
English is read by readSteps, whose grammar has no sentence for these.
| What it has no form for | Programs | Which |
|---|---|---|
| steps outside a routine (every English step belongs to a routine) | 51 | 01-arithmetic.pseudo, 02-temperature.pseudo, 03-compound-interest.pseudo, 04-gcd-recursion.pseudo, and 47 more |
| a fixed-length ARRAY | 4 | ex:edit-distance, 05-primes-sieve.pseudo, 11-matrix-multiply.pseudo, 15-game-of-life.pseudo |
| a BYREF parameter | 3 | 06-fibonacci-memo.pseudo, 10-insertion-sort.pseudo, 26-swap-byref.pseudo |
| a HASHMAP whose values are not counts | 3 | ex:translate-codons, 13-stack-brackets.pseudo, 39-constants-codons.pseudo |
| a change to this part of a value | 2 | ex:edit-distance, 16-running-stats.pseudo |
| a DEFINE set | 2 | ex:translate-codons, 21-sets.pseudo |
| a loop step that is not a whole number written out | 2 | 05-primes-sieve.pseudo, 39-constants-codons.pseudo |
| a record | 2 | 12-records.pseudo, 16-running-stats.pseudo |
| a record type | 2 | 12-records.pseudo, 16-running-stats.pseudo |
| REMOVE(...) | 2 | 13-stack-brackets.pseudo, 14-queue-bfs.pseudo |
| the built-in ROWS | 2 | 11-matrix-multiply.pseudo, 15-game-of-life.pseudo |
| this kind of position | 2 | ex:edit-distance, 15-game-of-life.pseudo |
| a CONSTANT | 1 | 39-constants-codons.pseudo |
| a Field value | 1 | 12-records.pseudo |
| PARALLEL FOR | 1 | 43-parallel-map.pseudo |
| REPEAT ... UNTIL, which English reads as a loop that tests first | 1 | 46-projectile.pseudo |
| the built-in CHOOSE | 1 | 47-binomial-and-ph.pseudo |
| the built-in CHR | 1 | 08-caesar.pseudo |
| the built-in COS | 1 | 46-projectile.pseudo |
| the built-in FILL | 1 | 43-parallel-map.pseudo |
| the built-in LOG10 | 1 | 47-binomial-and-ph.pseudo |
| the built-in SIN | 1 | 46-projectile.pseudo |
| the built-in SPLIT | 1 | 40-text-builtins.pseudo |
| the built-in TO_INTEGER | 1 | 22-binary-to-decimal.pseudo |
| the built-in TO_STRING | 1 | 22-binary-to-decimal.pseudo |
matho: what is not an equation
An equation lowers to one FUNCTION that returns a value; a program with output, text, a loop that does more than add up, or steps outside a function is not one.
| What it has no form for | Programs | Which |
|---|---|---|
| steps outside a function (an equation is a function) | 47 | 01-arithmetic.pseudo, 02-temperature.pseudo, 03-compound-interest.pseudo, 04-gcd-recursion.pseudo, and 43 more |
| a function that answers LIST (equations answer numbers) | 5 | ex:match, ex:match-proved, ex:match-off-by-one, ex:match-reset, and 1 more |
| a function that answers STRING (equations answer numbers) | 5 | ex:revcomp, fixture:string-build, fixture:slice, fixture:case, and 1 more |
| a function that answers BOOL (equations answer numbers) | 3 | ex:binary-search, fixture:early-return, fixture:forall |
| a loop that is not adding up or multiplying one value (FOR) | 3 | ex:best-position, fixture:loop-down, fixture:break-continue |
| the input T, which is not a number or a list of numbers | 3 | ex:first-unknown, ex:gc-fraction, fixture:set |
| a DEFINE set | 2 | ex:translate-codons, 21-sets.pseudo |
| a function that answers HASHMAP (equations answer numbers) | 2 | ex:tally, ex:kmers |
| a record type | 2 | 12-records.pseudo, 16-running-stats.pseudo |
| the input A, which is not a number or a list of numbers | 2 | ex:hamming, ex:edit-distance |
| the input B, which is not a number or a list of numbers | 2 | ex:count-base, ex:count-base-proved |
| a CONSTANT | 1 | 39-constants-codons.pseudo |
| a loop with a STEP | 1 | fixture:loop-step |
| a position that is not a loop counter plus or minus a number | 1 | fixture:min-max |
| a PROCEDURE | 1 | fixture:procedure |
| a WHILE loop | 1 | fixture:div-mod |
matho: the equation sets
Each set in tests/matho.test.mjs is lowered to pseudo by the matho reader, written back as equations by pseudoToMatho, and checked: 26 of 28 round-trip.
| Equation set | Round-trips | Why not |
|---|---|---|
| mean-and-variance | yes | |
| mean | yes | |
| sum-from-one | yes | |
| sum-no-bounds | yes | |
| binomial | yes | |
| height | yes | |
| kinetic | yes | |
| gravity | yes | |
| omega | yes | |
| normal-density | yes | |
| ph | yes | |
| log2 | yes | |
| ln-and-log | yes | |
| factorial | yes | |
| choose | no | the loop counter K2 (matho writes it as a single letter) |
| cosine | yes | |
| distance | yes | |
| matrix-row | no | a two-dimensional position that is not two loop counters |
| nested-sums | yes | |
| relu | yes | |
| piecewise | yes | |
| calls-an-earlier-equation | yes | |
| sum-over-a-set | yes | |
| floor | yes | |
| ceiling | yes | |
| absolute | yes | |
| max-min | yes | |
| mod | yes |