Commit be341e87 authored by Giuseppe Castagna's avatar Giuseppe Castagna
Browse files

online

parent 6ba8c397
......@@ -392,7 +392,7 @@ unneeded:
prove type preservation.
On the same vein we studied type-schemes to have the most
general possible case that give the strongest partial
general possible case which gives the strongest partial
completeness result, and gives a framework where possible
different algorithmic solutions can be found.
\end{answer}
......@@ -415,9 +415,10 @@ unneeded:
helps to understand why the parameter \texttt{n\_0} introduced
in the algorithmic type system is required for the
completeness. In a sense, it is similar to the use of type
schemes in our algorithmic type system: it makes our
schemes in our algorithmic type system: as we explained in the
preceding answer, it makes our
algorithmic type system more complex but also more complete
regarding to the declarative one.
with respect to the declarative one.
Then, once these formal results have been established and that
the role of type schemes and \texttt{n\_0} are understood, we
......@@ -426,9 +427,9 @@ unneeded:
imply that a value of \texttt{n\_0\ =\ 1} is enough in practice, and we agree with this.
Maybe we should add this remark in the paper? We already say that
choosing \texttt{n\_0\ =\ 2*depth} seems enough, but we could also say
that \texttt{n\_0\ =\ 1} is enough in most cases.
% Maybe we should add this remark in the paper? We already say that
% choosing \texttt{n\_0\ =\ 2*depth} seems enough, but we could also say
% that \texttt{n\_0\ =\ 1} is enough in most cases.
\end{answer}
\end{itemize}
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment