Elementary Affine Logic and the Call-by-Value Lambda Calculus [chapter]

Paolo Coppola, Ugo Dal Lago, Simona Ronchi Della Rocca
2005 Lecture Notes in Computer Science  
Light and elementary linear 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, as discussed in [1] . In this paper, we show that shifting from usual call-by-name to call-by-value lambda calculus allows to regain strong connections with the underlying logic. We will do this in the context of Elementary Affine Logic (EAL), designing a type system
more » ... n natural deduction style assigning EAL formulae to lambda terms.
doi:10.1007/11417170_11 fatcat:yj7f7zel6jcenoiamfhxga7po4