In the blueprint, it is definition 5.0.6. The construction is here in the Poly package, but we haven't proven that the resulting map is exponentiable. A sketch of the proof is in Mark Weber's Polynomials in Categories with Pullbacks.
We need this to define the interpretation of Sigma types (here). It seems we do not need the isomorphism $P_{f▸g} ≅ P_f ∘ P_g$ (compFunctorIso), however (but it might be nice to add it anyway to have a more complete library of polynomial functor facts). (CC @u5943321)
In the blueprint, it is definition 5.0.6. The construction is here in the
Polypackage, but we haven't proven that the resulting map is exponentiable. A sketch of the proof is in Mark Weber's Polynomials in Categories with Pullbacks.We need this to define the interpretation of Sigma types (here). It seems we do not need the isomorphism$P_{f▸g} ≅ P_f ∘ P_g$ (
compFunctorIso), however (but it might be nice to add it anyway to have a more complete library of polynomial functor facts). (CC @u5943321)