Theoretical Computer Science
POPL '92 Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Programs with continuations and linear logic
TACS'91 Selected papers of the conference on Theoretical aspects of computer software
A classical linear &lgr;-calculus
Theoretical Computer Science - Special issue on linear logic, 1
Lambda-My-Calculus: An Algorithmic Interpretation of Classical Natural Deduction
LPAR '92 Proceedings of the International Conference on Logic Programming and Automated Reasoning
What is a Categorical Model of Intuitionistic Linear Logic?
TLCA '95 Proceedings of the Second International Conference on Typed Lambda Calculi and Applications
Logical Predicates for Intuitionistic Linear Type Theories
TLCA '99 Proceedings of the 4th International Conference on Typed Lambda Calculi and Applications
Linearly Used Effects: Monadic and CPS Transformations into the Linear Lambda Calculus
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
A Mixed Linear and Non-Linear Logic: Proofs, Terms and Models (Extended Abstract)
CSL '94 Selected Papers from the 8th International Workshop on Computer Science Logic
Categorical Models for Intuitionistic and Linear Type Theory
FOSSACS '00 Proceedings of the Third International Conference on Foundations of Software Science and Computation Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software,ETAPS 2000
Glueing and orthogonality for models of linear logic
Theoretical Computer Science - Category theory and computer science
Girard translation and logical predicates
Journal of Functional Programming
Linearly Used Effects: Monadic and CPS Transformations into the Linear Lambda Calculus
FLOPS '02 Proceedings of the 6th International Symposium on Functional and Logic Programming
Classical linear logic of implications
Mathematical Structures in Computer Science
Remarks on semantic completeness for proof-terms with Laird's dual affine/intuitionistic λ-Calculus
Rewriting Computation and Proof
| Hi-index | 0.00 |
We give a simple term calculus for the multiplicative exponential fragment of Classical Linear Logic, by extending Barber and Plotkin's system for the intuitionistic case. The calculus has the nonlinear andlin ear implications as the basic constructs, andt his design choice allows a technically managable axiomatization without commuting conversions. Despite this simplicity, the calculus is shown to be sound andcom plete for category-theoretic models given by *-autonomous categories with linear exponential comonads.