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, 20 insertions, 17 deletions

diff --git a/examples/lists.zc b/examples/lists.zc
index 02059f3..3fcad3b 100644
--- a/examples/lists.zc
+++ b/examples/lists.zc
@@ -1,32 +1,35 @@
+namespace;
+include rt;
+
 // ownership in practice: a list owns its boxes. nothing here calls free;
 // everything is released at the end of the block that owns it.
-.u box(v) { let b = new(1); b[0] = v; return u*b; }
-.u mklist(cap) { let l = new(cap + 1); l[0] = 0; return u*l; }
-// item m*arrives (it was given down), and goes d*on into the borrowed list
-fn push(.m l, .d item) { l[l[0] + 1] = d*item; l[0] = l[0] + 1; return 0; }
-fn show(.m l) {
+.u box(v) { let b = rt.new(1); b[0] = v; return b; }
+.u mklist(cap) { let l = rt.new(cap + 1); l[0] = 0; return l; }
+// item arrives as an owned parameter and moves into the borrowed list
+void push(.m l, .d item) { l[l[0] + 1] = d*item; l[0] = l[0] + 1; return; }
+void show(.m l) {
 	let i = 1;
-	put_c('[');
-	while (i <= l[0]) { if (i > 1) put_c(' '); put_n(l[i][0]); i++; }
-	put_c(']');
-	return 0;
+	rt.put_c('[');
+	while (i <= l[0]) { if (i > 1) rt.put_c(' '); rt.put_n(l[i][0]); i++; }
+	rt.put_c(']');
+	return;
 }
 .u squares(n) {
 	let l = mklist(n), i = 0;
 	while (i < n) {
 		let b = box(i * i);
-		push(l, d*b);
+		push(l, b);
 		i++;
 	}
-	return u*l;
+	return l;
 }
-fn main() {
-	let before = live_objects();
+void main() {
+	let before = rt.live_objects();
 	{
 		let l = squares(6);
-		show(l); put_c(10);
-		put_s("live: "); put_n(live_objects() - before); put_c(10);
+		show(l); rt.put_c(10);
+		rt.put_s("live: "); 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;
 }