aup, branch masterDeclarative systems language and compiler targeting verified Pure modules.
http://git.yeowoo.org/aup/atom?h=master2026-10-19T07:05:53Z002: a list value of numbers, bools and i64s is copied whole by Pure now (600 items about 1 us); records with texts or lists still item by item2026-10-19T07:05:53Zeunhhunecpition205@gmail.com2026-10-19T07:05:53Zurn:sha1:1efe1c74f075ffac72fb0e39f0c7aa8e381d4916140's apps written with the frictions gone: inflate's and linebreak's lists declared together, linebreak's 0x2010 and 0x25CC (their modules the same), DNS's records = [] and 0xc000, HTTP's trailers, j = fields(...), RFC 6298's abs and tick.period (G written once), layout's lists together, its boxes and root as targets together, boxes = []; lines 121 to 120, 148 to 146, 176 to 169, 116 to 110; instructions within 0.2%2026-10-19T06:34:12Zeunhhunecpition205@gmail.com2026-10-19T06:34:12Zurn:sha1:30eed7886769d838a5d51b70c764c532ca023b1cTargets together compiled straight when they can be: S_TOGETHER holds the targets with their values; when no value may read what a target before it changes (a target's name, a fn's call, a parameter or a binding, an index or a for's item of a changed list), each target takes its value in order with no lets, else the values go through lets first as before; layout.aup's boxes 1,525.9 instructions a node through lets, 1,492.8 straight (the hand-written 1,493.9); frictions reads a changed item through a let's index and a for's item (a compiler always straight fails it)2026-10-19T06:32:09Zeunhhunecpition205@gmail.com2026-10-19T06:32:09Zurn:sha1:1c3b2475ca2008b7a68e7fbd6281b59fa84a286cLists declared together: three names or more made the statements a cycle (each copy took the first's next, the copy before it), so the compiler never ended (found writing linebreak.aup's nine lists as two lines); frictions declares four2026-10-19T06:23:29Zeunhhunecpition205@gmail.com2026-10-19T06:23:29Zurn:sha1:6463228d028a4755ef819dcfbbf6426e3a9f8626Hex literals are numbers where numbers go without a core change (140's UAX #14 friction): 0x... compared with a number, in its arithmetic, in min and max, given to a number's state, let or field is that number, past 2^53 refused; alone or meeting an i64 it is an i64 as before, bit operations as before; frictions in make check, two diagnostics; 002 records the frictions written away; no module of aup's, Pure's or Vega's changes2026-10-19T06:18:33Zeunhhunecpition205@gmail.com2026-10-19T06:18:33Zurn:sha1:b116cf7b59db6a90b2d5146742bb838144fa831fabs(x) and a timer's period without a core change (140's RFC 6298 frictions): abs of a number or an i64, x once (a PICK of it, its negation, MAX: -0's is +0, i64's least overflows); tick.period, an every input's milliseconds as now counts them, a constant anywhere; frictions in make check, a diagnostic; no module of aup's, Pure's or Vega's changes2026-10-19T06:15:34Zeunhhunecpition205@gmail.com2026-10-19T06:15:34Zurn:sha1:39d4a024f91a042c5ffe8f5f76faf02f77b86f33A list given a value whole without a core change (140's frictions): xs = a list value (a fn's, a let's) copies it first, empties xs and gives it the copy's items (added by key when keyed); xs = ys walks ys where it is, xs = xs leaves it; xs = [...] for a stored list too; xs, j = f(x) with a list among the names; a value of another kind or record refused by name ('xs' takes a list of F, not G); frictions in make check, diagnostics updated; no module of aup's, Pure's or Vega's changes2026-10-19T06:11:50Zeunhhunecpition205@gmail.com2026-10-19T06:11:50Zurn:sha1:11960e4e2353dc63660362660901183a2585cb08Names together without a core change (140's frictions): lets' lists declared together (let a, b: list of R, a let each, empty as it begins; given elements refused), and targets together with fields and items among them (xs[i].x, xs[i].y = a, b; a, xs[i] = ...): the values first, each into a let of its own (a literal straight), then each target left to right as Python's; names alone are S_ASSIGNS as before; frictions in make check, two diagnostics; no module of aup's, Pure's or Vega's changes2026-10-19T06:05:44Zeunhhunecpition205@gmail.com2026-10-19T06:05:44Zurn:sha1:24e3994b4c845831f867430cc4bb4c6e1e564a6dexamples/layout.aup: box layout, a subset of CSS Flexbox 1 (one line, row or column, padding, gap, justify-content, align-items, grow and shrink with 9.7's loop, cross sizes stretched; every size from above), a tree a message of its nodes in preorder (Pure's research 140, spec 8)2026-10-19T05:18:49Zeunhhunecpition205@gmail.com2026-10-19T05:18:49Zurn:sha1:3f870ba7abf4e8abd5ddfeced58c64a2e2b86cecA message's rows read by position where they are, not from a copy of them: input.rows[k] made the rows a list value (LIST_VALUE copies every row) and read the copy, so each read cost the rows' count (140's box layout: 99,067 ns a node, 4,737 now, the answers the same); rows_at in make check (a literal, a computed and a looped position, through a let and a fn's argument, past the last failing the event); no other module of aup's, Pure's or Vega's changes2026-10-19T05:15:12Zeunhhunecpition205@gmail.com2026-10-19T05:15:12Zurn:sha1:e5a620916c8f13a5a22d24b7fd5a802139bf575f