Contains fulltext :
                  84162.pdf (preprint version ) (Open Access

Raffelsieper, M.

Zantema, H.

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

Zantema, Hans

Raffelsieper, Matthias

Dagstuhl Research Online Publication Server

Proving Productivity in Infinite Data Structures

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

Pure OAI Repository

Proving productivity in infinite data structures

Radboud Repository

Zantema, H Hans

Raffelsieper, M Matthias

Repository TU/e

http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.380.9357

Proving Productivity in Infinite Data Structures

Abstract

Similar works

Full text

Available Versions

Dagstuhl Research Online Publication Server

Pure OAI Repository

Radboud Repository

Repository TU/e

Pure OAI Repository