科研之友
微信
新浪微博
Facebook
分享链接
摘要
We give a framework for delimited control with multiple prompts, in the style of Parigot's lambda gamma-calculus, through a series of incremental extensions by starting with the pure lambda-calculus. Each language inherits the semantics and reduction theory of its parent, giving a systematic way to describe each level of control. For each language of interest, we fully characterize its semantics in terms of a reduction semantics, operational semantics, continuation-passing style transform, and abstract machine. Furthermore, the control operations are expressed in terms of fine-grained primitives that can be used to build well-known, higher-level control operators. In order to illustrate the expressive power provided by various languages, we show how other computational effects can be encoded in terms of these control operators.
- 出版日期2014-1
