Commit 70a43e94 authored by Giuseppe Castagna's avatar Giuseppe Castagna
Browse files

rewording

parent a06aa2ef
......@@ -98,7 +98,7 @@ inference). Second, the result of our analysis can be used to infer
intersection types for functions, even in the absence of precise type
annotations such as the one in the definition of \code{foo} in~\eqref{foo2}: to put it simply, we are able to
infer the type~\eqref{eq:inter} for the unannotated pure JavaScript code of \code{foo}. Third, we
show how to combine occurrence typing with gradual typing, and in
show how to combine occurrence typing with gradual typing, in
particular how the former can be used to optimize the compilation of
the latter.
......@@ -201,7 +201,7 @@ particular if the static type of $e'$ is an intersection of
arrows). Additionally, we can repeat the reasoning for all subterms of $e'$
and $e''$ as long as they are applications, and deduce distinct types for all subexpressions of $e$ that
form applications. How to do it precisely---not only for applications, but also for other terms such as pairs, projections, records etc---is explained in the rest of
the paper but the key ideas are pretty simple and are explained next.
the paper but the key ideas are pretty simple and are presented next.
\subsection{Key ideas}\label{sec:ideas}
......
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