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, 13 insertions, 10 deletions

diff --git a/tests/programs/joins.zc b/tests/programs/joins.zc
index 98275ad..ec3f862 100644
--- a/tests/programs/joins.zc
+++ b/tests/programs/joins.zc
@@ -1,31 +1,34 @@
+namespace;
+include rt;
+
 // joins: something given away on one path is dead afterwards, and the paths
 // that still own it free it on the way in. nothing here leaks.
 fn take(.d p) { return p[0]; }
 fn later(.d p);	// not needed any more, but still allowed
-int*.u mk(int v) { int* p = new(int); *p = v; return u*p; }
+int*.u mk(int v) { int* p = rt.new(int); *p = v; return u*p; }
 fn count(int n) { let s = 0; switch (n % 4) { case 0: s = 10; case 1, 2: s = 20; break; default: s = 30; } return s; }
 fn main() {
-	let base = live_objects(), i = 0, hits = 0, k;
+	let base = rt.live_objects(), i = 0, hits = 0, k;
 	while (i < 50) {
 		let x = mk(i);
 		if (i % 3 == 0) take(d*x);	// else: freed here by the fixup
 		i++;
 	}
-	put_n(live_objects() - base); put_c(' ');
+	rt.put_n(rt.live_objects() - base); rt.put_c(' ');
 	// give away and break: fine now; the normal exit frees it
 	i = 0;
 	let y = mk(7);
 	while (i < 10) { if (i == 4) { take(d*y); break; } i++; }
-	put_n(live_objects() - base); put_c(' ');
+	rt.put_n(rt.live_objects() - base); rt.put_c(' ');
 	let z = mk(5);
 	while (1) { if (z[0] == 5) { hits = take(d*z); break; } }
-	put_n(hits); put_c(' ');
-	put_n(count(0) + count(1) + count(2) + count(3)); put_c(' ');
+	rt.put_n(hits); rt.put_c(' ');
+	rt.put_n(count(0) + count(1) + count(2) + count(3)); rt.put_c(' ');
 	k = i > 3 ? i * 2 : 0 - 1;
-	put_n(k); put_c(' ');
-	put_n(forward(new(int))); put_c(' ');	// tagged and defined below: the prescan knows .d
-	int** pp; int* q = new(int); *q = 9; pp = &q; put_n(**pp); free(d*q); put_c(' ');
-	put_n(live_objects() - base); put_c(10);
+	rt.put_n(k); rt.put_c(' ');
+	rt.put_n(forward(rt.new(int))); rt.put_c(' ');	// tagged and defined below: the prescan knows .d
+	int** pp; int* q = rt.new(int); *q = 9; pp = &q; rt.put_n(**pp); rt.free(d*q); rt.put_c(' ');
+	rt.put_n(rt.live_objects() - base); rt.put_c(10);
 	return 0;
 }
 fn forward(int*.d p) { return 3 + *p; }