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

coFJ中的声正则协递归

Sound Regular Corecursion in coFJ

Davide Ancona, Pietro Barbieri, Francesco Dagnino, Elena Zucca

摘要:

本文的目的是提供一个坚实的基础,原生支持创建和操作循环数据结构的编程范式。为此,我们描述了coFJ,一个类似Java的演算,其中对象可以是无限的,方法配备了一个codefinition(替代体)。我们提供了一个抽象的演算语义的基础上的框架推理系统与corules。在这种语义的coFJ中,有限对象上的FJ递归方法也可以扩展到无限对象,并且通过指定一个codefinition,可以按照程序员的期望进行操作。我们还描述了一个操作语义,它可以直接实现在一个程序设计语言,并证明了这样的语义相对于抽象的合理性。

英文摘要:

The aim of the paper is to provide solid foundations for a programming paradigm natively supporting the creation and manipulation of cyclic data structures. To this end, we describe coFJ, a Java-like calculus where objects can be infinite and methods are equipped with a codefinition (an alternative body). We provide an abstract semantics of the calculus based on the framework of inference systems with corules. In coFJ with this semantics, FJ recursive methods on finite objects can be extended to infinite objects as well, and behave as desired by the programmer, by specifying a codefinition. We also describe an operational semantics which can be directly implemented in a programming language, and prove the soundness of such semantics with respect to the abstract one.

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

↑