A simple abstract machine for functional first-class continuations
Keisuke Narita, Shin-ya Nishizaki, Takahisa Mizuno · 2010
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.