Stream Types
summary
Proposes a type-theoretic foundation that lets ordinary list programs run as online stream processors by rejecting programs that need unbounded buffering and by exposing rich sequential and parallel stream shapes. Introduces Delta (prototype language) and a core calculus λST that use an ordered context and a Curry-Howard-like correspondence to guarantee zero-memory streamability when possible, plus parallel composition types for multi-input/output pipelines. Uses Brzozowski-style derivatives for incremental operational semantics, proves soundness in the paper, and demonstrates filters, run-averages, and other working examples.
AI-written summary · about