Skip to content
Preprint

Typed Flexible-Arity Slotted E-Graphs: A Soundness Construction and an Alloy Case Study

Sep 2026 · 0 citations · 22 references
Computer Science

TL;DR

A generic finite quotient presentation proves exactness of its least-orbit normal form, while certified records specify effective-support kernel extraction and collision and abstract obligation traces carrying local endpoint certificates prove finite-unfolding equational soundness.

Abstract

Slotted e-graphs represent open terms modulo consistent renaming, while algebraic operators benefit from canonical sequence, bag, or set children. We compose the two at a specification level: typed slot-mapped invocations inhabit operator-declared ports whose sibling quotient and recursive flattening licenses are certified separately. A generic finite quotient presentation proves exactness of its least-orbit normal form, while certified records specify effective-support kernel extraction and collision. For abstract obligation traces carrying local endpoint certificates, we prove finite-unfolding equational soundness. An Alloy case study compares seven related pipeline arms on a frozen corpus and a controlled transformation suite.

View source

Similar papers

Preprint Aug 2026

Towards a Deductive Verification Infrastructure for Weighted Programming

This work presents a deductive verification framework based on a weighted assertion language and an intermediate verification language, whose weight domains are ordered structures with implication and coimplication, which let verification conditions express lower- and upper-bound obligations internally.

Emma Ahrens, Samuel Rode, Philipp Schröer et al. · 0 citations

Generators - Deferred Evaluation in XPath 4

XPath lacks an explicitly-specified portable mechanism for processing large, unbounded, or externally sourced data without full materialization. The paper addresses this limitation by introducing generators as a first-class abstraction for deferred evaluation in XPath 4. Generators are represented as immutable records...

Dimitre Novatchev · 0 citations
Preprint Aug 2026

Pushout Attachments and Conditional Complexity of Executable Models

We represent the modular enlargement of an executable model by a pushout of finite typed presentations. Adhesivity preserves the original model and recovers the shared interface, while chosen pushouts make linking functorial and coproducts describe parallel attachments. A semantic comparison gives a precise criterion f...

Alexander Kolpakov · 0 citations
Preprint Aug 2026

Abstract Compilation as Abstraction of Operator Semantics, applied to Cost Analysis

This work develops higher-order abstract domains for functions, operators, and programs themselves, in which composition is the key novel primitive, together with a categorical framework for constructing sound, precise, and modular abstract compilers.

Louis Rustenholz, Alessio Mansutti, Pedro López-García et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.