Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
S
stdpp
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Simon Spies
stdpp
Commits
f37ad033
Commit
f37ad033
authored
Aug 13, 2019
by
Rodolphe Lepigre
Committed by
Robbert
Aug 13, 2019
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
More lemmas about [map_imap].
parent
d983fe55
Changes
2
Hide whitespace changes
Inline
Sidebyside
Showing
2 changed files
with
36 additions
and
2 deletions
+36
2
CHANGELOG.md
CHANGELOG.md
+2
1
fin_maps.v
theories/fin_maps.v
+34
1
No files found.
CHANGELOG.md
View file @
f37ad033
...
...
@@ 4,7 +4,7 @@ APIbreaking change is listed.
## std++ 1.2.1 (unreleased)
This release of std++ received contributions by Michael Sammler, Paolo
G. Giarrusso, Ralf Jung, Robbert Krebbers,
and Simon Spies
.
G. Giarrusso, Ralf Jung, Robbert Krebbers,
Simon Spies, and Rodolphe Lepigre
.
Noteworthy additions and changes:
...
...
@@ 13,6 +13,7 @@ Noteworthy additions and changes:

Add typeclass
`Involutive`
.

Improved
`naive_solver`
performance in case the goal is trivially solvable.

A bunch of new lemmas for list operations.

`lookup_imap`
renamed into
`map_lookup_imap`
.
## std++ 1.2.0 (released 20190426)
...
...
theories/fin_maps.v
View file @
f37ad033
...
...
@@ 860,7 +860,7 @@ Proof.
Defined
.
(** Properties of the imap function *)
Lemma
lookup_imap
{
A
B
}
(
f
:
K
→
A
→
option
B
)
(
m
:
M
A
)
i
:
Lemma
map_
lookup_imap
{
A
B
}
(
f
:
K
→
A
→
option
B
)
(
m
:
M
A
)
i
:
map_imap
f
m
!!
i
=
m
!!
i
≫
=
f
i
.
Proof
.
unfold
map_imap
;
destruct
(
m
!!
i
≫
=
f
i
)
as
[
y
]
eqn
:
Hi
;
simpl
.
...
...
@@ 876,6 +876,39 @@ Proof.
rewrite
elem_of_map_to_list
in
Hj
;
simplify_option_eq
.
Qed
.
Lemma
map_imap_Some
{
A
}
(
m
:
M
A
)
:
map_imap
(
λ
_,
Some
)
m
=
m
.
Proof
.
apply
map_eq
.
intros
i
.
rewrite
map_lookup_imap
.
by
destruct
(
m
!!
i
).
Qed
.
Lemma
map_imap_insert
{
A
B
}
(
f
:
K
→
A
→
option
B
)
(
i
:
K
)
(
v
:
A
)
(
m
:
M
A
)
:
map_imap
f
(<[
i
:=
v
]>
m
)
=
match
f
i
v
with

None
=>
delete
i
(
map_imap
f
m
)

Some
w
=>
<[
i
:=
w
]>
(
map_imap
f
m
)
end
.
Proof
.
destruct
(
f
i
v
)
as
[
w
]
eqn
:
Hw
.

apply
map_eq
.
intros
k
.
rewrite
map_lookup_imap
.
destruct
(
decide
(
k
=
i
))
as
[>
Hk_not_i
].
+
by
rewrite
lookup_insert
,
lookup_insert
.
+
rewrite
!
lookup_insert_ne
by
done
.
by
rewrite
map_lookup_imap
.

apply
map_eq
.
intros
k
.
rewrite
map_lookup_imap
.
destruct
(
decide
(
k
=
i
))
as
[>
Hk_not_i
].
+
by
rewrite
lookup_insert
,
lookup_delete
.
+
rewrite
lookup_insert_ne
,
lookup_delete_ne
by
done
.
by
rewrite
map_lookup_imap
.
Qed
.
Lemma
map_imap_ext
{
A1
A2
B
}
(
f1
:
K
→
A1
→
option
B
)
(
f2
:
K
→
A2
→
option
B
)
(
m1
:
M
A1
)
(
m2
:
M
A2
)
:
(
∀
k
,
f1
k
<$>
(
m1
!!
k
)
=
f2
k
<$>
(
m2
!!
k
))
→
map_imap
f1
m1
=
map_imap
f2
m2
.
Proof
.
intros
HExt
.
apply
map_eq
.
intros
i
.
rewrite
!
map_lookup_imap
.
specialize
(
HExt
i
).
destruct
(
m1
!!
i
),
(
m2
!!
i
);
naive_solver
.
Qed
.
(** ** Properties of the size operation *)
Lemma
map_size_empty
{
A
}
:
size
(
∅
:
M
A
)
=
0
.
Proof
.
unfold
size
,
map_size
.
by
rewrite
map_to_list_empty
.
Qed
.
...
...
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