Objects in Polynomial Time - Archive ouverte HAL Access content directly
Conference Papers Year :

Objects in Polynomial Time

(1) , (1)


A type system based on non-interference and data ramification principles is introduced in order to capture the set of functions computable in polynomial time on OO programs. The studied language is general enough to capture most OO constructs and our characterization is quite expressive as it allows the analysis of a combination of imperative loops and of data ramification scheme based on Bellantoni and Cook's safe recursion using function algebra.
Fichier principal
Vignette du fichier
ICCOW.pdf (366.3 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01206161 , version 1 (28-09-2015)



Emmanuel Hainry, Romain Péchoux. Objects in Polynomial Time. APLAS 2015, Nov 2015, Pohang, South Korea. pp.387--404, ⟨10.1007/978-3-319-26529-2_21⟩. ⟨hal-01206161⟩
204 View
155 Download



Gmail Facebook Twitter LinkedIn More