Some programming languages for LOGSPACE and PTIME - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2006

Some programming languages for LOGSPACE and PTIME


We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization shows that adding a choice command to a Ptime language (the language WHILE of Jones) may not necessarily provide NPtime computations. The result is close to Cook who used “auxiliary push-down automata”. Logspace is obtained through a decidable mechanism of tiering. It is based on an analysis of deforestation due to Wadler in. We get also a characterization of NLogspace.
Fichier principal
Vignette du fichier
bonfante.pdf (199.55 Ko) Télécharger le fichier

Dates and versions

inria-00105744 , version 1 (12-10-2006)


  • HAL Id : inria-00105744 , version 1


Guillaume Bonfante. Some programming languages for LOGSPACE and PTIME. 11th International Conference on Algebraic Methodology and Software Technology - AMAST'06, Jul 2006, Kuresaare/Estonie. ⟨inria-00105744⟩
107 View
290 Download


Gmail Facebook Twitter LinkedIn More