\begin{theorem}[Completeness of the algorithmic type system for positive expressions]\label{completenessA}
If we restrict the language to positive expressions $e_+$,
the algorithmic type system without type schemes is complete.
TODO: states the inclusion between the regular type system and the one with type schemes
\begin{corollary}\label{app:completeness}
If we restrict the language to positive expressions $e_+$, the algorithmic type system is complete and type schemes can be removed from it (we can use regular types instead).