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

迈向高阶双代数指称语义

Towards a Higher-Order Bialgebraic Denotational Semantics

University of Birmingham(伯明翰大学);University of Southern Denmark(南丹麦大学);Friedrich-Alexander-Universität Erlangen-Nürnberg(埃尔朗根-纽伦堡大学)

Sergey Goncharov, Marco Peressotti, Stelios Tsampas, Henning Urbat, Stefano Volpe

AI总结:

本文发展了高阶抽象GSOS中的适当指称语义理论,通过局部终余代数构造语义域,解耦于语法,适用于多种高阶语言。

摘要:

Turi和Plotkin的双代数抽象GSOS框架为编程和进程语言的操作语义与指称语义建模提供了一种优雅的范畴论方法。在抽象GSOS中,互模拟总是一个同余关系,并且与指称等价一致。这使语言设计者免于为建立这些性质而进行复杂的、特设的推理。最近,抽象GSOS风格的操作语义的双代数视角已扩展到高阶语言,保留了互模拟的组合性。然而,根据Turi和Plotkin最初设想,对双代数指称语义的范畴论理解在高阶设置中一直缺失。在本文中,我们发展了高阶抽象GSOS中的适当指称语义理论。指称模型在适当选择的语义域上是参数化的,该语义域以行为双函子的局部终余代数的形式出现,其构造与语言的语法完全解耦。我们的方法涵盖了现有的指称语义描述,例如通过通用步进索引构建的语义域(之前是针对每种语言引入的),并且被证明适用于各种不同的高阶语言,例如简单类型和无类型语言,或具有计算效应(如概率或非确定性分支)的语言。

英文摘要:

The bialgebraic abstract GSOS framework by Turi and Plotkin provides an elegant categorical approach to modelling the operational and denotational semantics of programming and process languages. In abstract GSOS, bisimilarity is always a congruence, and it coincides with denotational equivalence. This saves the language designer from intricate, ad-hoc reasoning to establish these properties. The bialgebraic perspective on operational semantics in the style of abstract GSOS has recently been extended to higher-order languages, preserving compositionality of bisimilarity. However, a categorical understanding of bialgebraic denotational semantics according to Turi and Plotkin's original vision has so far been missing in the higher-order setting. In the present paper, we develop a theory of adequate denotational semantics in higher-order abstract GSOS. The denotational models are parametric in an appropriately chosen semantic domain in the form of a locally final coalgebra for a behaviour bifunctor, whose construction is fully decoupled from the syntax of the language. Our approach captures existing accounts of denotational semantics such as semantic domains built via general step-indexing, previously introduced on a per-language basis, and is shown to be applicable to a wide range of different higher-order languages, e.g. simply typed and untyped languages, or languages with computational effects such as probabilistic or non-deterministic branching.

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

↑