Communicating sequential processes
Communicating sequential processes
Theoretical Computer Science
An algorithm for optimal lambda calculus reduction
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A formulae-as-type notion of control
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The geometry of optimal lambda reduction
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the &pgr;-calculus and linear logic
MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
Linear logic: its syntax and semantics
Proceedings of the workshop on Advances in linear logic
From proof-nets to interaction nets
Proceedings of the workshop on Advances in linear logic
Geometry of interaction III: accommodating the additives
Proceedings of the workshop on Advances in linear logic
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Sharing Continuations: Proofnets for Languages with Explicit Control
ESOP '00 Proceedings of the 9th European Symposium on Programming Languages and Systems
Concurrent Games and Full Completeness
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Extracting Constructive Content from Classical Proofs
Extracting Constructive Content from Classical Proofs
A token machine for full geometry of interaction
TLCA'01 Proceedings of the 5th international conference on Typed lambda calculi and applications
Structure of proofs and the complexity of cut elimination
Theoretical Computer Science
| Hi-index | 0.00 |
We provide a context semantics for Multiplicative-Additive Linear Logic (MALL), together with proofnets whose reduction preserves semantics, where proofnet reduction is equated with cut-elimination on MALL sequents. The results extend the program of Gonthier, Abadi, and L茅vy, who provided a "geometry of optimal 驴-reduction" (context semantics) for 驴-calculus and Multiplicative-Exponential Linear Logic (MELL). We integrate three features: a semantics that uses buses to implement slicing; a proofnet technology that allows multidimensional boxes and generalized garbage, preserving the linearity of additive reduction; and finally, a read-back procedure that computes a cut-free proof from the semantics, a constructive companion to full abstraction theorems.