Soichiro Fujii 0001

dblp:26/11441-1 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
3since 2021 · last 2026
0000-0002-4109-3472ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 3 first-author · 3 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author
YearPublicationVenuePosition
2026 Monads and Distributive Laws in Substructural Contexts
abstract
We present a categorical theory of monads and distributive laws in substructural contexts. In the study of distributive laws, the roles of (the absence of) structural rules for variable contexts have been recognized; our theory formalizes these substructural situations using Tronin’s verbal categories W, in a uniform and presentation-independent manner. We introduce the classes of W-operadic monads (those defined via the structural rules in W) and of W-commutative monads (those invariant under the structural rules in W). We give a canonical construction of a distributive law ST → TS of monads on Set; it is applicable when S is W-operadic and T is W-commutative (under mild conditions). This accounts for many known and new distributive laws. Even when S fails to be W-operadic, we can refine S and force W-operadicity; this captures Varacca and Winskel’s construction of indexed valuations.
Soichiro Fujii 0001, Yun Chen Tsai, Yoàv Montacute, Ichiro Hasuo
LICS1
2022 Algorithms for Coloring Reconfiguration Under Recolorability Digraphs
Soichiro Fujii 0001, Yuni Iwamasa, Kei Kimura, Akira Suzuki 0001
ISAAC1
2022 Hom weak ω-categories of a weak ω-category
abstract
Abstract Classical definitions of weak higher-dimensional categories are given inductively, for example, a bicategory has a set of objects and hom categories, and a tricategory has a set of objects and hom bicategories. However, more recent definitions of weak n-categories for all natural numbers n, or of weak $\omega$ -categories, take more sophisticated approaches, and the nature of the ‘hom is often not immediate from the definitions’. In this paper, we focus on Leinster’s definition of weak $\omega$ -category based on an earlier definition by Batanin and construct, for each weak $\omega$ -category $\mathcal{A}$ , an underlying (weak $\omega$ -category)-enriched graph consisting of the same objects and for each pair of objects x and y, a hom weak $\omega$ -category $\mathcal{A}(x,y)$ . We also show that our construction is functorial with respect to weak $\omega$ -functors introduced by Garner.
Thomas Cottrell, Soichiro Fujii 0001
Math. Struct. Comput. Sci.2
2016 Towards a Formal Theory of Graded Monads
Soichiro Fujii 0001, Shin-ya Katsumata, Paul-André Melliès
FoSSaCS1