J.V. Tucker and J.I. Zucker (1994):
**Computable functions on stream algebras**, in

*NATO Advanced Study Institute, International
Summer School on Proof and Computation,
Marktoberdorf, Germany, 1993*,
ed. H. Schwichtenberg
(Springer-Verlag),
341-382.
[text.ps.gz]

**Abstract.**
Let *A* be a many-sorted algebra. A stream over *A* is an
infinite sequence of data from *A*. We investigate various
models of computation on streams over *A*. We show how models
of deterministic parallel computation on *A* can be adapted to
provide new models of computation on stream algebras over *A*.
The primary models considered are simultaneous primitive
recursion schemes, with and without the least number
operator, over *A*. We also look at an imperative model
involving concurrent assignments.