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/examples/tree.zc b/examples/tree.zc
index 9ef515e..4f304de 100644
--- a/examples/tree.zc
+++ b/examples/tree.zc
@@ -1,26 +1,29 @@
+namespace;
+include rt;
+
 // a binary search tree where every node owns its children. there's no free
 // anywhere: when the root's block ends, the whole tree goes with it.
 struct node { int v; node* left, right; };
 
-node*.u leaf(int v) { node* n = new(node); n.v = v; return u*n; }
+node*.u leaf(int v) { node* n = rt.new(node); n.v = v; return n; }
 // n is borrowed; storing a new leaf into it makes n the leaf's owner
-fn insert(node*.m n, int v) {
+void insert(node*.m n, int v) {
 	if (v < n.v) { if (n.left) insert(n.left, v); else n.left = leaf(v); }
 	else { if (n.right) insert(n.right, v); else n.right = leaf(v); }
-	return 0;
+	return;
 }
-fn walk(node* n) { if (!n) return 0; walk(n.left); put_n(n.v); put_c(' '); walk(n.right); return 0; }
+void walk(node* n) { if (!n) return; walk(n.left); rt.put_n(n.v); rt.put_c(' '); walk(n.right); return; }
 int height(node* n) { if (!n) return 0; int l = height(n.left), r = height(n.right); return 1 + (l > r ? l : r); }
 
-fn main() {
-	let before = live_objects();
+void main() {
+	let before = rt.live_objects();
 	{
 		node* root = leaf(50);
 		int x = 7;
 		for (int i = 0; i < 30; i++) { x = (x * 37 + 11) % 100; insert(root, x); }
-		walk(root); put_c(10);
-		put_s("height "); put_n(height(root)); put_s(", live objects "); put_n(live_objects() - before); put_c(10);
+		walk(root); rt.put_c(10);
+		rt.put_s("height "); rt.put_n(height(root)); rt.put_s(", live objects "); rt.put_n(rt.live_objects() - before); rt.put_c(10);
 	}
-	put_s("after the block: "); put_n(live_objects() - before); put_c(10);
-	return 0;
+	rt.put_s("after the block: "); rt.put_n(rt.live_objects() - before); rt.put_c(10);
+	return;
 }