Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
I
Iris
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
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
Abhishek Anand
Iris
Commits
e9e6e220
Commit
e9e6e220
authored
5 years ago
by
Matthieu Sozeau
Committed by
Robbert Krebbers
5 years ago
Browse files
Options
Downloads
Patches
Plain Diff
Mode checking works, these were agressive unifications
That should not be allowed
parent
335ff6d7
No related branches found
No related tags found
No related merge requests found
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
theories/algebra/gmap.v
+1
-1
1 addition, 1 deletion
theories/algebra/gmap.v
theories/algebra/list.v
+2
-2
2 additions, 2 deletions
theories/algebra/list.v
with
3 additions
and
3 deletions
theories/algebra/gmap.v
+
1
−
1
View file @
e9e6e220
...
...
@@ -49,7 +49,7 @@ Global Instance lookup_ne k :
Proof
.
by
intros
m1
m2
.
Qed
.
Global
Instance
lookup_proper
k
:
Proper
((
≡
)
==>
(
≡
))
(
lookup
k
:
gmap
K
A
→
option
A
)
:=
_
.
Global
Instance
alter_ne
f
k
n
:
Global
Instance
alter_ne
(
f
:
A
→
A
)
(
k
:
K
)
n
:
Proper
(
dist
n
==>
dist
n
)
f
→
Proper
(
dist
n
==>
dist
n
)
(
alter
f
k
)
.
Proof
.
intros
?
m
m'
Hm
k'
.
...
...
This diff is collapsed.
Click to expand it.
theories/algebra/list.v
+
2
−
2
View file @
e9e6e220
...
...
@@ -340,13 +340,13 @@ Section properties.
rewrite
/
singletonM
/
list_singletonM
app_length
replicate_length
/=
;
lia
.
Qed
.
Lemma
list_core_singletonM
i
(
x
:
A
)
:
core
{[
i
:=
x
]}
≡
{[
i
:=
core
x
]}
.
Lemma
list_core_singletonM
i
(
x
:
A
)
:
core
{[
i
:=
x
]}
≡
@
{
list
A
}
{[
i
:=
core
x
]}
.
Proof
.
rewrite
/
singletonM
/
list_singletonM
.
by
rewrite
{
1
}
/
core
/=
fmap_app
fmap_replicate
(
core_id_core
∅
)
.
Qed
.
Lemma
list_op_singletonM
i
(
x
y
:
A
)
:
{[
i
:=
x
]}
⋅
{[
i
:=
y
]}
≡
{[
i
:=
x
⋅
y
]}
.
{[
i
:=
x
]}
⋅
{[
i
:=
y
]}
≡
@
{
list
A
}
{[
i
:=
x
⋅
y
]}
.
Proof
.
rewrite
/
singletonM
/
list_singletonM
/=.
induction
i
;
constructor
;
rewrite
?left_id
;
auto
.
...
...
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