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/o3push.zc b/tests/programs/o3push.zc
index e5f0090..acb9fab 100644
--- a/tests/programs/o3push.zc
+++ b/tests/programs/o3push.zc
@@ -1,37 +1,40 @@
+namespace;
+include rt;
+
 // push in o3 code: the quick path when there is room, dpush when there is not
-o3 int fill([]int a, int n) {
+o3 int fill(int[?] a, int n) {
 	for (int i = 0; i < n; i++) push(a, i * 3);
 	return len(a);
 }
-o3 int sum([]int a) {
+o3 int sum(int[?] a) {
 	int s = 0;
 	for (int i = 0; i < len(a); i++) s += a[i];
 	return s;
 }
-o3 float fsum([]float a) {
+o3 float fsum(float[?] a) {
 	float s = 0.0;
 	for (int i = 0; i < len(a); i++) s += a[i];
 	return s;
 }
-o3 int ffill([]float a, int n) {
+o3 int ffill(float[?] a, int n) {
 	for (int i = 0; i < n; i++) push(a, 0.5 * i);
 	return len(a);
 }
 int main() {
-	[]int a = new([]int, 0);
-	put_n(fill(a, 1000)); put_c(' ');
-	put_n(sum(a)); put_c(' ');
-	put_n(a[999]); put_c(' ');
-	put_n(fill(a, 5)); put_c(' ');
-	put_n(cap(a) >= 1005); put_c(' ');
-	[]float f = new([]float, 0);
+	int[?] a = rt.new(int[?], 0);
+	rt.put_n(fill(a, 1000)); rt.put_c(' ');
+	rt.put_n(sum(a)); rt.put_c(' ');
+	rt.put_n(a[999]); rt.put_c(' ');
+	rt.put_n(fill(a, 5)); rt.put_c(' ');
+	rt.put_n(cap(a) >= 1005); rt.put_c(' ');
+	float[?] f = rt.new(float[?], 0);
 	ffill(f, 10);
-	put_n(len(f)); put_c(' '); put_n(fsum(f) == 22.5); put_c(' ');
-	put_n(drain(a)); put_c(' '); put_n(len(a)); put_c(10);
-	free(d*a); free(d*f);
+	rt.put_n(len(f)); rt.put_c(' '); rt.put_n(fsum(f) == 22.5); rt.put_c(' ');
+	rt.put_n(drain(a)); rt.put_c(' '); rt.put_n(len(a)); rt.put_c(10);
+	rt.free(d*a); rt.free(d*f);
 	return 0;
 }
-o3 int drain([]int a) {
+o3 int drain(int[?] a) {
 	int s = 0;
 	while (len(a) > 0) s += pop(a);
 	return s;