Sharing Continuations: Proofnets for Languages with Explicit Control

We introduce graph reduction technology that implements functional languages with control, such as Scheme with call/cc, where continuations can be manipulated explicitly as values, and can be optimally reduced in the sense of L

• Type: Conference
• Year: 2000
• Where: ESOP
• Authors: Julia L. Lawall, Harry G. Mairson
• Keywords: ESOP 2000, Linear Logic, Linear Logic Proofs, Multiplicative-exponential Linear Logic, Programming Languages