Turing-Completeness of Polymorphic Stream Equation Systems

@inproceedings{Sattler2012TuringCompletenessOP,
  title={Turing-Completeness of Polymorphic Stream Equation Systems},
  author={Christian Sattler and Florent Balestrieri},
  booktitle={RTA},
  year={2012}
}
Polymorphic stream functions operate on the structure of streams, infinite sequences of elements, without inspection of the contained data, having to work on all streams over all signatures uniformly. A natural, yet restrictive class of polymorphic stream functions comprises those definable by a system of equations using only stream constructors and… CONTINUE READING