Commit 4faa7d19 authored by Giuseppe Castagna's avatar Giuseppe Castagna
Browse files

typos

parent 5babaf02
...@@ -4,8 +4,8 @@ not make use of type schemes and is, therefore, incomplete w.r.t. the ...@@ -4,8 +4,8 @@ not make use of type schemes and is, therefore, incomplete w.r.t. the
system of Section~\ref{sec:static}. In particular, as we system of Section~\ref{sec:static}. In particular, as we
explained in Section~\ref{ssec:algorithm}, in the absence of type explained in Section~\ref{ssec:algorithm}, in the absence of type
schemes it is not always possible to prove that $\forall v, \forall t, schemes it is not always possible to prove that $\forall v, \forall t,
v \in t \text{~or~} v \not\in \lnot t$. Since this is property does v \in t \text{~or~} v \not\in \lnot t$. Since this property cease
not hold only for $\lambda$-expressions, then not using type schemes to hold only for $\lambda$-expressions, then not using type schemes
yields less precise typing only for tests $\ifty{e}t{e_1}{e_2}$ where $e$ yields less precise typing only for tests $\ifty{e}t{e_1}{e_2}$ where $e$
has a functional type, that is the value tested will be a $\lambda$ has a functional type, that is the value tested will be a $\lambda$
abstraction This seems like a reasonable compromise between the abstraction This seems like a reasonable compromise between the
......
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