Idealized DSL examples

These files express author algorithms rather than accommodations to one implementation. They intentionally contain no physical tiles, I.auto, program IDs, warps, storage scopes, target primitives or autotune configurations.

• Pointwise: pure tensor definitions over complete logical domains.
• Reduction: generic reduce with typed combines.
• GEMM: whole-domain contractions and algorithm constexpr branches.
• Online softmax: typed-record summary algebra, without state_stream.
• FlashAttention: region fold explicitly expresses local QK/max/sum/PV and merges without exposing physical Q/K extents.
• Causal linear attention: region scan expresses slice summaries, incoming state, causal output and final state with unobservable segmentation.
• Mamba state passing: observable chunk axes/per-chunk incoming states/final state use explicit logical chunks and ordered carries, not region scan.
• Ragged grouped GEMM: mechanical ragged helpers expand to offsets/subregions/index relations, followed by gather/contract/unique scatter.
• Split-K pipeline: explicit part domains, boundaries, source subregions, partial tensors and two-kernel orchestration without partition.

These are normative programming-model illustrations, not test fixtures. Each surface spelling must normalize mechanically to its canonical semantics.