arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.04455cs.PLcs.LO
收藏

在守护类型论中建模递归与概率选择

Modelling Recursion and Probabilistic Choice in Guarded Type Theory

Philipp Jan Andries Stassen, Rasmus Ejlers Møgelberg, Maaike Zwart, Alejandro Aguirre, Lars Birkedal

AI总结:

本文在守护类型论中利用高阶归纳类型和守护递归建模带概率选择与递归类型的语言,并建立操作与指称语义间的关系以支持充分性和上下文等价推理。

摘要:

构造性类型论将逻辑与程序设计结合在一种语言中。这既有助于对类型论中编写的程序进行推理,也有助于在类型论内部对其他编程语言进行推理。众所周知,将这些应用扩展到具有递归和概率选择等计算效果的语言是困难的,因为这些特性不易在构造性类型论中表示。我们展示了如何在守护类型论中定义并推理一种具有概率选择和递归类型的编程语言。我们使用高阶归纳类型来表示有限分布,并使用守护递归来建模递归。我们定义了操作语义和指称语义,以及二者之间的关系。该关系可用于证明充分性,但我们也展示了如何利用它来在上下文等价的意义上对程序进行推理。

英文摘要:

Constructive type theory combines logic and programming in one language. This is useful both for reasoning about programs written in type theory, as well as for reasoning about other programming languages inside type theory. It is well-known that it is challenging to extend these applications to languages with recursion and computational effects such as probabilistic choice, because these features are not easily represented in constructive type theory. We show how to define and reason about a programming language with probabilistic choice and recursive types, in guarded type theory. We use higher inductive types to represent finite distributions and guarded recursion to model recursion. We define both operational and denotational semantics, as well as a relation between the two. The relation can be used to prove adequacy, but we also show how to use it to reason about programs up to contextual equivalence.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑