Data-Oblivious Stream Productivity

Authors:
Jörg Endrullis;Clemens Grabmayer;Dimitri Hendriks
Affiliations:
Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands 1081 HV;Department of Philosophy, Universiteit Utrecht, Utrecht, The Netherlands 3584 CS;Department of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands 1081 HV
Venue:
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2008

Citing 5
Cited 7

On the productivity of recursive list definitions

ACM Transactions on Programming Languages and Systems (TOPLAS)
Sufficient-completeness, ground-reducibility and their complexity

Acta Informatica
Proving the correctness of reactive systems using sized types

POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Ensuring Streams Flow

AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Productivity of stream definitions

FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory

Well-Definedness of Streams by Termination

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
The $\Pi^0_2$-Completeness of Most of the Properties of Rewriting Systems You Care About (and Productivity)

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Proving the unique fixed-point principle correct: an adventure with category theory

Proceedings of the 16th ACM SIGPLAN international conference on Functional programming
Automatic Sequences and Zip-Specifications

LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
On the complexity of equivalence of specifications of infinite objects

Proceedings of the 17th ACM SIGPLAN international conference on Functional programming
Highlights in infinitary rewriting and lambda calculus

Theoretical Computer Science
Circular coinduction in coq using bisimulation-up-to techniques

ITP'13 Proceedings of the 4th international conference on Interactive Theorem Proving

Quantified Score

Hi-index	0.01

Visualization

Abstract

We 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, also adopted here, 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 our algorithm one has to proceed in a data-aware fashion.