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

按值传递(Call-by-Push-Value)的抽象操作方法

Abstract Operational Methods for Call-by-Push-Value

Sergey Goncharov, Stelios Tsampas, Henning Urbat

AI总结:

本文在预层范畴和高阶抽象GSOS框架下为按值传递及细粒度按值调用语言开发模块化的程序等价推理方法,将关键同余性质归约为简单语法条件,显著降低语言扩展的证明开销。

摘要:

Levy 的按值传递(call-by-push-value)是一种综合性的编程范式,它结合了函数式编程和命令式编程的元素,支持计算效应,并同时涵盖按值调用(call-by-value)和按名调用(call-by-name)两种求值策略。在本工作中,我们开发了模块化方法来推理按值传递(call-by-push-value)以及细粒度按值调用(fine-grain call-by-value)中的程序等价性,后者是前者的一种流行的轻量级按值调用子语言。我们的方法基于一个基本观察:有序集合(sorted sets)的预层范畴(presheaf categories)是建模按值(推)传递语言的合适宇宙,并且可以在其中发展自然的、余代数式的程序等价概念,例如应用相似性(applicative similarity)和逻辑关系(logical relations)。从这一观察出发,我们在高阶抽象 GSOS 框架中形式化了细粒度按值调用和按值传递,利用现有理论将其关键同余性质归约为简单的语法条件,并论证了对任一语言引入改动只会产生极小的证明开销。

英文摘要:

Levy's call-by-push-value is a comprehensive programming paradigm that combines elements from functional and imperative programming, supports computational effects and subsumes both call-by-value and call-by-name evaluation strategies. In the present work, we develop modular methods to reason about program equivalence in call-by-push-value, and in fine-grain call-by-value, which is a popular lightweight call-by-value sublanguage of the former. Our approach is based on the fundamental observation that presheaf categories of sorted sets are suitable universes to model call-by-(push)-value languages, and that natural, coalgebraic notions of program equivalence such as applicative similarity and logical relations can be developed within. Starting from this observation, we formalize fine-grain call-by-value and call-by-push-value in the higher-order abstract GSOS framework, reduce their key congruence properties to simple syntactic conditions by leveraging existing theory and argue that introducing changes to either language incurs minimal proof overhead.

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

↑