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

完全抽象免费

Full Abstraction for Free

Marco Paviotti, Nicolas Wu

摘要:

结构化递归模式,如折叠和展开已被广泛用于结构函数式程序和程序语义。在此上下文中,通常将指称语义实现为归纳数据类型上的折叠,以确保终止性和组合性。单独地,操作模型可以由展开给出,并且自然地不是所有操作模型都以有意义的方式与给定的指称语义一致。为了确保这些语义是一致的,重要的是要考虑与指称和操作模型相关的完全抽象的属性。在本文中,我们将展示如何设计一个组合语义,使完整的抽象免费。我们这样做,通过使用分配律,我们生成的操作和指称模型。分布律确保语义在类型级别上是完全抽象的,从而减轻了程序员的证明负担。

英文摘要:

Structured recursion schemes such as folds and unfolds have been widely used for structuring both functional programs and program semantics. In this context, it has been customary to implement denotational semantics as folds over an inductive data type to ensure termination and compositionality. Separately, operational models can be given by unfolds, and naturally not all operational models coincide with a given denotational semantics in a meaningful way. To ensure these semantics are coherent it is important to consider the property of full abstraction which relates the denotational and the operational model. In this paper, we show how to engineer a compositional semantics such that full abstraction comes for free. We do this by using distributive laws from which we generate both the operational and the denotational model. The distributive laws ensure the semantics are fully abstract at the type level, thus relieving the programmer from the burden of the proofs.

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

↑