A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
Elementary Affine Logic and the Call-by-Value Lambda Calculus
[chapter]
2005
Lecture Notes in Computer Science
Preserved Fulltext
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
doi:10.1007/11417170_11
fatcat:yj7f7zel6jcenoiamfhxga7po4