Formalizing Monoidal Categories and Actions for Syntax with Binders
Benedikt Ahrens, Ralph Matthes, Kobe Wullaert
TL;DR
This paper explores formalizing monoidal categories and their actions within the UniMath library using Coq, highlighting how Coq's features influence the development of syntax and semantics for languages with binders.
Contribution
It demonstrates the formalization of monoidal categories and actions in UniMath, providing insights into how Coq's type theory aids in understanding complex categorical structures.
Findings
Coq's decidable typechecking facilitates formalization
The work clarifies the role of monoidal categories in syntax with binders
Mechanization reveals theoretical insights into categorical semantics
Abstract
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 type-theoretic proof assistant with decidable typechecking) made us use more theory or helped us to see theory more clearly.
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.