feat: grow memory limits, add icon/actor libraries, overhaul LSP diagnostics

Compiler and VM
- make every memory map limit dynamic and adjustable at both build time and
  runtime, including compiler tables, stacks, and every execution region
- reserve and grow tables, operand and return stacks, frame segments, and
  image-building output without relocating live code or globals
- rename i/o and string helpers consistently (puts -> put_s, putn -> put_n,
  scat -> cat_s) across compiler, runtime, examples, tests, and docs
- recast and consume values assigned to globals from inside functions
- allow fixed and const together, add typed closure returns (fn:t(...)),
  multi-include syntax (include rt, run, core;), and recurse type inference
- never infer string literals as word, anywhere, as argument, variable, or
  return type
- draft docs/BORROW.md: a borrow checker less intrusive than Rust's but more
  intelligent

LSP and editor integration
- require explicit includes and give every toolchain area its own namespace
  (rt, lsp, run, core)
- hover for built-in types, inferred types, values known at hover time, array
  and pointer lifetime/size, library names in include statements, and inferred
  lifetimes with explanations
- honor /* */ comments as documentation for variables and arguments, and stop
  misattributing section headers or trailing comments as variable hints
- stream diagnostics and cancel stale requests on change
- jump to definition and references, including cross-file
- quick fixes with automatic library import, and namespace completion

Hints and diagnostics
- render hints as blue squigglies by default, with hints on/small/off per file
- suppress magic-number hints via a preceding /* */ comment, and say so
- warn on unused arguments; allow multiple _ discards in parameters, pattern
  matching, and tagged enums, warning if a _ is actually used
- rewrite hint and comment prose in professional compiler-doc register

Libraries
- add icon.zc: run-time self-modification, find/replace syntax, type and block
  edits, and step-through inspection of locals and globals
- add actor.zc: async actors with Actor<I,O>, implicit this, spawn/recv/send,
  injected into the compiler machinery at include time rather than built in

Tooling and docs
- reorganize sources, tests, and designs into subdirectories
- unify windows entry points in tinyvm.bat and add a matching tinyvm.sh
- add --help across the toolchain
- polish the learning guide, stdlib docs, and design notes

Tests
- add accept, reject, and regression coverage across the compiler, LSP,
- runtime, icon, actors, threads, formatting, and the toolchain contracts,
  plus fuzzers and property tests

1 files changed, 15 insertions, 12 deletions

diff --git a/examples/staged.zc b/examples/staged.zc
index a180ae3..23453f9 100644
--- a/examples/staged.zc
+++ b/examples/staged.zc
@@ -1,9 +1,12 @@
+namespace;
+include rt, run;
+
 // staged code: a program writes a specialized function as source, compiles it
 // while running, and calls it. here, polynomials with their coefficients baked
 // in as constants, so there's no loop and no array left at runtime.
 let buf[2000], n;
-fn put(s) { let i = 0; while (s[i]) { buf[n] = s[i]; n++; i++; } return 0; }
-fn putnum(int v) { if (v >= 10) putnum(v / 10); buf[n] = '0' + v % 10; n++; return 0; }
+void put(s) { let i = 0; while (s[i]) { buf[n] = s[i]; n++; i++; } return; }
+void putnum(int v) { if (v >= 10) putnum(v / 10); buf[n] = '0' + v % 10; n++; return; }
 
 // coefficients c[0] + c[1] x + ... in horner form: ((c3 x + c2) x + c1) x + c0
 fn specialize(int* c, int deg) {
@@ -19,15 +22,15 @@ fn specialize(int* c, int deg) {
 	buf[n] = 0;
 	return buf;
 }
-fn main() {
-	[4]int c;
+void main() {
+	int[4] c;
 	c[0] = 7; c[1] = 0 - 3; c[2] = 0; c[3] = 2;	// 2x^3 - 3x + 7
-	let src = specialize(c, 3), q = tokens(src);
-	put_s(src); put_c(10);
-	load(q);			// compiled now, into the running program
-	free(d*q);
-	let f = sval[lookups("poly")];	// and found by name in the compiler's symbol table
-	for (int x = 0 - 2; x <= 3; x++) { put_n(f(x)); put_c(' '); }
-	put_c(10);
-	return 0;
+	let src = specialize(c, 3), q = run.tokens(src);
+	rt.put_s(src); rt.put_c(10);
+	run.load(q);			// compiled now, into the running program
+	rt.free(q);
+	let f = run.sval[run.lookups("poly")];	// and found by name in the compiler's symbol table
+	for (int x = 0 - 2; x <= 3; x++) { rt.put_n(f(x)); rt.put_c(' '); }
+	rt.put_c(10);
+	return;
 }