Proceedings of International Symposium on Communications and Information Technologies 2010
巻, 号, ページ
pp. 111-114
出版年月
2010年10月
出版者
和文:
英文:
IEEE
会議名称
和文:
英文:
International Symposium on Communications and Information Technologies 2010
開催地
和文:
英文:
Tokyo, Japan
アブストラクト
Many kinds of abstract machine have been proposed for executing byte codes of functional languages, such as Landin's SECD machine and Curien's Categorical Abstract Machine, which have been studied for decades from a theoretical viewpoint and applied in the implementation of functional language processors. In this paper, we propose the Simple Abstract Machine (SAM), a simplified SECD machine. The simplification lets us handle first-class continuations in the framework of abstract machines.