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

一个交互式可实现性的单子框架

A Monadic Framework for Interactive Realizability

Giovanni Birolo

摘要:

我们给出了一个新的介绍互动的可实现性与更明确的语法。交互式可实现性是一种可实现性语义,它将Curry-Howard对应扩展到(次)经典逻辑,更确切地说,扩展到一阶直觉算术(Heyting Arithmetic),该算术由排除中间法则扩展到简单的存在公式,这是一个由其在证明挖掘中的应用所激发的系统。Monad可以通过提供一种干净和模块化的方式来包含纯函数式语言中的不纯功能来构建函数式程序。我们表示交互式实现器的抽象框架,适用于一元的方法在函数式编程修改的可实现性,以获得更“宽松”的可实现性的概念,是适合于经典逻辑。特别是,我们使用的状态和异常单子的组合,以捕捉从错误中学习的交互式实现者在语法层面上的性质。

英文摘要:

We give a new presentation of interactive realizability with a more explicit syntax. Interactive realizability is a realizability semantics that extends the Curry-Howard correspondence to (sub-)classical logic, more precisely to first-order intuitionistic arithmetic (Heyting Arithmetic) extended by the law of the excluded middle restricted to simply existential formulas, a system motivated by its applications in proof mining. Monads can be used to structure functional programs by providing a clean and modular way to include impure features in purely functional languages. We express interactive realizers by means of an abstract framework that applies the monadic approach used in functional programming to modified realizability, in order to obtain more "relaxed" realizability notions that are suitable to classical logic. In particular we use a combination of the state and exception monads in order to capture the learning-from-mistakes nature of interactive realizers at the syntactic level.

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

↑