Polynomial time over the reals with parsimony - Archive ouverte HAL Access content directly
Conference Papers Year :

Polynomial time over the reals with parsimony

(1) , (2) , (1)


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.
Fichier principal
Vignette du fichier
main.pdf (333.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02499149 , version 1 (06-03-2020)


  • HAL Id : hal-02499149 , version 1


Emmanuel Hainry, Damiano Mazza, Romain Péchoux. Polynomial time over the reals with parsimony. FLOPS 2020 - International Symposium on Functional and Logic Programming, Apr 2020, Akita, Japan. ⟨hal-02499149⟩
130 View
195 Download


Gmail Facebook Twitter LinkedIn More