文章基本信息

标题：Simplification of Abstract Machine for Functional Language and Its Theoretical Investigation
本地全文：下载
作者：Shin-Ya Nishizaki ; Kensuke Narita ; Tomoyuki Ueda 等
期刊名称：Journal of Software
印刷版ISSN：1796-217X
出版年度：2015
卷号：10
期号：10
页码：1148-1159
DOI：10.17706/jsw.10.10.1148-1159
出版社：Academy Publisher
摘要：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.
其他关键词：Programming language theory, lambda calculus, first-class continuation, abstract machine.