Showing cs.PLShow all
2 papers · 1 filter
cs.PL2023
Substitution for Non-Wellfounded Syntax with Binders through Monoidal Categories
Ralph Matthes, Kobe Wullaert, Benedikt Ahrens
We describe a generic construction of non-wellfounded syntax involving variable binding and its monadic substitution operation. Our construction of the syntax and its substitution…
cs.PL2023
Formalizing Monoidal Categories and Actions for Syntax with Binders
Benedikt Ahrens, Ralph Matthes, Kobe Wullaert
We discuss some aspects of our work on the mechanization of syntax and semantics in the UniMath library, based on the proof assistant Coq. We focus on experiences where Coq (as a t…