LIPIcs.RTA.2010.401.pdf
- Filesize: 219 kB
- 16 pages
Document
Proving Productivity in Infinite Data Structures
Authors
-
Part of:
Volume:
Proceedings of the 21st International Conference on Rewriting Techniques and Applications (RTA 2010)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Rewriting Techniques and Applications (RTA) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2010-07-06
Cite AsGet BibTex
Hans Zantema and Matthias Raffelsieper. Proving Productivity in Infinite Data Structures. In Proceedings of the 21st International Conference on Rewriting Techniques and Applications. Leibniz International Proceedings in Informatics (LIPIcs), Volume 6, pp. 401-416, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/LIPIcs.RTA.2010.401
https://doi.org/10.4230/LIPIcs.RTA.2010.401
Abstract
For a general class of infinite data structures including streams, binary trees, and the combination of finite and infinite lists, we investigate the notion of productivity. This generalizes stream productivity. We develop a general technique to prove productivity
based on proving context-sensitive termination, by which the power of present termination tools can be exploited. In order to treat cases where the approach does not apply directly, we develop transformations extending the power of the basic approach. We present a tool combining these ingredients that can prove productivity of a wide range of examples fully automatically.
Keywords
- Productivity
- infinite data structures
- streams
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads