small modifications in the conclusion

conclusion.tex

@@ -6,7 +6,13 @@ casts inserted when compiling gradually-typed programs.
 One of the by-products of our work is the ability to define type
 predicates such as those used in \cite{THF10} as plain functions and
 have the inference procedure deduce automatically the correct
-overloaded function type.
+overloaded function type. More generally, our approach surpasses 
+current ones in that it can deduce precise (overloaded) types for
+functions that in all other approaches either require 
+the programmer to specify the full precise type (e.g., the
+function \code{foo} we defined in \eqref{foo} and \eqref{foo2}  in
+our introduction) or cannot be typed at all (the \code{and\_} and \code{xor\_} functions given
+in \eqref{and+} and \eqref{xor+} are the most eloquent examples).
 
 There is still a lot of work to do to fill the gap with real-world
 programming languages. For example, our analysis cannot handle flow of