论文标题
概率软类型分配
Probabilistic Soft Type Assignment
论文作者
论文摘要
我们以隐式计算复杂性风格对随机复杂性类建模。我们介绍了PSTA，这是STA的概率版本，STA是软线性逻辑的类型理论对应物。 PSTA是Simpson线性Lambda演算及其表面降低的扩展的类型分配，线性添加剂表示随机选择。线性添加剂比通常的添加剂弱。它们允许复制无害影响归一化的计算成本。 PSTA是合理的，完整的W.R.T.概率多项式时间函数并表征了概率复杂性类PP和BPP，后者的隐式程度略低于PP。
We model randomized complexity classes in the style of Implicit Computational Complexity. We introduce PSTA, a probabilistic version of STA, the type-theoretical counterpart of Soft Linear Logic. PSTA is a type assignment for an extension of Simpson's Linear Lambda Calculus and its surface reduction, where Linear additives express random choice. Linear additives are weaker than the usual ones; they allow for duplications harmlessly affecting the computational cost of normalization. PSTA is sound and complete w.r.t. probabilistic polynomial time functions and characterizes the probabilistic complexity classes PP and BPP, the latter slightly less implicitly than PP.
