Finitary Semantics for Full Ground Local State

2026-08-21

AI Summary

研究解决了全基本地状态（FGLS）的有限性问题，通过证明其非有限性并引入一个有限子单子来提供合适的语义。

Abstract

Full ground local state (FGLS) refers to dynamically allocated mutable state that allows storing ground values and references. It is a key ingredient in many imperative algorithms as it enables (cyclic) data structures. In this work, we treat full ground local state as a computational effect, focusing on one particular denotational model: Kammar et al.'s possible worlds monad on sets indexed over sets of locations. We resolve an outstanding question regarding this FGLS monad: is it finitary? We show that the FGLS monad is not finitary by showing the existence of non-finitary computations in the monad. We then introduce a finitary submonad of Kammar et al.'s monad, give it a concrete description and show that it provides an adequate semantics for FGLS. The submonad we construct paves the way to understanding FGLS in the future via an equational axiomatization suitable for program reasoning.

Problem

• Full Ground Local State
• finitary
• denotational model
• computational effect
• possible worlds monad

Innovation

• finitary submonad
• full ground local state (FGLS)
• denotational semantics
• program reasoning