Well-Definedness of Streams by Termination

Authors:
Hans Zantema
Affiliations:
Department of Computer Science, TU Eindhoven, Eindhoven, The Netherlands 5600 MB and Institute for Computing and Information Sciences, Radboud University, Nijmegen, Nijmegen, The Netherlands 6500 ...
Venue:
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Year:
2009

Citing 10
Cited 2

Termination of term rewriting using dependency pairs

Theoretical Computer Science - Trees in algebra and programming
Circular Coinductive Rewriting

ASE '00 Proceedings of the 15th IEEE international conference on Automated software engineering
Automatic Sequences: Theory, Applications, Generalizations

Automatic Sequences: Theory, Applications, Generalizations
A coinductive calculus of streams

Mathematical Structures in Computer Science
Equality of streams is a Π0 over 2-complete problem

Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
Data-Oblivious Stream Productivity

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Tyrolean Termination Tool 2

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
CIRC: a circular coinductive prover

CALCO'07 Proceedings of the 2nd international conference on Algebra and coalgebra in computer science
The termination competition

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications

Circular Coinduction with Special Contexts

ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Bisimulations Generated from Corecursive Equations

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream specification to a TRS in such a way that termination of the resulting TRS implies that the stream specification admits a unique solution. As a consequence, proving such well-definedness of several interesting stream specifications can be done fully automatically using present powerful tools for proving TRS termination.