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, 14 insertions, 11 deletions

diff --git a/examples/life.zc b/examples/life.zc
index 6ac34e0..fdfef2b 100644
--- a/examples/life.zc
+++ b/examples/life.zc
@@ -1,10 +1,13 @@
+namespace;
+include rt;
+
 // conway's life on a 10 x 20 torus, with typed 2d arrays in a struct.
 // a glider walks diagonally and wraps around the edges.
 const H = 10, W = 20;
-struct board { [10][20]int c; };
+struct board { int[10][20] c; };
 
 int get(board* b, int y, int x) { return b.c[(y + H) % H][(x + W) % W]; }
-fn step(board* from, board* to) {
+void step(board* from, board* to) {
 	for (int y = 0; y < H; y++)
 		for (int x = 0; x < W; x++) {
 			int n = 0;
@@ -13,15 +16,15 @@ fn step(board* from, board* to) {
 					if (dy || dx) n += get(from, y + dy, x + dx);
 			to.c[y][x] = n == 3 || (n == 2 && from.c[y][x]);
 		}
-	return 0;
+	return;
 }
-fn show(board* b, int gen) {
-	put_s("generation "); put_n(gen); put_c(10);
-	for (int y = 0; y < H; y++) { for (int x = 0; x < W; x++) put_c(b.c[y][x] ? '#' : '.'); put_c(10); }
-	return 0;
+void show(board* b, int gen) {
+	rt.put_s("generation "); rt.put_n(gen); rt.put_c(10);
+	for (int y = 0; y < H; y++) { for (int x = 0; x < W; x++) rt.put_c(b.c[y][x] ? '#' : '.'); rt.put_c(10); }
+	return;
 }
-fn main() {
-	board* a = new(board), b = new(board);
+void main() {
+	board* a = rt.new(board), b = rt.new(board);
 	a.c[0][1] = 1; a.c[1][2] = 1; a.c[2][0] = 1; a.c[2][1] = 1; a.c[2][2] = 1;
 	// two generations a pass, a -> b -> a: owned boards can't be swapped
 	// through a temporary, since the analyzer can't follow that
@@ -30,6 +33,6 @@ fn main() {
 		step(a, b);
 		step(b, a);
 	}
-	free(d*a); free(d*b);
-	return 0;
+	rt.free(a); rt.free(b);
+	return;
 }