Add to ORKGArticle dans revue scientifique avec comité de lecture. internationale.International audienceWe study the effect of polynomial interpretation termination proofs of deterministic (resp. non-deterministic) algorithms defined by confluent (resp. non-confluent) rewrite systems over data structures which include strings, lists and trees, and we classify them according to the interpretations of the constructors. This leads to the definition of six function classes which turn out to be exactly the deterministic (resp. non-deterministic) polynomial time, linear exponential time and linear doubly exponential time computable functions when the class is based on confluent (resp. non-confluent) rewrite systems. We also obtain a characterisation of the ...
Abstract. Polynomial interpretations are a useful technique for proving termination of term rewrite ...
Orderings on polynomial interpretations of operators represent a powerful technique for proving thet...
Abstract. In this paper, we study computability and complexity of real functions. We extend these no...
Article dans revue scientifique avec comité de lecture. internationale.International audienceWe stud...
Rapport interne.We study deterministic (non-deterministic) algorithms define by mean of confluent (r...
We are concerned with functions over words which are computable by means of a rewrite system admitti...
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally pro...
We present a Coq library that allows for readily proving that a function is computable in polynomial...
International audienceThis paper provides a criterion based on interpretation methods on term rewrit...
Polynomial interpretations and their generalizations like quasi-interpretations have been used in th...
Abstract. We define the class of constrained cons-free rewriting systems and show that this class ch...
Polynomial interpretations and their generalizations like quasi-interpretations have been used in th...
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...
Colloque avec actes et comité de lecture. internationale.International audienceWe demonstrate that t...
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpr...
Abstract. Polynomial interpretations are a useful technique for proving termination of term rewrite ...
Orderings on polynomial interpretations of operators represent a powerful technique for proving thet...
Abstract. In this paper, we study computability and complexity of real functions. We extend these no...
Article dans revue scientifique avec comité de lecture. internationale.International audienceWe stud...
Rapport interne.We study deterministic (non-deterministic) algorithms define by mean of confluent (r...
We are concerned with functions over words which are computable by means of a rewrite system admitti...
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally pro...
We present a Coq library that allows for readily proving that a function is computable in polynomial...
International audienceThis paper provides a criterion based on interpretation methods on term rewrit...
Polynomial interpretations and their generalizations like quasi-interpretations have been used in th...
Abstract. We define the class of constrained cons-free rewriting systems and show that this class ch...
Polynomial interpretations and their generalizations like quasi-interpretations have been used in th...
International audienceRecursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], ...
Colloque avec actes et comité de lecture. internationale.International audienceWe demonstrate that t...
Abstract. We show how to generate well-founded and stable term orderings based on polynomial interpr...
Abstract. Polynomial interpretations are a useful technique for proving termination of term rewrite ...
Orderings on polynomial interpretations of operators represent a powerful technique for proving thet...
Abstract. In this paper, we study computability and complexity of real functions. We extend these no...