Skip to Main content Skip to Navigation
Conference papers

Observation of implicit complexity by non confluence

Guillaume Bonfante 1 
1 CARTE - Theoretical adverse computations, and safety
Inria Nancy - Grand Est, LORIA - FM - Department of Formal Methods
Abstract : We propose to consider non confluence with respect to implicit complexity. We come back to some well known classes of first-order functional program, for which we have a characterization of their intentional properties, namely the class of cons-free programs, the class of programs with an inter- pretation, and the class of programs with a quasi-interpretation together with a termination proof by the product path ordering. They all correspond to PTIME. We prove that adding non confluence to the rules leads to respectively PTIME, NPTIME and PSPACE. Our thesis is that the separation of the classes is actually a witness of the intentional properties of the initial classes of programs.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/inria-00535539
Contributor : Guillaume Bonfante Connect in order to contact the contributor
Submitted on : Thursday, November 11, 2010 - 2:19:22 PM
Last modification on : Saturday, June 25, 2022 - 7:45:13 PM
Long-term archiving on: : Friday, October 26, 2012 - 3:26:49 PM

File

dice.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00535539, version 1

Collections

Citation

Guillaume Bonfante. Observation of implicit complexity by non confluence. International Workshop on Developments in Implicit Computational complExity - DICE 2010, Mar 2010, Paphos, Cyprus. ⟨inria-00535539⟩

Share

Metrics

Record views

108

Files downloads

84