概率调用按推值
Probabilistic call by push value
AI总结：
本文提出Call-By-Push-Value的概率扩展，在概率相干空间模型中解释，并证明其适当性与完全抽象性。
摘要：
我们引入了Levy的Call-By-Push-Value的概率扩展。该扩展仅在于添加一个“掷硬币”的布尔闭合原子表达式。该语言可被理解为Scott的PCF的一个重大推广，同时涵盖按名调用和按值调用，并具有递归（可能是惰性的）数据类型。我们在先前引入的概率相干空间（一种完全经典线性逻辑的范畴模型）的指称模型中解释该语言，将数据类型解释为资源余模态的余代数。我们证明了适当性和完全抽象性，将早期结果推广到更现实、更强大的编程语言。
英文摘要：
We introduce a probabilistic extension of Levy's Call-By-Push-Value. This extension consists simply in adding a " flipping coin " boolean closed atomic expression. This language can be understood as a major generalization of Scott's PCF encompassing both call-by-name and call-by-value and featuring recursive (possibly lazy) data types. We interpret the language in the previously introduced denotational model of probabilistic coherence spaces, a categorical model of full classical Linear Logic, interpreting data types as coalgebras for the resource comonad. We prove adequacy and full abstraction, generalizing earlier results to a much more realistic and powerful programming language.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
