 
Summary: Soft Time and Soft Space
Soft Linear Logic and Polynomialbound Complexity
Classes
Simona Ronchi Della Rocca
Dipartimento di Informatica  Universit`a di Torino
ronchi@di.unito.it
LSFA Ouro Preto 28/8/2007 p.1/27
Introduction
ICC: Implicit Computational Complexity
The problem: to design programming languages with bounded computational
complexity
The proposed solution: a MLlike approach
calculus as paradigmatic programming language
Types as semantic properties of terms
Type assignment for calculus such that:
types garantee the correctness of terms, in particular their complexity bound
if the type inference is decidable, the desired properties can be checked
statically at compilation time
The tecnical tool: the Light Logics (derived from the Linear Logic of Girard) where
the cutelimination procedure is bounded in time by the size of the proof,
