A simple abstract machine for functional first-class continuations

Narita, Keisuke; Nishizaki, Shin-ya; Mizuno, Takahisa

doi:10.1109/iscit.2010.5664903

Cited by 5 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The operating semantics defined in this paper is a small-step semantics based on Plotkin's [3]. In our previous papers [13] [14], we developed an operational semantics using abstract machines. We can provide another view by studying such an operational semantics.…”

Section: Resultsmentioning

confidence: 99%

Translation Style Semantics and Type System of Control Capturing

Matsumoto

Nishizaki

2015

Advances in Intelligent Systems Research

Self Cite

View full text Add to dashboard Cite

Many programming languages provides non-local exit. In C language, it is implemented by setjump and longjump functions in its standard library. In Java, a try-catch-finally statement is equipped as non-local exit with control capturing. The try-catch-finally mechanism can be categorized into two parts: global jump and control capturing. The non-local jump has been studied well for a long time by many researchers. On the other hand, control capturing has not yet been researched well enough. In this paper, we propose a lambda calculus with non-local jump and control capturing and its operational semantics based on small-step transition. We provide continuation-passing style translation of the calculus into the usual lambda calculus. The continuation-passing style translation is known as a translation style semantics of a control structure such as a non-local jump or first-class continuation. We extend the continuation passing style translation in order to formalize the control capturing in the framework of a functional programming language paradigm. We develop a type system for the calculus with control capturing and show conformity of the typed version of the CPS translation with the type system of the calculus.

show abstract

Section: Resultsmentioning

confidence: 99%

Translation Style Semantics and Type System of Control Capturing

Matsumoto

Nishizaki

2015

Advances in Intelligent Systems Research

Self Cite

View full text Add to dashboard Cite

show abstract

“…This paper is based on a previous version [11]. This work was supported by Grants-in-Aid for Scientific Research (C) (23400009).…”

Section: Acknowledgmentmentioning

confidence: 99%

Simplification of Abstract Machine for Functional Language and Its Theoretical Investigation

Nishizaki¹,

Narita²,

Ueda³

2015

JSW

Self Cite

View full text Add to dashboard Cite

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.

show abstract

A Parallel Abstract Machine for the RPC Calculus

Narita

Nishizaki

2011

Informatics Engineering and Information Science

View full text Add to dashboard Cite

A simple abstract machine for functional first-class continuations

Cited by 5 publications

References 11 publications

Translation Style Semantics and Type System of Control Capturing

Translation Style Semantics and Type System of Control Capturing

Simplification of Abstract Machine for Functional Language and Its Theoretical Investigation

A Parallel Abstract Machine for the RPC Calculus

Contact Info

Product

Resources

About