317 citations · 321 across the 11 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.PL2018
A Type-Based Complexity Analysis of Object Oriented Programs
Emmanuel Hainry, Romain Péchoux
A type system is introduced for a generic Object Oriented programming language in order to infer resource upper bounds. A sound andcomplete characterization of the set of polynomia…
cs.LO2018★ 1 cited
Theory of higher order interpretations and application to Basic Feasible Functions
Emmanuel Hainry, Romain Péchoux
Interpretation methods and their restrictions to polynomials have been deeply used to control the termination and complexity of first-order term rewrite systems. This paper extends…