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, 18 insertions, 15 deletions

diff --git a/tests/programs/o3.zc b/tests/programs/o3.zc
index c875d09..d7026db 100644
--- a/tests/programs/o3.zc
+++ b/tests/programs/o3.zc
@@ -1,3 +1,6 @@
+namespace;
+include rt;
+
 // o3 regions: every kind of control flow, against the same code without o3
 struct pt { int x; int y; };
 int g = 3;
@@ -31,20 +34,20 @@ o3 int mix(int n) {
 	return acc;
 }
 o3 int dyn(int n) {
-	[]int a = new([]int, n);
-	fixed []int f = new(fixed []int, n);
+	int[?] a = rt.new(int[?], n);
+	fixed int[?] f = rt.new(fixed int[?], n);
 	int s = 0;
 	for (int i = 0; i < len(a); i++) { a[i] = i * i; f[i] = n - i; }
 	for (int i = 0; i < n; i++) s = s + a[i] * f[i];
-	free(d*a); free(d*f);
+	rt.free(d*a); rt.free(d*f);
 	return s;
 }
 o3 int pts(int n) {
-	pt* p = new(pt);
+	pt* p = rt.new(pt);
 	int s = 0;
 	p->x = 1; p->y = 2;
 	for (int i = 0; i < n; i++) { p->x = p->x + p->y; p->y = p->x - p->y; s = s + p->x % 1000; }
-	free(d*p);
+	rt.free(d*p);
 	return s;
 }
 o3 int divs(int x) {
@@ -59,17 +62,17 @@ fn main() {
 	o3 {
 		int i = 0, s = 0;
 		while (i < 100) { s = s + collatz(i + 1); i++; }
-		put_n(s); put_c(' ');
-		put_n(lone); put_c(' ');
+		rt.put_n(s); rt.put_c(' ');
+		rt.put_n(lone); rt.put_c(' ');
 		lone++;
 	}
-	put_n(lone); put_c(' ');
-	put_n(ack(2, 3)); put_c(' ');
-	put_n(many(1, 2, 3)); put_c(' ');
-	put_n(mix(100)); put_c(' ');
-	put_n(dyn(50)); put_c(' ');
-	put_n(pts(30)); put_c(' ');
-	put_n(divs(1000)); put_c(' ');
-	put_n(divs(-77)); put_c(10);
+	rt.put_n(lone); rt.put_c(' ');
+	rt.put_n(ack(2, 3)); rt.put_c(' ');
+	rt.put_n(many(1, 2, 3)); rt.put_c(' ');
+	rt.put_n(mix(100)); rt.put_c(' ');
+	rt.put_n(dyn(50)); rt.put_c(' ');
+	rt.put_n(pts(30)); rt.put_c(' ');
+	rt.put_n(divs(1000)); rt.put_c(' ');
+	rt.put_n(divs(-77)); rt.put_c(10);
 	return 0;
 }