Abstract
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.
Cite
CITATION STYLE
Hainry, E., & Péchoux, R. (2015). Objects in polynomial time. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9458, pp. 387–404). Springer Verlag. https://doi.org/10.1007/978-3-319-26529-2_21
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
