
handle: 2433/63002
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.
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), Combinatory logic and lambda calculus, Proof-theoretic aspects of linear logic and other substructural logics, Functional programming and lambda calculus, 410
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.), Combinatory logic and lambda calculus, Proof-theoretic aspects of linear logic and other substructural logics, Functional programming and lambda calculus, 410
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
