Light Logics and the Call-by-Value Lambda Calculus

Abstract

The so-called light logics have been introduced as logical systems enjoying quite remarkable normalization properties. Designing a type assignment system for pure lambda calculus from these logics, however, is problematic. In this paper we show that shifting from usual call-by-name to call-by-value lambda calculus allows regaining strong connections with the underlying logic. This will be done in the context of Elementary Affine Logic (EAL), designing a type system in natural deduction style assigning EAL formulae to lambda terms.

28 pages

References in corpus (1)

• Light types for polynomial time computation in lambda-calculus

Cited by in corpus (1)

• Elementary affine $lambda$-calculus with multithreading and side effects