Formal Reasoning about Layered Monadic Interpreters
summary
Extends the Coq interaction trees (ITrees) library to characterize a class of interpretable monads obtained by applying monad transformers to ITrees, gives generic lifting of interpreters through those transformers, and proves preservation of iteration and structural laws so equivalences compose. Provides typeclasses, instances and tactics that cut large boilerplate, supports heterogeneous relational reasoning via equivalence of monads up to R, and ships evaluated artifacts used in a Vellvm LLVM IR compiler‑correctness case study.
AI-written summary · about