Data-Oblivious Stream Productivity

Simple item page
dc.creatorEndrullis, Joerg
dc.creatorGrabmayer, Clemens
dc.creatorHendriks, Dimitri
dc.date2008-06-16
dc.date2008-07-19
dc.date.accessioned2026-07-07T09:51:08Z
dc.date.available2026-07-07T09:51:08Z
dc.descriptionWe are concerned with demonstrating productivity of specifications of infinite streams of data, based on orthogonal rewrite rules. In general, this property is undecidable, but for restricted formats computable sufficient conditions can be obtained. The usual analysis disregards the identity of data, thus leading to approaches that we call data-oblivious. We present a method that is provably optimal among all such data-oblivious approaches. This means that in order to improve on the algorithm in this paper one has to proceed in a data-aware fashion.
dc.identifierhttps://arxiv.org/abs/0806.2680
dc.identifierhttp://arxiv.org/abs/0806.2680
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/165180
dc.subjectLogic in Computer Science
dc.subjectProgramming Languages
dc.titleData-Oblivious Stream Productivity
dc.typetext

Files

Collections

arXiv