Commit 73f7dcf6 authored by Giuseppe Castagna's avatar Giuseppe Castagna
Browse files

finished final revision

parent deafed1b
......@@ -68,7 +68,12 @@ refining the occurrence typing. If it exists, then
we find a type substitution $\sigma_\circ$ such that $t^\circ\leq
t\sigma_\circ$ and we refine for the
positive branch the types of $x_1$, of $x_2$, and of $x_1x_2$ by applying $\sigma_\circ$ to their types. While the
idea is clear (see Appendix~\ref{app:roadmap} for a more detailed explanation),
idea is clear%
\iflongversion%%%%%%%%%%%%%%%%%%%
,
\else%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\ (see \Appendix\ref{app:roadmap} for a more detailed explanation),
\fi%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
the technical details are quite involved, especially if we also want
functions with intersection types and/or gradual
typing. Nevertheless, our approach has an edge on systems that do not
......
......@@ -261,7 +261,11 @@ The authors thank Paul-André Melliès for his help on type ranking.
\newpage
\iflongversion\else%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\iflongversion%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\end{document}
\else%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\section{Record types operators}\label{app:recop}
\input{record_operations}
\newpage
......@@ -270,9 +274,8 @@ The authors thank Paul-André Melliès for his help on type ranking.
\section{A more precise rule for inference}\label{app:optimize}
In our prototype we have implemented for the inference of arrow type the following rule:
\input{optimize}
\fi%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\end{document}
\newpage
\section{A Roadmap to Polymorphic Types}
......@@ -280,9 +283,5 @@ In our prototype we have implemented for the inference of arrow type the followi
\input{roadmappolymorphism}
\end{document}
\fi%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
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