Sharing Continuations: Proofnets for Languages with Explicit Control

13 years 8 months ago

Download www.church-project.org

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

Julia L. Lawall, Harry G. Mairson

Real-time Traffic

ESOP 2000 | Linear Logic | Linear Logic Proofs | Multiplicative-exponential Linear Logic | Programming Languages |

claim paper

» Type inference in intuitionistic linear logic

» EffectiveAdvice disciplined advice with explicit effects

» Polymorphic Delimited Continuations

» Recycling Continuations

» A software tool for largescale sharing and querying of clinical documents modeled using HL...

» Process Control and Scheduling Issues for Multiprogrammed SharedMemory Multiprocessors

» GroupCentric Models for Secure and Agile Information Sharing

» Knowledge formalization in experience feedback processes An ontologybased approach

Post Info
More Details (n/a)

Added	24 Aug 2010
Updated	24 Aug 2010
Type	Conference
Year	2000
Where	ESOP
Authors	Julia L. Lawall, Harry G. Mairson

Comments (0)

Sciweavers

Sharing Continuations: Proofnets for Languages with Explicit Control

ESOP 2000 | Linear Logic | Linear Logic Proofs | Multiplicative-exponential Linear Logic | Programming Languages |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers