Theoretical Computer Science
POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proving memory management invariants for a language based on linear logic
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
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
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
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Call-by-name call-by-value, call-by-need and the linear lambda calculus
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
Communication and Concurrency
A Term Calculus for Intuitionistic Linear Logic
TLCA '93 Proceedings of the International Conference on Typed Lambda Calculi and Applications
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Linear Logic, Monads and the Lambda Calculus
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
Abramsky's Linear Chemical Abstract Machine (LCHAM) is a term calculus which corresponds to Linear Logic, via the Curry-Howard isomorphism. We introduce a translation from a linear λ-calculus into lcham. The translation result can be well regarded as a black box with the i/o ports being atomic.We show that one step computation of LCHAM is equivalent to that of the linear λ-calculus. Then, we prove the principal typing theorem of LCHAM, which implies the decidability of type checking.