Observation of implicit complexity by non confluence

Guillaume Bonfante

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 interpretation, 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.

In Patrick Baillot: Proceedings International Workshop on Developments in Implicit Computational complExity (DICE 2010), Paphos, Cyprus, 27-28th March 2010, Electronic Proceedings in Theoretical Computer Science 23, pp. 15–29.
Published: 5th May 2010.

ArXived at: http://dx.doi.org/10.4204/EPTCS.23.2 bibtex PDF

Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org