Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
L
lambda-rust
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
Model registry
Operate
Environments
Monitor
Service Desk
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
Iris
lambda-rust
Commits
7ce083ee
Commit
7ce083ee
authored
3 years ago
by
Yusuke Matsushita
Browse files
Options
Downloads
Patches
Plain Diff
Verify smallvec_to_uniq_slice_type
parent
4559398a
No related branches found
No related tags found
No related merge requests found
Pipeline
#63440
passed
3 years ago
Stage: build
Changes
2
Pipelines
1
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
_CoqProject
+1
-0
1 addition, 0 deletions
_CoqProject
theories/typing/lib/smallvec/smallvec_slice.v
+105
-0
105 additions, 0 deletions
theories/typing/lib/smallvec/smallvec_slice.v
with
106 additions
and
0 deletions
_CoqProject
+
1
−
0
View file @
7ce083ee
...
...
@@ -91,6 +91,7 @@ theories/typing/lib/vec/vec_index.v
theories/typing/lib/vec/vec_pushpop.v
theories/typing/lib/smallvec/smallvec.v
theories/typing/lib/smallvec/smallvec_basic.v
theories/typing/lib/smallvec/smallvec_slice.v
theories/typing/lib/smallvec/smallvec_index.v
theories/typing/lib/smallvec/smallvec_push.v
# theories/typing/lib/fake_shared.v
...
...
This diff is collapsed.
Click to expand it.
theories/typing/lib/smallvec/smallvec_slice.v
0 → 100644
+
105
−
0
View file @
7ce083ee
From
lrust
.
typing
Require
Export
type
.
From
lrust
.
typing
Require
Import
uniq_array_util
typing
.
From
lrust
.
typing
.
lib
Require
Import
smallvec
.
smallvec
slice
.
uniq_slice
.
Set
Default
Proof
Using
"Type"
.
Implicit
Type
𝔄
𝔅
:
syn_type
.
Section
smallvec_slice
.
Context
`{
!
typeG
Σ
}
.
Definition
smallvec_to_slice
:
val
:=
fn
:
[
"bv"
]
:=
let
:
"v"
:=
!
"bv"
in
delete
[
#
1
;
"bv"
];;
let
:
"r"
:=
new
[
#
2
]
in
"r"
+
ₗ
#
1
<-
!
(
"v"
+
ₗ
#
2
);;
if
:
!
"v"
then
"r"
<-
"v"
+
ₗ
#
4
;;
return
:
[
"r"
]
else
"r"
<-
!
(
"v"
+
ₗ
#
1
);;
return
:
[
"r"
]
.
Lemma
smallvec_to_uniq_slice_type
{
𝔄
}
n
(
ty
:
type
𝔄
)
:
typed_val
smallvec_to_slice
(
fn
<
α
>
(
∅
;
&
uniq
{
α
}
(
smallvec
n
ty
))
→
uniq_slice
α
ty
)
(
λ
post
'
-
[(
al
,
al'
)],
length
al'
=
length
al
→
post
(
zip
al
al'
))
.
Proof
.
eapply
type_fn
;
[
apply
_|]=>
/=
α
??[
bv
[]]
.
simpl_subst
.
iIntros
(?(
vπ
&
[])?)
"#LFT #TIME #PROPH UNIQ E Na L C /=[bv _] Obs"
.
rewrite
tctx_hasty_val
.
iDestruct
"bv"
as
([|])
"[⧖ box]"
=>
//.
case
bv
as
[[|
bv
|]|]=>
//=.
rewrite
split_mt_uniq_bor
.
iDestruct
"box"
as
"[(#In &%&%& %ξi &>[% %Eq2]& ↦bv & Vo & Bor) †bv]"
.
wp_read
.
wp_seq
.
rewrite
freeable_sz_full
-
heap_mapsto_vec_singleton
.
wp_apply
(
wp_delete
with
"[$↦bv $†bv]"
);
[
done
|]
.
iIntros
"_"
.
iMod
(
lctx_lft_alive_tok
α
with
"E L"
)
as
(?)
"(α & L & ToL)"
;
[
solve_typing
..|]
.
iMod
(
bor_acc_cons
with
"LFT Bor α"
)
as
"[big ToBor]"
;
[
done
|]
.
wp_seq
.
iDestruct
"big"
as
(?
d'
)
"(_ & Pc & big)"
.
rewrite
split_mt_smallvec
.
iDestruct
"big"
as
(
b
???
aπl
->
)
"(↦ & big)"
.
wp_bind
(
new
_)
.
iApply
(
wp_persistent_time_receipt
with
"TIME ⧖"
);
[
done
|]
.
iApply
wp_new
;
[
done
..|]
.
iIntros
"!>"
(?)
"[†r ↦r] #⧖"
.
rewrite
!
heap_mapsto_vec_cons
!
shift_loc_assoc
.
iDestruct
"↦"
as
"(↦₀ & ↦₁ & ↦₂ & ↦₃ &_)"
.
iDestruct
"↦r"
as
"(↦r & ↦r' &_)"
.
wp_let
.
do
2
wp_op
.
wp_read
.
wp_write
.
wp_read
.
wp_if
.
set
ξ
:=
PrVar
_
ξi
.
iDestruct
(
uniq_agree
with
"Vo Pc"
)
as
%
[
Eq1
->
]
.
have
->
:
vπ
=
λ
π
,
(
lapply
aπl
π
,
π
ξ
)
.
{
by
rewrite
[
vπ
]
surjective_pairing_fun
Eq1
Eq2
.
}
iMod
(
uniq_intro_vec
aπl
with
"PROPH UNIQ"
)
as
(
ζil
)
"VoPcs"
;
[
done
|]
.
iDestruct
(
uniq_proph_tok_vec
with
"VoPcs"
)
as
"[ζl VoPcs]"
.
set
aπζil
:=
vzip
_
_
.
set
ζl
:=
map
_
aπζil
.
set
aπl'
:=
vmap
(
λ
aπζi
(
π
:
proph_asn
),
π
(
PrVar
(
𝔄
↾
prval_to_inh
aπζi
.
1
)
aπζi
.
2
):
𝔄
)
aπζil
.
set
aaπl
:=
vmap
(
λ
aπζi
π
,
(
aπζi
.
1
π
,
π
(
PrVar
(
𝔄
↾
prval_to_inh
aπζi
.
1
)
aπζi
.
2
):
𝔄
))
aπζil
.
iMod
(
uniq_preresolve
ξ
ζl
(
lapply
aπl'
)
with
"PROPH Vo Pc ζl"
)
as
"(Obs' & ζl & ToPc)"
;
[
done
|..]
.
{
rewrite
-
vec_to_list_apply
.
apply
proph_dep_constr
,
proph_dep_prvars
.
}
iCombine
"Obs' Obs"
as
"#?"
.
iSpecialize
(
"VoPcs"
with
"ζl"
)
.
iDestruct
(
big_sepL_sep
with
"VoPcs"
)
as
"[Vos Pcs]"
.
case
b
=>
/=.
-
iDestruct
"big"
as
"[↦tys ↦tl]"
.
wp_op
.
wp_write
.
do
2
wp_seq
.
iMod
(
"ToBor"
$!
(
big_sepL
_
_)
with
"[↦₀ ↦₁ ↦₂ ↦₃ ↦tl ToPc] [↦tys Pcs]"
)
as
"[Bor α]"
;
last
first
.
+
iMod
(
"ToL"
with
"α L"
)
as
"L"
.
rewrite
cctx_interp_singleton
.
iMod
(
bor_big_sepL
with
"LFT Bor"
)
as
"Bors"
;
[
done
|]
.
iApply
(
"C"
$!
[
#
#
_]
-
[
lapply
aaπl
]
with
"Na L [-]"
)
.
*
rewrite
/=
right_id
(
tctx_hasty_val
#
_)
-
freeable_sz_full
.
iExists
_
.
iFrame
"⧖ †r"
.
iNext
.
rewrite
split_mt_uniq_slice
.
iFrame
"In"
.
iExists
_,
_,
_,
_
.
rewrite
big_sepL_sep
.
by
iFrame
.
*
iApply
proph_obs_impl
;
[|
done
]=>
/=
π
[
->
Imp
]
.
have
->
:
lapply
aaπl
π
=
zip
(
lapply
aπl
π
)
(
lapply
aπl'
π
)
.
{
clear
.
induction
aπl
;
inv_vec
ζil
=>
//=
*.
by
f_equal
.
}
apply
Imp
.
clear
.
induction
aπl
;
inv_vec
ζil
=>
//=
*.
by
f_equal
.
+
iNext
.
iApply
(
merge_big_sepL_proph_ctrl_mt_ty_own
with
"[] Pcs [↦tys]"
)
.
*
iApply
persistent_time_receipt_mono
;
[|
done
]
.
lia
.
*
iClear
"#"
.
iStopProof
.
do
6
f_equiv
.
apply
ty_own_depth_mono
.
lia
.
+
iIntros
"!> big"
.
iDestruct
(
split_big_sepL_proph_ctrl_mt_ty_own
with
"PROPH ⧖ big"
)
as
"big"
.
iMod
(
bi
.
later_exist_except_0
with
"big"
)
as
(
wπl
?)
"(>⧖' & Eqzs & ↦tys)"
.
iIntros
"!>!>"
.
iExists
(
lapply
wπl
),
_
.
iFrame
"⧖'"
.
iSplitL
"Eqzs ToPc"
.
{
iApply
"ToPc"
.
rewrite
-!
vec_to_list_apply
.
iApply
proph_eqz_constr
.
iApply
(
proph_eqz_prvars
with
"Eqzs"
)
.
}
rewrite
split_mt_smallvec
.
iExists
true
,
_,
_,
_,
_=>
/=.
rewrite
!
heap_mapsto_vec_cons
heap_mapsto_vec_nil
!
shift_loc_assoc
.
by
iFrame
.
-
iDestruct
"big"
as
(??)
"(↦tl & ↦tys & †)"
.
wp_op
.
wp_read
.
wp_write
.
do
2
wp_seq
.
iMod
(
"ToBor"
$!
(
big_sepL
_
_)
with
"[↦₀ ↦₁ ↦₂ ↦₃ ↦tl † ToPc] [↦tys Pcs]"
)
as
"[Bor α]"
;
last
first
.
+
iMod
(
"ToL"
with
"α L"
)
as
"L"
.
rewrite
cctx_interp_singleton
.
iMod
(
bor_big_sepL
with
"LFT Bor"
)
as
"Bors"
;
[
done
|]
.
iApply
(
"C"
$!
[
#
#
_]
-
[
lapply
aaπl
]
with
"Na L [-]"
)
.
*
rewrite
/=
right_id
(
tctx_hasty_val
#
_)
-
freeable_sz_full
.
iExists
_
.
iFrame
"⧖ †r"
.
iNext
.
rewrite
split_mt_uniq_slice
.
iFrame
"In"
.
iExists
_,
_,
_,
_
.
rewrite
big_sepL_sep
.
by
iFrame
.
*
iApply
proph_obs_impl
;
[|
done
]=>
/=
π
[
->
Imp
]
.
have
->
:
lapply
aaπl
π
=
zip
(
lapply
aπl
π
)
(
lapply
aπl'
π
)
.
{
clear
.
induction
aπl
;
inv_vec
ζil
=>
//=
*.
by
f_equal
.
}
apply
Imp
.
clear
.
induction
aπl
;
inv_vec
ζil
=>
//=
*.
by
f_equal
.
+
iNext
.
iApply
(
merge_big_sepL_proph_ctrl_mt_ty_own
with
"[] Pcs [↦tys]"
)
.
*
iApply
persistent_time_receipt_mono
;
[|
done
]
.
lia
.
*
iClear
"#"
.
iStopProof
.
do
6
f_equiv
.
apply
ty_own_depth_mono
.
lia
.
+
iIntros
"!> big"
.
iDestruct
(
split_big_sepL_proph_ctrl_mt_ty_own
with
"PROPH ⧖ big"
)
as
"big"
.
iMod
(
bi
.
later_exist_except_0
with
"big"
)
as
(
wπl
?)
"(>⧖' & Eqzs & ↦tys)"
.
iIntros
"!>!>"
.
iExists
(
lapply
wπl
),
_
.
iFrame
"⧖'"
.
iSplitL
"Eqzs ToPc"
.
{
iApply
"ToPc"
.
rewrite
-!
vec_to_list_apply
.
iApply
proph_eqz_constr
.
iApply
(
proph_eqz_prvars
with
"Eqzs"
)
.
}
rewrite
split_mt_smallvec
.
iExists
false
,
_,
_,
_,
_=>
/=.
rewrite
!
heap_mapsto_vec_cons
heap_mapsto_vec_nil
!
shift_loc_assoc
.
iFrame
"↦₀ ↦₁ ↦₂ ↦₃ †"
.
iSplit
;
[
done
|]
.
iExists
_
.
by
iFrame
.
Qed
.
End
smallvec_slice
.
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