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


parent 7860dc9a
......@@ -208,7 +208,7 @@ the language, to cope with the possible presence of side effects (and
applications do not belong to this set since they can be be impure).
That said the very fact of focusing on truthy vs.\ false results may
make Kent's analysis fail even for pure Boolean tests where it would
be expected to work---e.g., if a result must be true rather than just truthy. For example, consider
be expected to work. For example, consider
the polymophic function that when applied to two integers returns
whether they have the same parity and false
otherwise: \code{have\_same\_parity:$(\Int\To\Int\To\Bool)\land(\neg\Int\To\ANY\To\False)\land(\ANY\To\neg\Int\To\False)$}. We
......@@ -324,6 +324,11 @@ comparing with {[}22{]} (see lines: ??-??)
More generally, we also went more in depth in the comparison with the
logical approach by THF, to highlight further limitations of our
approach as requested by the reviewers.
On the same vein we studied type-schemes to have the most general
possible case that give the strongest partial completeness result, and
gives a framework where possible different algorithmic solutions can
be found.
\item \textbf{Discussion of pure expressions:}
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