arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1509.04040cs.PL
收藏

作为证明的程序

Programs as proofs

Jørgen Steensgaard-Madsen

摘要:

Curry-Howard对应是关于类型和程序之间的关系,以及命题和证明之间的关系。程序设计语言设计和程序验证的含义是一个活跃的研究领域。将介绍结合定义计算和应用程序的内部定义的类似转换器的语义。通过对给定的定义计算进行专门化,可以导出用于定义操作的应用的推理规则。通过对每个操作的这种语义,每个应用程序都在由程序设计语言定义的逻辑中识别出一个公理,因此一种语言可以被认为是一种理论。

英文摘要:

The Curry-Howard correspondence is about a relationship between types and programs on the one hand and propositions and proofs on the other. The implications for programming language design and program verification is an active field of research. Transformer-like semantics of internal definitions that combine a defining computation and an application will be presented. By specialisation for a given defining computation one can derive inference rules for applications of defined operations. With semantics of that kind for every operation, each application identifies an axiom in a logic defined by the programming language, so a language can be considered a theory.

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

↑