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/tests/programs/quarantine.zc b/tests/programs/quarantine.zc
index 5e3e188..061c4da 100644
--- a/tests/programs/quarantine.zc
+++ b/tests/programs/quarantine.zc
@@ -1,25 +1,28 @@
+namespace;
+include rt;
+
 // free quarantines the block. a stale alias still reads it, and freeing
 // through the alias does nothing because the header already says free.
 // unchecked so the analyzer doesn't reject the use after free.
 unchecked fn main() {
-	let p = new(4), q, r, i = 0, t, bad = 0;
+	let p = rt.new(4), q, r, i = 0, t, bad = 0;
 	p[0] = 111; p[1] = 222; p[2] = 333; p[3] = 444;
 	q = p;
 	r = p + 2;
-	free(p);
-	while (i < 400) { t = new(4); t[0] = 999; t[1] = 888; t[2] = 777; t[3] = 666; i++; }
+	rt.free(p);
+	while (i < 400) { t = rt.new(4); t[0] = 999; t[1] = 888; t[2] = 777; t[3] = 666; i++; }
 	if (q[0] != 111 || q[1] != 222 || r[0] != 333 || r[1] != 444) bad = 1;
-	free(q);
+	rt.free(q);
 	if (q[0] != 111 || q[1] != 222) bad = 2;
-	gc();	// q still points at the block, so the sweep must not reuse it
+	rt.gc();	// q still points at the block, so the sweep must not reuse it
 	if (q[0] != 111 || r[0] != 333) bad = 3;
 	p = 0; q = 0; r = 0; t = 0;
-	scrub();
-	gc();
-	t = new(4);
+	rt.scrub();
+	rt.gc();
+	t = rt.new(4);
 	t[0] = 1234;
-	put_n(bad); put_c(' ');
-	put_n(t[0]); put_c(10);
-	free(t);
+	rt.put_n(bad); rt.put_c(' ');
+	rt.put_n(t[0]); rt.put_c(10);
+	rt.free(t);
 	return 0;
 }