Hello all,
To confirm what others have said about my construction:
As Andras and Jon noted, it remains open whether the construction can be extended to reduce higher inductive-inductive types to higher inductive types, but I am hopeful that it can, at least in a situation such as CTT where the eliminator computes on path constructors.
As Matt noted, the general recursive-recursive eliminator is both essential (for proving initiality, for example) and missing. This is the same restriction as on the construction in extensional type theory (or using UIP) given by Nordvall Forsberg. The main obstacle I see to getting the general recursive-recursive eliminator is that the simple eliminator is not strict, but only computes up to a path. I think I see a way to turn a strict simple eliminator into a general eliminator, but this is still conjectural.
To summarize my understanding of the original question, QIITs are an obvious subset of HIITs, and we know how to handle many HITs primitively in cubical type theory, but the extension to primitive HIITs in cubical type theory has not been done, nor does my construction immediately allow reducing HIITs to HITs (and even if extended lacks strictness and generality of the eliminator).
Best regards,
- Jasper Hugunin