Theoretical Computer Science
Computational interpretations of linear logic
Theoretical Computer Science - Special volume of selected papers of the Sixth Workshop on the Mathematical Foundations of Programming Semantics, Kingston, Ont., Canada, May 1990
ALGOL-like languages (v.2)
Syntactic control of interference revisited
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
Objects, interference, and the Yoneda embedding
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
From Algol to polymorphic linear lambda-calculus
Journal of the ACM (JACM)
Syntactic control of interference
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
Proceedings of the 7th International Conference on Mathematical Foundations of Programming Semantics
Proceedings of the 9th International Conference on Mathematical Foundations of Programming Semantics
Syntactic Control of Inference, Part 2
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Linear Lambda-Calculus and Categorial Models Revisited
CSL '92 Selected Papers from the Workshop on Computer Science Logic
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
A category-theoretic approach to the semantics of programming languages
A category-theoretic approach to the semantics of programming languages
Proof-Search and Countermodel Generation in Propositional BI Logic
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Local Reasoning about Programs that Alter Data Structures
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A Fully Abstract Relational Model of Syntactic Control of Interference
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
A games model of bunched implications
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Hi-index | 0.00 |
We introduce the αλ-calculus, a typed calculus that includes a multiplicative function type -* alongside an additive function type →. It arises proof-theoretically as a calculus of proof terms for the logic of bunched implications of O'Hearn and Pym, and semantically from doubly closed categories, where a single category possesses two closed structures. Typing contexts in αλ are bunches, i.e., trees built from two combining operations, one that admits the structural rules of Weakening and Contraction and another that does not. To illuminate the consequences of αλ's approach to the structural rules we define two resource interpretations, extracted from Reynolds's "sharing reading" of affine λ-calculus. Based on this we show how αλ enables syntactic control of interference and Idealized Algol, imperative languages based on affine and simply-typed λ-calculi, to be smoothly combined in one system.