Section: Scientific Foundations

Implicit computational complexity

A number of elegant and powerful results have been recently obtained in implicit computational complexity in the $\lambda$-calculus in which ideas from Linear Logics enable a fine-grained control over computations. This experience can be profitable when tackling issues of CBUS related to resource consumption, such as resources allocation, access to resources, certification of bounds on resource consumption (e.g., ensuring that a service will answer to a request in time polynomial with respect to the size of the input data).