From light logics to type assignments: a case study

  title={From light logics to type assignments: a case study},
  author={Marco Gaboardi and Simona Ronchi Della Rocca},
  journal={Log. J. IGPL},
Using Soft Linear Logic (SLL) as case study, we analyze a method for transforming a light logic into a type assignment system for the λ-calculus, inheriting the complexity properties of the logics. Namely the typing assures the strong normalization in a number of steps polynomial in the size of the term, and moreover all polynomial functions can be computed by λ-terms that can be typed in the system. The proposed method is general enough to be used also for other light logics. 

Tables from this paper

An Implicit Characterization of PSPACE
A type system for an extension of lambda calculus with a conditional construction, named STAB, that characterizes the PSPACE class, the first characterization of PSPACE that is based on lambda calculus and light logics.
Complexité Implicite de Lambda-Calculs Concurrents
Controlling the resource consumption of programs is crucial: besides performance reasons, it has many applications in the field of computer security where e.g. mobile or embedded systems dispose of
Linear Additives
  • Gianluca Curzi
  • Computer Science, Mathematics
  • 2020
LAM is presented as the type assignment system for a calculus endowed with copy constructors, which deal with substitution in a linear fashion, and a mildly weakened version of cut-elimination for this system is proven which takes a cubic number of steps.
Probabilistic Soft Type Assignment
PSTA, a probabilistic version of STA, the type-theoretical counterpart of Soft Linear Logic, is introduced, a type assignment for an extension of Simpson's Linear Lambda Calculus and its surface reduction, where Linear additives express random choice.


A Soft Type Assignment System for lambda -Calculus
A type assignment system for the λ-calculus (STA) is designed, which assigns toλ-terms as types (a proper subset of) SLL formulas, in such a way that typable terms inherit the good complexity properties of the logical system.
Light types for polynomial time computation in lambda-calculus
  • Patrick Baillot, K. Terui
  • Computer Science
    Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
  • 2004
It is established that as LAL, DIAL allows to represent all polytime functions and ensures good properties on lambda-terms: subject reduction is satisfied and a well-typed term admits a polynomial bound on the reduction by any strategy.
Light types for polynomial time computation in lambda calculus
Soft lambda-Calculus: A Language for Polynomial Time Computation
This work introduces Soft lambda-calculus as a calculus typable in the intuitionistic and affine variant of this logic and proves that the (untyped) terms of this calculus are reducible in polynomial time.
Type Inference for a Polynomial Lambda Calculus
An algorithm which, given in input a *** -term, provides all the constraints that need to be satisfied in order to type it, conjecture that, for the whole system, the type inference is undecidable, but the algorithm can be used for checking the typability of some particular terms.
Elementary Affine Logic and the Call-by-Value Lambda Calculus
This paper shows that shifting from usual call-by-name to call- by-value lambda calculus allows regaining strong connections with the underlying logic.
A logical account of pspace
This work proposes a characterization of PSPACE by means of atype assignment for an extension of lambda calculus with a conditional construction and introduces a call-by-name evaluation machine in order to compute programs in polynomial space.
Soft Linear Logic and Polynomial Complexity Classes
Light affine lambda calculus and polytime strong normalization
  • K. Terui
  • Computer Science, Mathematics
    Proceedings 16th Annual IEEE Symposium on Logic in Computer Science
  • 2001
This paper introduces an untyped term calculus, called the light affine lambda calculus, which is a simple modification of the /spl lambda/-calculus, and has ILAL as a type assignment system, and proves the polytime "strong" normalization theorem.
Lambda Calculus and Intuitionistic Linear Logic
A typed functional language Λ! and a categorical model for it and a type assignment for it, using formulas of Linear Logic as types, unlike all other extensions of Curry-Howard Isomorphism to Intuitionistic Linear Logic.