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

一种支持透明和不透明概率计算的依赖类型系统

A Strongly Normalising System of Dependent Types for Transparent and Opaque Probabilistic Computation

Department of Philosophy and Education Sciences, University of Turin(都灵大学哲学与教育科学学院)

Francesco A. Genco

AI总结:

本文提出一种依赖类型系统,支持透明和不透明概率计算,并通过类型系统形式化可信性概念。

摘要:

我们定义了一个带有依赖类型的lambda演算扩展,使我们能够编码透明和不透明的概率程序,并通过可归约性技术证明其强归约性结果。虽然透明非确定性程序通常通过常规技术进行形式化,但不透明非确定性程序则通过在语法中引入Oracle常量来形式化,其行为由Oracle函数控制。这些函数的通用性和其值由包含相对Oracle的整个术语形式决定,也使我们能够模拟学习行为。然后我们扩展了该演算,以定义计算可信性谓词。该演算的扩展不仅使我们能够精确形式化可信性的概念并编码测试程序所需的过程,还通过类型系统对程序相对于可信性的行为进行推理。

英文摘要:

We define an extension of lambda-calculus with dependents types that enables us to encode transparent and opaque probabilistic programs and prove a strong normalisation result for it by a reducibility technique. While transparent nondeterministic programs are formalised by rather usual techniques, opaque nondeterministic programs are formalised by introducing in the syntax oracle constants, the behaviour of which is governed by oracular functions. The generality of these functions and the fact that their values are determined by the form of the whole term inside which the relative oracle occurs also enable us to simulate learning-like behaviours. We then extend the calculus in order to define a computational trustworthiness predicate. The extension of the calculus does not only enable us to precisely formalise a notion of trustworthiness and to encode the procedures required to test it on programs, but also to reason, by means of the type system, on the behaviour of programs with respect to trustworthiness.

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

↑