POPL 2023 (series) / CoqPL 2023 (series) / The Ninth International Workshop on Coq for Programming Languages /
Formalizing Monoidal Categories and Actions for Syntax with Binders
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 type-checking) made us use more theory or helped us to see theory more clearly.
Extended abstract (coqpl2023.pdf) | 388KiB |
Sat 21 JanDisplayed time zone: Eastern Time (US & Canada) change
Sat 21 Jan
Displayed time zone: Eastern Time (US & Canada) change
14:00 - 15:30 | |||
14:00 30mTalk | Verified Differential Privacy for Finite Computers CoqPL Vivien Rindisbacher Boston University, Arthur Azevedo de Amorim Boston University, Marco Gaboardi Boston University File Attached | ||
14:30 30mTalk | Formalizing Monoidal Categories and Actions for Syntax with Binders CoqPL Benedikt Ahrens TU Delft, The Netherlands, Ralph Matthes IRIT (CNRS and Univ. of Toulouse), Kobe Wullaert Technical University Delft File Attached | ||
15:00 30mTalk | Certifying Complexity Analysis CoqPL Clément Aubert Augusta University, Thomas Rubiano LIPN – UMR 7030 Université Sorbonne Paris Nord, Neea Rusch Augusta University, Thomas Seiller CNRS File Attached |