Institut für Informatik
Ludwig-Maximilians-Universität München
Thursday, 26 May 2005, 14:00
Cybernetica Bldg (Akadeemia tee 21), room B101
Slides from the talk [pdf]
Abstract: The type-theoretical kernel of the Mobile Resource Guarantees framework consists of a type system which allows to infer linear bounds of heap consumption for functional programs.
The type system, proposed by Hofmann and Jost, may be considered as a banker's algorithm for heap. The term "banker's algorithm" is used in Amortised Analysis of resource consumption. In this method one associates with a node of data structure, such as an element of a list, a certain amount of a resource called a credit.
In the Hofmann-Jost system these credits are numerical constants. We consider the ways of generalisation of their approach, for instance, by introducing credits as functions. This allows to infer non-linear resource bounds, including polynomial and logarithmic ones.