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
1cfec5a7
Commit
1cfec5a7
authored
Sep 24, 2021
by
Giuseppe Castagna
Browse files
typo
parent
b7536bf7
Changes
1
Hide whitespace changes
Inline
Side-by-side
algorithm.tex
View file @
1cfec5a7
...
...
@@ -237,7 +237,7 @@ The solution we adopt in practice is to bound the number of iterations to some
\end
{
array
}
\svvspace
{
-
1
.
5
mm
}
\]
Note in particular that
$
\Refine
{
e,t
}
\Gamma
$
extends
$
\Gamma
$
with hypotheses on the expressions occurring in
$
e
$
, since
$
\dom
{
\Refine
{
e,t
}
\Gamma
}
=
\dom
{
\RefineStep
{
e,t
}
(
\Gamma
)
}
=
\dom
{
\Gamma
}
\cup
\{
e'
\alt
\exists
\varpi
.
\ \occ
e
\varpi
\equiv
e'
\}
$
.
$
\dom
{
\Refine
{
e,t
}
\Gamma
}
$
$
=
$
$
\dom
{
\RefineStep
{
e,t
}
(
\Gamma
)
}
=
\dom
{
\Gamma
}
\cup
\{
e'
\alt
\exists
\varpi
.
\ \occ
e
\varpi
\equiv
e'
\}
$
.
In other terms, we try to find a fixpoint of
$
\RefineStep
{
e,t
}$
but we
bound our search to
$
n
_
o
$
iterations. Since
$
\RefineStep
{
e,t
}$
is
...
...
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