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
fce00ac6
Commit
fce00ac6
authored
Sep 24, 2021
by
Giuseppe Castagna
Browse files
typo
parent
00aa768d
Changes
1
Hide whitespace changes
Inline
Side-by-side
scp-reviews-2108.tex
View file @
fce00ac6
...
...
@@ -224,13 +224,13 @@ intersections of arrows and of negations thereof.
If we change the union at issue into an intersection, it becomes
equivalent to our algorithmic definition of
\emph
{
worra
}
(p13) as it can
be verified by a simple application of De Morgan's Laws. In that case
the formula yield
$
\tau
_
a
=
\True\land\False
=
\Empty
$
and we obtain the
the formula yield
s
$
\tau
_
a
=
\True\land\False
=
\Empty
$
and we obtain the
correct result
$
\Bool\setminus\Empty
=
\Bool
$
.
We would be grateful if the reviewer could confirm that we did not
misinterpret the definition in the dissertation. If it is so, was the
author aware of this problem and does
there exist
a corrected version of
the algorithm to which we could refer in our related work section? Thank
author aware of this problem and does a corrected version of
the algorithm
exist
to which we could refer in our related work section? Thank
you in advance.
\end{answer}
...
...
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