Accepted. To be publishedInternational audienceInterpretation methods are important tools in implicit computational complexity. They have been proved particularly useful to statically analyze and to limit the complexity of programs. However, most of this studies have been so far applied in the context of term rewriting systems over finite data.In this paper, we show how interpretations can also be used to study properties of lazy first-order functional programs over streams. In particular, we provide some interpretation criteria useful to ensure two kinds of stream properties: space upper bounds and input/output upper bounds. Our space upper bounds criteria ensures global and local upper bounds on the size of each output stream element expr...
AbstractWe give an algorithm for deciding productivity of a large and natural class of recursive str...
In this paper we study the space requirement of algorithms that make only one (or a small number of)...
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the i...
Interpretation methods are important tools in implicit computational complexity. They have been prov...
Accepted. To be publishedInternational audienceInterpretation methods are important tools in implici...
Abstract. In this paper, we push forward the approach proposed in [1] aiming at studying semantic in...
The original publication is available at www.springerlink.comInternational audienceThis paper extend...
Abstract. This paper extends for the first time semantic interpretation tools to infinite data in or...
International audienceThis paper provides a criterion based on interpretation methods on term rewrit...
This thesis is concerned with the resource consumption of lazy functional languages. It touches upon...
Quasi-interpretations are an useful tool to control resource usage of term rewriting systems, either...
We show that LOGSPACE is characterised by finite orthogonal tail-recursive cons-free constructor ter...
International audiencePolynomial interpretations and their generalizations like quasi-interpretation...
We give an algorithm for deciding productivity of a large and natural class of recursive stream defi...
An applicative program denotes a function mapping values from some domain to some range. Abstract in...
AbstractWe give an algorithm for deciding productivity of a large and natural class of recursive str...
In this paper we study the space requirement of algorithms that make only one (or a small number of)...
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the i...
Interpretation methods are important tools in implicit computational complexity. They have been prov...
Accepted. To be publishedInternational audienceInterpretation methods are important tools in implici...
Abstract. In this paper, we push forward the approach proposed in [1] aiming at studying semantic in...
The original publication is available at www.springerlink.comInternational audienceThis paper extend...
Abstract. This paper extends for the first time semantic interpretation tools to infinite data in or...
International audienceThis paper provides a criterion based on interpretation methods on term rewrit...
This thesis is concerned with the resource consumption of lazy functional languages. It touches upon...
Quasi-interpretations are an useful tool to control resource usage of term rewriting systems, either...
We show that LOGSPACE is characterised by finite orthogonal tail-recursive cons-free constructor ter...
International audiencePolynomial interpretations and their generalizations like quasi-interpretation...
We give an algorithm for deciding productivity of a large and natural class of recursive stream defi...
An applicative program denotes a function mapping values from some domain to some range. Abstract in...
AbstractWe give an algorithm for deciding productivity of a large and natural class of recursive str...
In this paper we study the space requirement of algorithms that make only one (or a small number of)...
The last decade witnessed the extensive studies of algorithms for data streams. In this model, the i...