Department of Computer Science, Tokyo Institute of Technology, Ookayama, Meguro, Tokyo, Japan.

---

Abstract—Many researchers have studied abstract machines in order to give operational semantics to various kinds of programming languages. For example, Landin's SECD machine and Curien's Categorical Abstract Machine are proposed for functional programming languages and useful not only for theoretical studies but also implementation of practical language processors. We study simplification of SECD machine and design a new abstract machine, called Simple Abstract Machine. We achieve the simplification of SECD machine by abstracting substitutions for variables. In Simple Abstract Machine, we can formalize first-class continuations more simply and intelligibly than SECD machine.

Index Terms—Programming language theory, lambda calculus, first-class continuation, abstract machine.

[PDF]

Cite: Shin-Ya Nishizaki, Kensuke Narita, Tomoyuki Ueda, "Simplification of Abstract Machine for Functional Language and Its Theoretical Investigation," Journal of Software vol. 10, no. 10, pp. 1148-1159, 2015.