Interaction between polymorphic operation arities and parameter annotations

Determine how universally quantified operation arities interact with parameter annotations in Cambria, including the additional annotations required to preserve type-inference completeness when operation arities are polymorphic.

Background

Cambria’s relevant completeness theorem relies on operation arities being monomorphic: only operations whose arities mention newly introduced parameters need annotations. The calculus currently excludes universal quantification in operation arities because the stated annotation result would not hold in that setting.

The paper notes that extending the system to polymorphic arities would require additional annotations, but does not characterize those annotations or establish a corresponding completeness theorem.