A Categorical Framework for Program Semantics and Semantic Abstraction
Shin-ya Katsumata, Xavier Rival, J\'er\'emy Dubut

TL;DR
This paper introduces a categorical framework for abstract interpretation, modeling semantics as functors and abstractions as natural transformations, enabling structured reasoning about program properties.
Contribution
It extends functorial semantics to abstract interpretation by defining interpretations as oplax functors and abstractions as lax natural transformations.
Findings
Formalizes semantics as oplax functors in posets
Models abstraction relations as lax natural transformations
Provides examples from monadic semantics and discusses soundness
Abstract
Categorical semantics of type theories are often characterized as structure-preserving functors. This is because in category theory both the syntax and the domain of interpretation are uniformly treated as structured categories, so that we can express interpretations as structure-preserving functors between them. This mathematical characterization of semantics makes it convenient to manipulate and to reason about relationships between interpretations. Motivated by this success of functorial semantics, we address the question of finding a functorial analogue in abstract interpretation, a general framework for comparing semantics, so that we can bring similar benefits of functorial semantics to semantic abstractions used in abstract interpretation. Major differences concern the notion of interpretation that is being considered. Indeed, conventional semantics are value-based whereas…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · Logic, Reasoning, and Knowledge · Advanced Software Engineering Methodologies
