A study of abramsky’s linear chemical abstract machine

Seikoh Mikami, Yohji Akama

研究成果: Conference contribution

抄録

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.

本文言語English
ホスト出版物のタイトルTyped Lambda Calculi and Applications - 4th International Conference, TLCA 1999, Proceedings
編集者Jean-Yves Girard
出版社Springer Verlag
ページ243-257
ページ数15
ISBN(印刷版)3540657630, 9783540657637
DOI
出版ステータスPublished - 1999
イベント4th International Conference on Typed Lambda Calculi and Applications, TLCA 1999 - L’Aquila, Italy
継続期間: 1999 4 71999 4 9

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
1581
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

Other

Other4th International Conference on Typed Lambda Calculi and Applications, TLCA 1999
国/地域Italy
CityL’Aquila
Period99/4/799/4/9

ASJC Scopus subject areas

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「A study of abramsky’s linear chemical abstract machine」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル