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/cabi.zc b/tests/programs/cabi.zc
index 6a608ab..da9518b 100644
--- a/tests/programs/cabi.zc
+++ b/tests/programs/cabi.zc
@@ -1,3 +1,6 @@
+namespace;
+include rt;
+
 // native calls: extern declares a c function, cfunc hands a zc function to c
 extern double sqrt(double);
 extern double pow(double x, double y);
@@ -10,7 +13,7 @@ extern int snprintf2(word *buf, long cap, str fmt, long a, double b) = "snprintf
 extern double hypot(double, double);
 
 fn put_f(x) { asm { x @ #1220 } return 0; }
-fn sp() { put_c(32); return 0; }
+fn sp() { rt.put_c(32); return 0; }
 
 int cmp(int* a, int* b) { return *a - *b; }
 // a callback that makes a native call of its own, and an o3 one
@@ -23,24 +26,24 @@ fn main() {
 	put_f(sqrt(2.0)); sp();
 	put_f(pow(2.0, 10.0)); sp();
 	put_f(sqrtf(16.0)); sp();
-	put_n(c_strlen(b"hello, world")); sp();
-	put_n(c_abs(0 - 42)); sp();
-	put_n(c_atoi(b"1234xyz")); sp();
+	rt.put_n(c_strlen(b"hello, world")); sp();
+	rt.put_n(c_abs(0 - 42)); sp();
+	rt.put_n(c_atoi(b"1234xyz")); sp();
 	a[0] = 5; a[1] = 3; a[2] = 9; a[3] = 1; a[4] = 7; a[5] = 2;
 	qsort(a, 6, 8, cfunc(cmp));
-	while (i < 6) { put_n(a[i]); sp(); i++; }
-	put_c(10);
+	while (i < 6) { rt.put_n(a[i]); sp(); i++; }
+	rt.put_c(10);
 	qsort(a, 6, 8, cfunc(cmpdesc));
-	i = 0; while (i < 6) { put_n(a[i]); sp(); i++; }
-	put_c(10);
+	i = 0; while (i < 6) { rt.put_n(a[i]); sp(); i++; }
+	rt.put_c(10);
 	qsort(a, 6, 8, cfunc(cmp));
-	i = 0; while (i < 6) { put_n(a[i]); sp(); i++; }
+	i = 0; while (i < 6) { rt.put_n(a[i]); sp(); i++; }
 	qsort(a, 6, 8, cfunc(cmpo3));
-	i = 0; while (i < 6) { put_n(a[i]); sp(); i++; }
-	put_c(10);
-	put_n(snprintf2(a, 48, b"%ld:%.2f", 7, 2.5)); sp();
-	i = 0; while (i < 6) { put_c(ld8(addr_b(a) + i)); i++; }
-	put_c(10);
-	put_f(hypot(3.0, 4.0)); put_c(10);
+	i = 0; while (i < 6) { rt.put_n(a[i]); sp(); i++; }
+	rt.put_c(10);
+	rt.put_n(snprintf2(a, 48, b"%ld:%.2f", 7, 2.5)); sp();
+	i = 0; while (i < 6) { rt.put_c(rt.ld8(rt.addr_b(a) + i)); i++; }
+	rt.put_c(10);
+	put_f(hypot(3.0, 4.0)); rt.put_c(10);
 	return 0;
 }