License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.RTA.2012.256
URN: urn:nbn:de:0030-drops-34970
URL: http://drops.dagstuhl.de/opus/volltexte/2012/3497/
Go to the corresponding LIPIcs Volume Portal


Sattler, Christian ; Balestrieri, Florent

Turing-Completeness of Polymorphic Stream Equation Systems

pdf-format:
Document 1.pdf (470 KB)


Abstract

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.

BibTeX - Entry

@InProceedings{sattler_et_al:LIPIcs:2012:3497,
  author =	{Christian Sattler and Florent Balestrieri},
  title =	{{Turing-Completeness of Polymorphic Stream Equation Systems}},
  booktitle =	{23rd International Conference on Rewriting Techniques and Applications (RTA'12) },
  pages =	{256--271},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-38-5},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{15},
  editor =	{Ashish Tiwari},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2012/3497},
  URN =		{urn:nbn:de:0030-drops-34970},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.RTA.2012.256},
  annote =	{Keywords: turing-completeness, polymorphic stream functions}
}

Keywords: turing-completeness, polymorphic stream functions
Seminar: 23rd International Conference on Rewriting Techniques and Applications (RTA'12)
Issue Date: 2012
Date of publication: 15.05.2012


DROPS-Home | Fulltext Search | Imprint Published by LZI