Proving Productivity in Infinite Data Structures

Authors Hans Zantema, Matthias Raffelsieper

Thumbnail PDF


  • Filesize: 219 kB
  • 16 pages

Document Identifiers

Author Details

Hans Zantema
Matthias Raffelsieper

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)


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.
  • Productivity
  • infinite data structures
  • streams


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail