On the productivity of recursive list definitions
ACM Transactions on Programming Languages and Systems (TOPLAS)
Infinite objects in type theory
TYPES '93 Proceedings of the international workshop on Types for proofs and programs
Proving the correctness of reactive systems using sized types
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Bisimilarity as a theory of functional programming
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
A Foundation for Computable Analysis
Foundations of Computer Science: Potential - Theory - Cognition, to Wilfried Brauer on the occasion of his sixtieth birthday
Transfinite Reductions in Orthogonal Term Rewriting Systems (Extended Abstract)
RTA '91 Proceedings of the 4th International Conference on Rewriting Techniques and Applications
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Stream Processing Hardware from Functional Language Specifications
HICSS '03 Proceedings of the 36th Annual Hawaii International Conference on System Sciences (HICSS'03) - Track 9 - Volume 9
Synthesis of max-plus quasi-interpretations
Fundamenta Informaticae - Typed Lambda Calculi and Applications 2003, Selected Papers
Characterizations of polynomial complexity classes with a better intensionality
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
Upper bounds on stream I/O using semantic interpretations
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Quasi-interpretations a way to control resources
Theoretical Computer Science
Resource analysis by sup-interpretation
FLOPS'06 Proceedings of the 8th international conference on Functional and Logic Programming
Productivity of stream definitions
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
Ramified Corecurrence and Logspace
Electronic Notes in Theoretical Computer Science (ENTCS)
| Hi-index | 0.02 |
In this paper, we push forward the approach proposed in [1] aiming at studying semantic interpretation criteria for the purpose of ensuring safety and complexity properties of programs working on streams. The paper improves the previous results by considering global and local upper bounds properties of both theoretical and practical interests guaranteeing that the size of each output stream element is bounded by a function in the maximal size of the input stream elements. Moreover, in contrast to previous studies, these properties also apply to a wide class of stream definitions, that is functions that do not have streams in the input but produce an output stream.