Polynomial Time over the Reals with Parsimony

Emmanuel Hainry, Damiano Mazza, Romain Péchoux

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationFunctional and Logic Programming - 15th International Symposium, FLOPS 2020, Proceedings
EditorsKeisuke Nakano, Konstantinos Sagonas
PublisherSpringer Science and Business Media Deutschland GmbH
Pages50-65
Number of pages16
ISBN (Print)9783030590246
DOIs
Publication statusPublished - 1 Jan 2020
Externally publishedYes
Event15th International Symposium on Functional and Logic Programming, FLOPS 2020 - Akita, Japan
Duration: 14 Sept 202016 Sept 2020

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12073 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference15th International Symposium on Functional and Logic Programming, FLOPS 2020
Country/TerritoryJapan
CityAkita
Period14/09/2016/09/20

Fingerprint

Dive into the research topics of 'Polynomial Time over the Reals with Parsimony'. Together they form a unique fingerprint.

Cite this