alexmandClaude 44606bf0cf Convert the prover's term language and solver to TypeScript
This repository now owns the engines, and the next stages extend the prover
(a claims model, translation to Dafny and Lean, precision claims). Doing that
under strict mode needs the terms it reasons about to have types.

logic.ts gives the term language a discriminated union (Num, Lit, Sym, Bv,
Op, And, Or, Not, Cmp, Ite, App, Quant, QuantC) and types every
constructor, rewrite and printer. solver.ts types the rationals, linear
constraints, Fourier-Motzkin, union-find with congruence, the case split
and quantifier instantiation, and exports ProveResult and ProveOptions.
Walks that looked inside any kind of term through x[k] now go through a
small fields() helper that keeps the same order.

The behavior is unchanged: every obligation of every exercise, corpus
program, lesson solution and example, and the regression programs, comes
out byte for byte the same as before the conversion (kind, line, column,
label, status, paths, goal and facts as shown, inferred invariants, notes).
The few places where the JavaScript would have thrown on a null it never
receives (an identity for a quantifier that has one) now skip instead.

Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
Claude-Session: https://claude.ai/code/session_01FgvbRdoEheAHqsRmr2WuKZ
2026-10-05 03:24:09 +00:00
2026-10-05 03:03:38 +00:00
2026-10-05 03:03:38 +00:00
S
Description
No description provided
5.2 MiB
0 Stars 1 Watchers 0 Forks
Languages
TypeScript 47.7%
JavaScript 47.1%
Python 4.9%
Mojo 0.3%