Turing-completeness of polymorphic stream equation systems
Paper i proceeding, 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 destructors and recursive calls. Using methods reminiscent of prior results in the field, we first show this class consists of exactly the computable polymorphic stream functions. Using much more intricate techniques, our main result states this holds true even for unary equations free of mutual recursion, yielding an elegant model of Turing-completeness in a severely restricted environment and allowing us to recover previous complexity results in a much more restricted setting.

Författare

Christian Sattler

Logik och Typer

Florent Balestrieri

Leibniz International Proceedings in Informatics, LIPIcs

18688969 (ISSN)

Vol. 15 256-271

23rd International Conference on Rewriting Techniques and Applications
, ,

Ämneskategorier

Algebra och logik

Datavetenskap (datalogi)

DOI

10.4230/LIPIcs.RTA.2012.256

Mer information

Skapat

2023-11-15