Resource analysis and implicit computational complexity

Implicit computational complexity (ICC) studies machine-independent approaches to computational complexity, with emphasis on approaches based on mathematical logic. Most work consists in characterizations of complexity classes by logical systems (via the Curry-Howard correspondence). Unfortunately, all these formal systems have been studied with differ-ent, often unrelated methodologies, and few results are known about relative intensional expressive power. For example, it is not clear whether combin-ing different systems into one language would break the correspondence to complexity classes. Moreover, two distinct characterizations of the same com-plexity class do not necessarily capture the same class of programs even if the underlying set of representable functions is the same. Summing up, the area is too fragmented and a paradigm shift is necessary in order to both maintain the research quality at a high level and enforce applications in the context of concrete programming languages (where keeping the class of captured pro-gram as large as possible is crucial). What is needed are some unifyin