Weighted models for higher-order computation
Information and Computation(2020)
摘要
We study a class of quantitative models for higher-order computation: Lafont categories with (infinite) biproducts. Each of these has a complete “internal semiring” and can be enriched over its modules. We describe a semantics of nondeterministic PCF weighted over this semiring in which fixed points are obtained from the bifree algebra over its exponential structure. By characterizing them concretely as infinite sums of approximants indexed over nested finite multisets, we prove computational adequacy.
更多查看译文
关键词
Quantitative models,Complete semirings,Game semantics,Fixed points,Linear logic,Computational adequacy
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要