单叶型理论中PCF的Scott模型
The Scott model of PCF in univalent type theory
摘要:
我们在单叶类型理论中发展了程序设计语言PCF的Scott模型。此外,我们以建设性和预测性的方式开展工作。为了解释PCF中的非终止性,我们使用了Topos理论中的提升单子(也称为部分映射分类器单子),该理论已被Escardó和Knapp扩展到单价类型理论。我们的结果表明,提升是一个可行的方法,在单叶型理论中。此外,我们表明,斯科特模型可以构建在一个预测性和建设性的设置。其他的方法要么需要某种形式的选择,要么需要商数归纳-归纳类型。我们表明,一个可以没有这些扩展。
英文摘要:
We develop the Scott model of the programming language PCF in univalent type theory. Moreover, we work constructively and predicatively. To account for the non-termination in PCF, we use the lifting monad (also known as the partial map classifier monad) from topos theory, which has been extended to univalent type theory by Escardó and Knapp. Our results show that lifting is a viable approach to partiality in univalent type theory. Moreover, we show that the Scott model can be constructed in a predicative and constructive setting. Other approaches to partiality either require some form of choice or quotient inductive-inductive types. We show that one can do without these extensions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。