Direct exhaustive runtime kernels for configured byte formats #
Every binary-interchange descriptor occupying at most eight encoded bits admits the same format-independent tiny-table backend used by other finite encodings. Table generation evaluates the reference definition, while warm execution performs native indexing and one byte load.
The operation planner may reject a table when setup cost or resident memory is inappropriate for
the selected workload. That policy does not affect the refinement proofs in ByteTable.Proof.
The exact binary-interchange model as a proved finite byte encoding.
Instances For
Tables generated from reference model kernels #
Lazily generated direct addition table.
Instances For
Lazily generated direct subtraction table.
Instances For
Lazily generated direct multiplication table.
Instances For
Lazily generated direct division table.
Instances For
Lazily generated direct square-root table.
Instances For
Lazily generated direct fused-multiply-add table.
Instances For
Direct configured-carrier execution #
Execute one already-constructed certified binary table on the configured byte carrier.
The explicit table argument ensures the selected capability captures one memoizing Thunk
instead of constructing a fresh cell on every arithmetic call.
Instances For
Execute one already-constructed certified unary table on the configured byte carrier.
Instances For
Execute one already-constructed certified ternary table on the configured byte carrier.