You're reading the public-facing archive of the Category Theory Zulip server.
To join the server you need an invite. Anybody can get an invite by contacting Matteo Capucci at name dot surname at gmail dot com.
For all things related to this archive refer to the same person.
In section 9 of https://arxiv.org/abs/2106.02706 it is written that algebraic patterns and "polynomial" monads are a special case of their framework of -pretheories and -nervous monads. However, they use as and generally the inclusion of in is not ff, whereas their framework always assumes is a full subcategory of . This shows up pretty obviously in one of the examples, the monad on , where is the category of finite sets and injections, which is not a full subcategory of . Elsewhere in the paper (Theorem 8.7) they show the monad is -nervous, but it's not very clear how to extend this kind of treatment nicely to all algebraic patterns.
On the other hand, one asks, does one even need to do that? Examining the main theorems of the article I was unable to really find any uses of the assumption of fullness. Is it actually fine to just reject this assumption and use non-full dense functors to construct pretheories? And if not, what is a good way to obtain a suitable eso functor from an algebraic pattern?
I can't speak for the higher dimensional setting, but for monad--theory correspondences in the one-dimensional setting, full faithfulness is essentially never necessary. However, given a dense functor , if we take the fully faithful part of the full image factorisation, it will also be dense (e.g. by Proposition 5.11 of Kelly's Basic Concepts), and theories relative to this functor are equivalent to theories relative to the original functor. I expect the same is true for -categories.