Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
Iris
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Model registry
Operate
Terraform modules
Monitor
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
William Mansky
Iris
Commits
6019fde6
Commit
6019fde6
authored
4 years ago
by
Ralf Jung
Browse files
Options
Downloads
Patches
Plain Diff
tweak wording
parent
0b467975
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
theories/program_logic/ectx_language.v
+6
-5
6 additions, 5 deletions
theories/program_logic/ectx_language.v
with
6 additions
and
5 deletions
theories/program_logic/ectx_language.v
+
6
−
5
View file @
6019fde6
...
@@ -35,7 +35,7 @@ Section ectx_language_mixin.
...
@@ -35,7 +35,7 @@ Section ectx_language_mixin.
[K'']. In particular, this implies [e1 = fill K'' e1'] by [fill_inj],
[K'']. In particular, this implies [e1 = fill K'' e1'] by [fill_inj],
i.e., [e1] contains the head redex.)
i.e., [e1] contains the head redex.)
This implies there can
always
be only one head redex, see
This implies there can be only one head redex, see
[head_redex_unique]. *)
[head_redex_unique]. *)
mixin_step_by_val
K
K'
e1
e1'
σ1
κ
e2
σ2
efs
:
mixin_step_by_val
K
K'
e1
e1'
σ1
κ
e2
σ2
efs
:
fill
K
e1
=
fill
K'
e1'
→
fill
K
e1
=
fill
K'
e1'
→
...
@@ -158,10 +158,11 @@ Section ectx_language.
...
@@ -158,10 +158,11 @@ Section ectx_language.
Lemma
not_head_reducible
e
σ
:
¬
head_reducible
e
σ
↔
head_irreducible
e
σ
.
Lemma
not_head_reducible
e
σ
:
¬
head_reducible
e
σ
↔
head_irreducible
e
σ
.
Proof
.
unfold
head_reducible
,
head_irreducible
.
naive_solver
.
Qed
.
Proof
.
unfold
head_reducible
,
head_irreducible
.
naive_solver
.
Qed
.
(** Head redices are unique. In all sensible instances, [comp_ectx K'
(** The decomposition into head redex and context is unique.
empty_ectx] will be the same as [K'], so the conclusion is [K = K' ∧ e =
e'], but we do not require a law to actually prove that so we cannot use
In all sensible instances, [comp_ectx K' empty_ectx] will be the same as
that fact here. *)
[K'], so the conclusion is [K = K' ∧ e = e'], but we do not require a law
to actually prove that so we cannot use that fact here. *)
Lemma
head_redex_unique
K
K'
e
e'
σ
:
Lemma
head_redex_unique
K
K'
e
e'
σ
:
fill
K
e
=
fill
K'
e'
→
fill
K
e
=
fill
K'
e'
→
head_reducible
e
σ
→
head_reducible
e
σ
→
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment