| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Polynomial time over the reals with parsimony
Abstract : We provide a characterization of Ko's class of polynomial time computable functions over real numbers. This characterization holds for a stream based language using a parsimonious type discipline, a variant of propositional linear logic. We obtain a first characterization of polynomial time computations over the reals on a higher-order functional language using a linear/affine type system.
Cited literature [28 references]
https://hal.inria.fr/hal-02499149
Contributor : Romain Péchoux Connect in order to contact the contributor
Submitted on : Friday, March 6, 2020 - 9:56:08 AM
Last modification on : Thursday, January 20, 2022 - 5:29:00 PM
Long-term archiving on: : Sunday, June 7, 2020 - 1:05:33 PM
Contributor : Romain Péchoux Connect in order to contact the contributor
Submitted on : Friday, March 6, 2020 - 9:56:08 AM
Last modification on : Thursday, January 20, 2022 - 5:29:00 PM
Long-term archiving on: : Sunday, June 7, 2020 - 1:05:33 PM
File
main.pdf
Files produced by the author(s)