AbstractAn arithmetical system is presented with the property that from every proof a realizing term can be extracted that is definable in a certain affine linear typed variant of Gödel's T and therefore defines a non-size-increasing polynomial time computable function
We present a Coq library that allows for readily proving that a function is computable in polynomial...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characterizati...
The problems associated with the construction of polynomial complexity computer programs require new...
AbstractAn arithmetical system is presented with the property that from every proof a realizing term...
AbstractWe investigate the computing power of function algebras defined by means of unbounded recurs...
It is well known that the Boolean functions corresponding to a function computable in polynomial tim...
We define a restriction LHA of Heyting arithmetic HA with the property that all extracted programs a...
AbstractUsual typed lambda-calculi yield input/output specifications; in this paper the authors show...
International audienceWe provide a characterization of Ko's class of polynomial time computable func...
AbstractWe define a restriction LHA of Heyting arithmetic HA with the property that all extracted pr...
International audienceElementary linear logic is a simple variant of linear logic due to Girard and ...
International audienceThe class of functions from the integers to the integers computable in polynom...
Colloque avec actes et comité de lecture. internationale.International audienceThis paper presents a...
International audienceWe show how to represent polynomial time computation in an untyped version of ...
We look at the hypothesis that all honest onto polynomial-time computable functions have a polynomia...
We present a Coq library that allows for readily proving that a function is computable in polynomial...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characterizati...
The problems associated with the construction of polynomial complexity computer programs require new...
AbstractAn arithmetical system is presented with the property that from every proof a realizing term...
AbstractWe investigate the computing power of function algebras defined by means of unbounded recurs...
It is well known that the Boolean functions corresponding to a function computable in polynomial tim...
We define a restriction LHA of Heyting arithmetic HA with the property that all extracted programs a...
AbstractUsual typed lambda-calculi yield input/output specifications; in this paper the authors show...
International audienceWe provide a characterization of Ko's class of polynomial time computable func...
AbstractWe define a restriction LHA of Heyting arithmetic HA with the property that all extracted pr...
International audienceElementary linear logic is a simple variant of linear logic due to Girard and ...
International audienceThe class of functions from the integers to the integers computable in polynom...
Colloque avec actes et comité de lecture. internationale.International audienceThis paper presents a...
International audienceWe show how to represent polynomial time computation in an untyped version of ...
We look at the hypothesis that all honest onto polynomial-time computable functions have a polynomia...
We present a Coq library that allows for readily proving that a function is computable in polynomial...
The outcomes of this article are twofold. Implicit complexity. We provide an implicit characterizati...
The problems associated with the construction of polynomial complexity computer programs require new...
DOI
Add to ORKG