Arenas, Cyclic Terms, and Flat Equational Systems

This article discusses integrating loopy infinite streamy things into e-graphs, focusing on cyclic terms (co-terms/rational terms) and their representation using arenas. It covers the transition from basic term datatypes to arena-based representations, removing acyclicity constraints to handle recursive equations. The author references related work by Cheng Zhang, Sam Coward, and Alexandra Silva, and touches on interpreting, rewriting, storing, and extracting cyclic terms in e-graphs. The content is technical, targeting readers interested in programming language theory, formal methods, and graph-based rewriting systems.