论文标题
逻辑伪代码：将算法与证明连接
Logical Pseudocode: Connecting Algorithms with Proofs
论文作者
论文摘要
证明（序列微积分，自然推论）和命令算法（伪动物）是两个众所周知的共存概念。那他们的关系是什么？我们的答案是 \ [命令\算法\ = \证明\ with \ cuts \] 该观察结果导致对伪码的概括，我们称之为{\ it逻辑伪编码}。它类似于自然的计算性逻辑\ cite {jap03，jap08}的证明。其中的每个语句都对应于自然推论的证明步骤。因此，对伪代码的优点是，相对于初始规范，每个语句都可以保证是正确且安全的。它也可以将其视为具有正向推理能力的可计算性逻辑Web（\ colw）的扩展。
Proofs (sequent calculus, natural deduction) and imperative algorithms (pseudocodes) are two well-known coexisting concepts. Then what is their relationship? Our answer is that \[ imperative\ algorithms\ =\ proofs\ with\ cuts \] This observation leads to a generalization to pseudocodes which we call {\it logical pseudocodes}. It is similar to natural deduction proof of computability logic\cite{Jap03,Jap08}. Each statement in it corresponds to a proof step in natural deduction. Therefore, the merit over pseudocode is that each statement is guaranteed to be correct and safe with respect to the initial specifications. It can also be seen as an extension to computability logic web (\colw) with forward reasoning capability.
