While waiting for permission to post the original paper, I will show you the examples. I hope that you may find them interesting -- specially the more complex ones at the end.
I am curious whether you can reimplement them in newLisp. Well, I'm sure you can, because I have done them in Elica Logo.
NOTE! The author's terminology is to use 'sequence' instead of 'stream'.
So, let me first enumerate the sequence functions:
seq - creates a sequence
head-el - returns the first element
tail-seq - returns the subsequence without the first element
shs - shows a sequence
sshs - shows a sequence of sequences
The semantic relations between these functions are:
(seq (head-el x) (tail-seq x)) is x
(head-el (seq h t)) is h
(tail-seq (seq h t)) is t