Ajisai

Parse and resolve Ajisai source without executing it; also verifies declared contracts conservatively.

Execute a bounded Ajisai program and return its stack. Ajisai is postfix (RPN) and its numbers are exact rationals closed under square root — no floats, so results are reproducible and comparisons decide. Its 77 Words cover arithmetic (ADD SUB MUL DIV FLOOR ROUND MIN MAX SQRT POW GCD RATIO — negate with -1 MUL), comparison (EQ LT GT — not-equal is EQ NOT, at-most is GT NOT), three-valued logic (TRUE FALSE AND NOT, a NIL read as unknown — or is a NOT b NOT AND NOT; RECONCILE answers what two sources agree on, a NIL(conflict) for two different values), vectors — arithmetic broadcasts element-wise — collections (SORT ORDER UNIQUE ZIP RANGE FILL TAKE DROP CONCAT REVERSE LENGTH GET PUT BSEARCH COLLECT SHAPE RESHAPE FLATTEN DEPTH), records — keyed data, built by RECORD from a key vector and a value vector, read by GET KEYS VALUES HAS?, rewritten by PUT WITHOUT MERGE; TALLY and GROUP answer Records — higher-order blocks (MAP FILTER FOLD SCAN), text (CHARS JOIN TOKENIZE TRIM UPPER LOWER SEARCH REPLACE NUM STR FORMAT), JSON (JSON-DECODE JSON-ENCODE — objects are Records, numbers exact, nothing rounded), absence (NIL NIL? NIL-REASON ABSENT), control (SELECT EXEC FAIL), reflection (DIGEST CONTRACT — a Word's or a block's contract as a Record, inferred without running it), naming (DEF to name your own Word, BIND DEL) and output (PRINT). That is the whole vocabulary. Word names are case-insensitive (`add` runs as ADD) but otherwise exact — a name not listed here does not exist under another spelling; word_contract answers a near-miss with suggestions, so look a name up rather than guessing it. Each call runs one source in a fresh session with no User Words: a DEF lasts for that source only, so a program that needs a Word it defines carries the DEF in the same source. The result's `outcome` names which of the language's three results the run produced — `value`, `nil:<reason>` (a reasoned absence; the call still succeeds) or `error:<category>`; an error also carries `error` — its category, the ceiling it hit (`resource`), the Word it is attributed to and its source line and column. Reach for this whenever the request is one of those operations and the answer should be exact and checkable rather than recalled. Out of domain: floats, file or network I/O, and general-purpose programming. Ajisai also has no external or real-world reference data of its own — no exchange rates, no calendars, no reading speeds, no other language's syntax semantics. Do not invent a plausible-looking number for one of those and run it through this tool to dress a guess up as an exact answer; if the question needs a real-world fact rather than a value already given or derivable from first principles inside this domain, answer directly without a call, or say you don't know.

Infer each user-defined Word's stack contract without executing its body: `inputs` and `outputs` (a count, or `variable`), `field` (`closed`, or `leaving` with the `fieldExits` that leave it) and a paste-ready `#:contract` line in `suggested`. Source that does not parse is the same `malformedSource` error check reports.

Return the generated canonical registry entry for a Word — its arity, purity, NIL policy, contract, and `cost`: what the Word charges on each metered resource (`steps`/`numeric`/`collection`), as a growth class in its input. Cost classes join pointwise under concatenation, so a phrase's bound is the widest bound among its Words — read them here to budget a program before running it rather than discovering the ceiling by hitting it. A class is how the charge *grows*, never how large it is: two programs of the same class can differ by orders of magnitude. Measured, `[ 1 2 3 4 5 ] [ 0 ] [ ADD ] FOLD` spends 5 `numericWork` while `2 SQRT 3 SQRT ADD` — also `const` — spends 2048, because an algebraic value carries a multiquadratic normal form and every operation on one rebuilds it. Budget an algebraic chain at 10^2–10^3 times a rational one of the same class, and read `resourceUsage` from a small run when the size matters rather than inferring it from the class. An unmatched name answers with the closest known Words in `suggestions`. To read every Word's full contract at once instead of probing one name at a time, read the ajisai://contracts resource; ajisai://vocabulary lists the inventory — every name, its family and its tier.