vortex-combinators

Interpreter transformers that work for any first-order polysemy effect: forward each operation over a transport (the vortex wire, or an in-memory loopback), tee two interpreters and report divergence, cache a forwarder's reads under a tick-based staleness bound, split by routing key, record and replay, and meter per verb. A theory supplies what each needs as a small class: the wire form of its operations and results, equality on results, a read/write split with invalidation keys, and a routing key. The laws are Hedgehog properties any theory instantiates with its own generators, in vortex-combinators-laws.