Section: New Results

Resource bounded computation

• Participants: Emmanuel Hainry

Controlling resource consumption is a crucial aspect of programming. Resources such as time, space, intrication are limited, and helping the programmer to avoid overconsumption or pointing problematic code is an important endeavor. We introduced a type-system for an Object Oriented Programming Language (à la Java) that gives a guarantee of polynomial-time computability provided that the program halts [12]. This result has several interesting features as it works with complex object data-structures in a real-like programming language; checking the type system is polynomial time decidable; we provided a $O$ bound hence giving an explicit worst case complexity bound.