Fuaran.Core.Ops 0.29.0

Fuaran.Core.Function — the artifact-function protocol (Phase 181): generic signature / apply / curry / compose over a domain-witness record, under the three laws — totality (bounded iteration only), hygiene (lexical hole-addressing, capture-avoiding), and a mandatory two-axis effect/determinism signature joined componentwise through composition. FSharp.Core only.

Fuaran – AI-emittable F# UI language. An emission is bounded data over a closed vocabulary rather than code or markup, so a malformed tree is a typed refusal with a stable code and a path rather than a plausible-looking render. Fuaran.UI.WireLimits expresses the wire format's normative resource limits (node depth, JSON depth, string and array length, total node count) that keep a decode of untrusted input bounded. Apache-2.0 licensed.

Fuaran tree-op apply engine — the pure type contract (the TreeOp DU + ErrorPayload + ApplyHint, §4g). FSharp.Core-only and Fable-portable: the shared types every op-stream / telemetry / renderer consumer needs WITHOUT pulling in the apply engine + JSON decoder (which are themselves Fable-portable, but belong at the host seam rather than in every consumer's graph). Apache-2.0 licensed.

Fuaran tree-op apply engine — §4g op vocabulary + Result-returning apply against typed Node<'Msg> trees, with §4d AI-recovery-shaped error payloads. The JSON decoder is default-deny by shape: an undeclared or malformed emission is refused with a typed DecodeError carrying a stable code and a path, and a payload breaching the wire format's §21 resource limits is refused as LIMIT_EXCEEDED before the recursion that would breach them. Apache-2.0 licensed.

Fuaran.Core.Propagation — change propagation over a reference DAG + tree-level dirty recomputation for a domain tree whose cross-node references are declared bindings on permanent ids. Derives the dependency map from a per-call readsOf function (no witness field), the dependency order + reference-cycle enumeration (Tarjan SCC, cycles as data), and the minimal dirty set from a value change or a structural SkeletonOp (reverse-reachability closure). Owns no evaluator (recompute stays domain-side); staleness is a returned Set. The graph questions are Fuaran.Core.Relation's one iterative pass (no stack depth limit on a dependency chain); a prepared Plan is reused across incremental ticks. FSharp.Core only, Fable-clean.