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, 39 insertions, 0 deletions

diff --git a/tests/programs/borrow_rules.zc b/tests/programs/borrow_rules.zc
new file mode 100644
index 0000000..ed2b199
--- /dev/null
+++ b/tests/programs/borrow_rules.zc
@@ -0,0 +1,39 @@
+namespace;
+include rt;
+
+// last-use borrows do not block an owner's later move; disjoint projections remain independently usable.
+struct pair { int left, right; };
+int*.u make(int n) { int* p = rt.new(int); *p = n; return p; }
+int take(int*.d p) { return p[0]; }
+int twice(int*.m p, int*.m q) { return p[0] + q[0]; }
+char* alias(char*.m p) { return p; }
+word.u counter() {
+ int n = 0;
+ let next = fn() { n++; return n; };
+ return next;
+}
+word.u object_counter() {
+ int* value = rt.new(int);
+ let next = fn() { value[0]++; return value[0]; };
+ return next;
+}
+fn main() {
+ let p = make(7); int* borrowed = p + 0;
+ rt.put_n(borrowed[0]); rt.put_c(32); rt.put_n(twice(p,p)); rt.put_c(32);
+ rt.put_n(take(p)); rt.put_c(32);
+ let disposable = rt.new(2); rt.free(disposable);
+ pair* item = rt.new(pair); int* left = &item.left; int* right = &item.right;
+ *left = 3; *right = 4; rt.put_n(*left + *right); rt.put_c(32);
+ int[3] a = {1,2,3}; int* middle = &a[1]; middle[-1] = 5; a[2] = 6;
+ rt.put_n(middle[-1] + middle[1]); rt.put_c(32);
+ int[?] values = {8,9}; int* first = &values[0]; rt.put_n(first[0]); rt.put_c(32); resize(values,3);
+ rt.put_n(len(values)); rt.put_c(32);
+ int n = 0; let next = fn() { return ++n; }; let current = fn() { return n; };
+ next(); n = 10; rt.put_n(current()); rt.put_c(32); rt.put_n(next()); rt.put_c(32); rt.put_n(n); rt.put_c(32);
+ let escaping = counter(); rt.gc(); rt.put_n(escaping()); rt.put_c(32); rt.put_n(escaping()); rt.put_c(32);
+ let heap = object_counter(); rt.gc(); rt.put_n(heap()); rt.put_c(32); rt.put_n(heap()); rt.put_c(32);
+ int sum = 0, i = 0; while (i < 3) { sum += i; let f = fn() { return ++sum; }; f(); i++; }
+ rt.put_n(sum); rt.put_c(32);
+ let raw = fn() { return asm { n @ }; }; rt.put_n(raw()); rt.put_c(32);
+ rt.put_s(alias("ok")); rt.put_c(10);
+}