Logical aspect of Control Operators and Program Extraction

我们从逻辑的角度，通过需求评估和并行计算，研究了调用上下文中的定界控制算子。我们已经证明，某种逻辑(或功能逻辑)编程语言中的封装搜索可以通过按需要调用的函数式编程语言中的定界控制操作符来模拟。我们还证明了在适当的约束下，具有控制算子的并行程序设计语言具有透明的语义，这意味着增加或删除并行原语不会影响程序的意义。

We study delimited-control operators in the context of call by need evaluation and parallel computation from logical viewpoints. We have shown that, encapsulated search in a certain kind of logic (or functional logic) programming languages is simulated by delimited-control operators in call-by-need functional programming languages. We have also proved that under a suitable restriction, parallel programming languages with control operators have transparent semantics, which means that adding or eliminating parallel primitives has no impact on the meaning of programs.