Formalizing Monoidal Categories and Actions for Syntax with Binders
Programming Languages
2023-10-10 v2 Category Theory
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.
Keywords
Cite
@article{arxiv.2307.16270,
title = {Formalizing Monoidal Categories and Actions for Syntax with Binders},
author = {Benedikt Ahrens and Ralph Matthes and Kobe Wullaert},
journal= {arXiv preprint arXiv:2307.16270},
year = {2023}
}
Comments
Abstract for a talk at CoqPL 2023, https://popl23.sigplan.org/details/CoqPL-2023-papers/7/Formalizing-Monoidal-Categories-and-Actions-for-Syntax-with-Binders