refactor: canonical failable syntax (T, !) — remove the bare -> T ! sugar

The trailing-`!`-after-the-value-type spelling (`-> T !`, `-> Tuple(A,B) !`) was a
redundant second way to write a failable return that the parser folded into the
same AST as the parenthesized `(T, !)` / `(A, B, !)` result list. Remove it so
there is ONE canonical spelling: the error channel always rides as the last slot
of the parenthesized list.

- parser: `parseFnReturnType` no longer folds a trailing `!` after a value type —
  it rejects it with a located diagnostic ("a failable return is written `(T, !)`
  … not `T !`"). This one chokepoint covers fn declarations, lambdas, fn-pointer
  types `(A) -> R`, and closure types `Closure(A) -> R`. The error-ONLY `-> !` /
  `-> !ErrSet` form is unaffected (parsed by parseTypeExpr as an error_type_expr).
- migrated every usage to canonical form across library/ + examples/ + issues/ +
  tests/: `-> T !E` → `-> (T, !E)`; the value-carrying `-> Tuple(A, B) !` (which
  FLATTENED to a multi-value failable) → `-> (A, B, !)`, preserving behavior. A
  genuine single-tuple-value failable stays `-> (Tuple(A,B), !)`.
- parser unit tests: the "bare form folds" tests become "bare form is rejected";
  canonical-form parse tests retained.
- docs: specs.md §12 + scattered refs and readme.md updated to the `(T, !)` form.

Behavior-preserving (the bare form was sugar for the same AST). Adversarial review
confirmed: rejection complete across all positions, every canonical form works on
both success/error paths, error-only `-> !` intact, no crashes. Full suite green
(unit tests + 850 corpus examples).

examples/errors/1046-errors-value-slot-liveness.sx

@@ -15,7 +15,7 @@
 
 E :: error { Bad, Empty }
 
-parse :: (n: i32) -> i32 !E {
+parse :: (n: i32) -> (i32, !E) {
     if n < 0  { raise error.Bad; }
     if n == 0 { raise error.Empty; }
     return n * 10;
@@ -29,7 +29,7 @@ guarded :: (n: i32) -> i32 {
 }
 
 // `if err { raise }` in a failable function: same fall-through proof.
-relay :: (n: i32) -> i32 !E {
+relay :: (n: i32) -> (i32, !E) {
     v, err := parse(n);
     if err { raise err; }
     return v + 1;                          // err proven absent here