pl/frap
1
0
Fork 0
mirror of https://github.com/achlipala/frap.git synced 2024-11-28 07:16:20 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

Update frap_book.tex

Browse source
This commit is contained in:
Pietro Monticone 2023-09-07 13:39:29 +02:00
parent d9fb7fca94
commit dad4d406f6
1 changed files with 1 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
frap_book.tex
View file

@ -4769,7 +4769,7 @@ More involved and raising new complications is the rule for loops; see the Coq c
Actually, we need to modify our translation judgment so that it also applies to ``silly'' intermediate states of execution in the target language. Actually, we need to modify our translation judgment so that it also applies to ``silly'' intermediate states of execution in the target language.
For instance, we wind up with $\skipe$s that are quickly stepped away, yet those configurations must be related to source configurations by $\sim$. For instance, we wind up with $\skipe$s that are quickly stepped away, yet those configurations must be related to source configurations by $\sim$.
Here is one example of the extra rules that we need to add to make our induction hypothsis strong enough. Here is one example of the extra rules that we need to add to make our induction hypothesis strong enough.
$$\infer{\dscomp{v}{x \leftarrow \mt{Return} \; n; c(x)}{\mt{skip}; s}}{ $$\infer{\dscomp{v}{x \leftarrow \mt{Return} \; n; c(x)}{\mt{skip}; s}}{
v(y) = n v(y) = n
& \dscomp{v}{c(n)}{s} & \dscomp{v}{c(n)}{s}