2026-07-23T00:18:40Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3497 2024-03-06T10:34:17Z ddc:004 open_access

Turing-Completeness of Polymorphic Stream Equation Systems Sattler, Christian Balestrieri, Florent turing-completeness polymorphic stream functions 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Christian Sattler and Florent Balestrieri 2012 Is Part Of LIPIcs, Volume 15, 23rd International Conference on Rewriting Techniques and Applications (RTA'12) (2012) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.RTA.2012.256 urn:nbn:de:0030-drops-34970 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.256 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode