Data-Oblivious Stream Productivity

  • Jörg Endrullis
  • Clemens Grabmayer
  • Dimitri Hendriks
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5330)


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.


Stream Function Production Term Complete Lattice Stream Arity Stream Constant 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Buchholz, W.: A Term Calculus for (Co-)Recursive Definitions on Streamlike Data Structures. Annals of Pure and Applied Logic 136(1-2), 75–90 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Endrullis, J., Grabmayer, C., Hendriks, D.: Data-Oblivious Stream Productivity. Technical report (2008),
  3. 3.
    Endrullis, J., Grabmayer, C., Hendriks, D., Isihara, A., Klop, J.W.: Productivity of Stream Definitions. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) FCT 2007. LNCS, vol. 4639, pp. 274–287. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  4. 4.
    Hughes, J., Pareto, L., Sabry, A.: Proving the Correctness of Reactive Systems Using Sized Types. In: POPL 1996, pp. 410–423 (1996)Google Scholar
  5. 5.
    Kapur, D., Narendran, P., Rosenkrantz, D.J., Zhang, H.: Sufficient-Completeness, Ground-Reducibility and their Complexity. Acta Informatica 28(4), 311–350 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Sijtsma, B.A.: On the Productivity of Recursive List Definitions. ACM Transactions on Programming Languages and Systems 11(4), 633–649 (1989)CrossRefGoogle Scholar
  7. 7.
    Telford, A., Turner, D.: Ensuring Streams Flow. In: AMAST, pp. 509–523 (1997)Google Scholar
  8. 8.
    Terese: Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, vol. 55. Cambridge University Press, Cambridge (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Jörg Endrullis
    • 1
  • Clemens Grabmayer
    • 2
  • Dimitri Hendriks
    • 1
  1. 1.Department of Computer ScienceVrije Universiteit AmsterdamAmsterdamThe Netherlands
  2. 2.Department of PhilosophyUniversiteit UtrechtUtrechtThe Netherlands

Personalised recommendations