Cubist

CHECKED ONE ENTRY AT A TIME

REPL

Define names, ask for types and evaluate terms. The kernel checks each entry as a small file that imports the entries before it.

Commands

let x := 7;Define a name. Any declaration of a file works too: def with a proof block, computable def, simp_rule.
typeof x;The type of a term: for a binary natural literal, BNat.
evaluate x;The value of a term: 7. A term alone is evaluated too. A function shows as <fun>, evaluate !!x; computes the normal form, and evaluate !!!x; the full normal form. The kernel checks the term. Its value is computed for display and certifies nothing: unmarked, by the runtime evaluator where it can be and otherwise by the kernel's queries, and with a mark by the kernel's queries (printing).
witness t;The witness a closed truncation holds, with its type, as print(witness(t)); shows it.
import nat;Load a module. nat provides binary Nat (an alias of BNat) and its notation: numerals, +, *, < and <=.
use nat;Select a notation for the entries after it, as at a file's top level: after use nat;, numerals and + mean the naturals'.
/modulesList the modules import can load: the rebuilt library, then the archive of the first library. /modules prime lists those whose names contain prime.
/clearClear the log.
/restartStart a new session: forget every name defined here.
/helpList the commands. help works too.

Enter runs an entry. Shift+Enter adds a line, and so does Enter while a bracket is open, so a proof block can be typed as in a file. ↑ and ↓ recall earlier entries. An entry that does not check changes nothing.

To use the names of a proof, open it in the proof workspace: the console under it has them loaded. The language reference describes every construct, and each of its pages has a REPL bar at the bottom.