A stream is an infinite sequence of data elements

- Well-definedness of Streams by Termination, appeared at RTA 2009
- Well-definedness of Streams by Transformation and Termination, extended version of RTA 2009 paper, appeared in LMCS
- A tool for applying the technique from the above papers together with several examples
- A Tool proving Well-definedness of Streams using Termination Tools, description of the above mentioned tool, appeared at CALCO 2009
- Proving Productivity in Infinite Data Structures, appeared at RTA 2010
- Proving Equality of Streams Automatically, accepted for RTA 2011

- The Fibonacci stream FIB, defined by

FIB = f(FIB)

for the stream function f defined by

f(0:s) = 0:1:f(s)

f(1:s) = 0:f(s) - The stream Q, defined by

Q = 1:f(Q)

for the stream function f defined by

f(0:s) = 1:0:f(s)

f(1:s) = 0:0:1:f(s) - A paper on Turtle graphics of morphic streams was written, giving criteria for turtles to be finite, fractal or space filling, and including many examples.
- This theory on turtle graphics and many other issues around infinity has been elaborated to a book Spelen met oneindigheid: verrassende figuren en patronen in Dutch, for a wider audience.