Pseudo could say what a procedure computes only up to INTEGER and FLOAT, so it could not state what a Mojo or Python program with Int32, UInt8 or Float32 values will compute, and it had no words for rounding itself. - lang/parse: INT8..INT64, UINT8..UINT64, FLOAT32, FLOAT64 as types (INTEGER or FLOAT with a width, so every "whole number" rule accepts them); conversions written as Mojo writes them, INT32(X), FLOAT32(X); 1_000_000, 0xFF and 0b1010 literals; a type name as an argument (MAX_VALUE(INT8)); the USE line (USE IEEE now, library modules next). - check: widths and precisions never mix silently (mixed-width, mixed-precision); a literal takes the type of the sized value beside it, as in Mojo, and one that does not fit is an error before any run (literal-range); typing for every new built-in. - interp: a sized result, store, parameter, RETURN or conversion that does not fit stops the run (kind overflow), WRAP(X, T) wraps on purpose; FLOAT32 results are rounded to single precision; USE IEEE lets NaN and infinities flow. - numeric.js: exact helpers: FMA rounded once, EXACT(X) with every digit a FLOAT holds, ULP and NEXT_AFTER for both precisions, bit operations in two's complement. - Built-ins: ASIN ACOS ATAN SINH COSH TANH HYPOT POW CBRT EXPM1 LOG1P E TRUNC SIGN COPYSIGN CLAMP FMA IS_NAN IS_INF IS_FINITE INF NAN ULP NEXT_AFTER IS_CLOSE EXACT MAX_VALUE MIN_VALUE EPSILON GCD LCM BIT_AND BIT_OR BIT_XOR BIT_NOT SHIFT_LEFT SHIFT_RIGHT WRAP. They stay usable as names (a variable E, a FUNCTION GCD): the program's own wins. - vcgen: an overflow obligation on every sized result, then the range as a fact (also for sized parameters and loop-cut variables); FLOAT32 arithmetic as its own uninterpreted functions, constants rounded exactly, TOFLOAT32(v) otherwise; argument obligations for SQRT, the logarithms, ASIN/ACOS, LOG1P, CLAMP and the shifts; nothing proved under USE IEEE. - testing: the fuzzer tries the edges of a sized type and generates FLOAT32 values. - pseudo-to-mojo: Int8..Float32, conversions, the new built-ins through std.math (each name in the harvested index), a note where Mojo wraps. - Tests: numeric.test.mjs; corpus 49-52; prover fixtures int8-overflow, float32-store, ieee-nan; the reference documents every new form. Gate: 324 pass (core). New Mojo uses std.math names the interpreter has not been verified on (listed in sync-mojo's KNOWN_GAPS); they need pixi run mojo-verify on the network before the interpreter runs them. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_01FgvbRdoEheAHqsRmr2WuKZ
118 lines
6.2 KiB
Markdown
118 lines
6.2 KiB
Markdown
# Translation coverage
|
|
|
|
<!-- Written by tests/sync-coverage.test.mjs. Do not edit; rerun `npm test` to refresh. -->
|
|
|
|
Each translator in `src/sync/` is run over every exercise with pseudo (17), every program in `tests/corpus/` (52), and 17 one-construct fixtures (`tests/helpers/sync-programs.mjs`). 3 of the 86 have pseudo that does not read, by design (they teach the notation's error messages), and are left out below. That leaves **83 programs**.
|
|
|
|
| From pseudo to | Says it completely | Says it with a gap or a checker error | Cannot say it |
|
|
| --- | ---: | ---: | ---: |
|
|
| Mojo | 80 | 3 | 0 |
|
|
| lingo | 31 | 0 | 52 |
|
|
| matho | 3 | 0 | 80 |
|
|
|
|
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) | 50 | 01-arithmetic.pseudo, 02-temperature.pseudo, 03-compound-interest.pseudo, 04-gcd-recursion.pseudo, and 46 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) | 46 | 01-arithmetic.pseudo, 02-temperature.pseudo, 03-compound-interest.pseudo, 04-gcd-recursion.pseudo, and 42 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 | |
|