Skip to content
GitLab
Menu
Projects
Groups
Snippets
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
Menu
Open sidebar
Giuseppe Castagna
occurrence-typing
Commits
4faa7d19
Commit
4faa7d19
authored
Jul 09, 2019
by
Giuseppe Castagna
Browse files
typos
parent
5babaf02
Changes
1
Show whitespace changes
Inline
Side-by-side
practical.tex
View file @
4faa7d19
...
@@ -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
no
t hold only for
$
\lambda
$
-expressions, then not using type schemes
t
o
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
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment