Dulma Rodriguez: Towards Type Inference for RAJA (work in progress)
RAJA is a type system for a compile-time analysis of heap-space requirements for Java style object-oriented programs. Last year we developed a typechecking algorithm for this system.
Our next goal is the type inference: starting from a Java-like program without RAJA type annotations, we try to find them by a constraint-based analysis. In this talk we will present a constraint-generation system and some ideas for solving the constraints.