The Internal Operads of Combinatory Algebras
Electronic Notes in Theoretical Informatics and Computer Science · 2023
DOI: 10.46298/entics.10338 ↗Kurz gefasst
Fachartikel in der Zeitschrift Electronic Notes in Theoretical Informatics and Computer Science, 2023. Verfasst von Masahito Hasegawa. Die Arbeit wurde bisher 2-mal zitiert (Crossref). Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
We argue that operads provide a general framework for dealing with polynomials and combinatory completeness of combinatory algebras, including the classical $\mathbf{SK}$-algebras, linear $\mathbf{BCI}$-algebras, planar $\mathbf{BI}(\_)^\bullet$-algebras as well as the braided $\mathbf{BC^\pm I}$-algebras. We show that every extensional combinatory algebra gives rise to a canonical closed operad, which we shall call the internal operad of the combinatory algebra. The internal operad construction gives a left adjoint to the forgetful functor from closed operads to extensional combinatory algebras. As a by-product, we derive extensionality axioms for the classes of combinatory algebras mentioned above.
Zitieren
APA
Hasegawa, M. (2023). The Internal Operads of Combinatory Algebras. Electronic Notes in Theoretical Informatics and Computer Science. https://doi.org/10.46298/entics.10338
Vancouver
Hasegawa M. The Internal Operads of Combinatory Algebras. Electronic Notes in Theoretical Informatics and Computer Science. 2023. doi:10.46298/entics.10338
BibTeX
@article{Hasegawa2023,
author = {Hasegawa, Masahito},
title = {The Internal Operads of Combinatory Algebras},
journal = {Electronic Notes in Theoretical Informatics and Computer Science},
year = {2023},
doi = {10.46298/entics.10338}
}
EUVIMED