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, 12 insertions, 9 deletions

diff --git a/tests/programs/growheap.zc b/tests/programs/growheap.zc
index 07e10a6..ebb3f8b 100644
--- a/tests/programs/growheap.zc
+++ b/tests/programs/growheap.zc
@@ -1,10 +1,13 @@
+namespace;
+include rt;
+
 // the heap grows past its initial size: eight live blocks of 300000 words
 // don't fit in the 393216-word start, so the allocator takes more memory from
 // the host, and a block bigger than the start fits once they are freed
 let keep[8];
 unchecked fn fill(n) {
 	let i = 0, a;
-	while (i < n) { a = new(300000); a[0] = i + 1; a[299999] = (i + 1) * 3; keep[i] = a; i++; }
+	while (i < n) { a = rt.new(300000); a[0] = i + 1; a[299999] = (i + 1) * 3; keep[i] = a; i++; }
 	return 0;
 }
 unchecked fn total(n) {
@@ -14,19 +17,19 @@ unchecked fn total(n) {
 }
 unchecked fn drop(n) {
 	let i = 0;
-	while (i < n) { free(keep[i]); keep[i] = 0; i++; }
+	while (i < n) { rt.free(keep[i]); keep[i] = 0; i++; }
 	return 0;
 }
 fn main() {
-	let a, start = heap_size();
+	let a, start = rt.heap_size();
 	fill(8);
-	put_n(total(8)); put_c(' ');
-	put_n(heap_size() > start); put_c(' ');
+	rt.put_n(total(8)); rt.put_c(' ');
+	rt.put_n(rt.heap_size() > start); rt.put_c(' ');
 	drop(8);
-	scrub(); gc();
-	a = new(3000000);
+	rt.scrub(); rt.gc();
+	a = rt.new(3000000);
 	a[2999999] = 7;
-	put_n(a[2999999]); put_c(' ');
-	put_n(heap_size() >= 3000000); put_c(10);
+	rt.put_n(a[2999999]); rt.put_c(' ');
+	rt.put_n(rt.heap_size() >= 3000000); rt.put_c(10);
 	return 0;
 }