sUTL in Everything: bounded programmable templates
A practical use of pure structured transformations, with the host controlling data, effects and rendering.
sUTL · Guide · Reference · Examples
Everything uses sUTL as a programmable template evaluator. The host supplies structured page data, runs a transform under resource limits, then validates and renders the resulting declarative layout.
Values in, layout data out
The transform computes layout data. It does not receive arbitrary filesystem, network or database access. Storage reads, related searches and rendering belong to the surrounding application. This is the host/guest boundary described in Why sUTL?.
Purity and resource limits
Pure programs can still recurse forever. Modern sUTL implementations offer step limits, depth limits and cancellation. An exhausted budget stops evaluation with a limit outcome; it does not produce a partially computed value. Those facilities are shipped behavior, not merely the aspiration described in the older history essay.
The host still needs to bound exposed input, accepted output and its own rendering work. Purity limits authority; execution budgets limit computation. Neither makes every possible transform cheap.
The current versions
sUTL 1.0 defines the language. Implementation releases from 1.1.0 add bounded execution while preserving the 1.0 conformance contract. Everything's publishing renderer uses the Python implementation with its resource limits.