Substitution for Non-Wellfounded Syntax with Binders Through Monoidal Categories - Fiabilité des Systèmes et des Logiciels
Conference Papers Year : 2024

Substitution for Non-Wellfounded Syntax with Binders Through Monoidal Categories

Abstract

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 takes place in category theory, notably by using monoidal categories and strong functors between them. A language is specified by a multi-sorted binding signature, say Σ. First, we provide sufficient criteria for Σ to generate a language of possibly infinite terms, through ω-continuity. Second, we construct a monadic substitution operation for the language generated by Σ. A cornerstone in this construction is a mild generalization of the notion of heterogeneous substitution systems developed by Matthes and Uustalu; such a system encapsulates the necessary corecursion scheme for implementing substitution. The results are formalized in the Coq proof assistant, through the UniMath library of univalent mathematics.
Fichier principal
Vignette du fichier
LIPIcs.FSCD.2024.25.pdf (925.61 Ko) Télécharger le fichier
Origin Publication funded by an institution
licence

Dates and versions

hal-04642448 , version 1 (09-07-2024)

Licence

Identifiers

Cite

Ralph Matthes, Kobe Wullaert, Benedikt Ahrens. Substitution for Non-Wellfounded Syntax with Binders Through Monoidal Categories. 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024), Jul 2024, Tallinn, Estonia. pp.25:1-25:22, ⟨10.4230/LIPIcs.FSCD.2024.25⟩. ⟨hal-04642448⟩
279 View
45 Download

Altmetric

Share

More