CPS 层次中定界续延的操作基础
An Operational Foundation for Delimited Continuations in the CPS Hierarchy
AI总结：
本文为扩展了 shift/reset 控制算子的 lambda-calculus 提出抽象机和归约语义，以支持 CPS 层次中的定界续延，并展示其在列表前缀查找和求值归一化中的新应用。
摘要：
我们提出了一种抽象机和归约语义，用于扩展了控制算子的 lambda-calculus，这些控制算子可访问 CPS 层次中的定界续延。该抽象机由续延传递风格（CPS）的求值器导出；归约语义（即带有求值上下文显式表示的小步操作语义）由该抽象机构造而成；控制算子为 shift 和 reset 家族。我们还提出了 CPS 层次中定界续延的新应用：查找列表前缀以及针对单元和积的层次语言的求值归一化。
英文摘要：
We present an abstract machine and a reduction semantics for the lambda-calculus extended with control operators that give access to delimited continuations in the CPS hierarchy. The abstract machine is derived from an evaluator in continuation-passing style (CPS); the reduction semantics (i.e., a small-step operational semantics with an explicit representation of evaluation contexts) is constructed from the abstract machine; and the control operators are the shift and reset family. We also present new applications of delimited continuations in the CPS hierarchy: finding list prefixes and normalization by evaluation for a hierarchical language of units and products.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
