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
67183a36
Commit
67183a36
authored
6 years ago
by
Ralf Jung
Browse files
Options
Downloads
Patches
Plain Diff
add lemma names to proofmode.ref
parent
a4f0f4b0
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
tests/proofmode.ref
+42
-0
42 additions, 0 deletions
tests/proofmode.ref
tests/proofmode.v
+23
-2
23 additions, 2 deletions
tests/proofmode.v
with
65 additions
and
2 deletions
tests/proofmode.ref
+
42
−
0
View file @
67183a36
"demo_0"
: string
1 subgoal
PROP : sbi
...
...
@@ -19,6 +21,8 @@
--------------------------------------□
Q ∨ P
"test_iDestruct_and_emp"
: string
1 subgoal
PROP : sbi
...
...
@@ -59,6 +63,8 @@ In nested Ltac calls to "iSpecialize (open_constr)",
"iSpecializePat (open_constr) (constr)" and "iSpecializePat_go", last call
failed.
Tactic failure: iSpecialize: cannot instantiate (⌜φ⌝ → P -∗ False)%I with P.
"test_iNext_plus_3"
: string
1 subgoal
PROP : sbi
...
...
@@ -68,6 +74,8 @@ Tactic failure: iSpecialize: cannot instantiate (⌜φ⌝ → P -∗ False)%I wi
--------------------------------------∗
▷^(S n + S m) emp
"test_iFrame_later_1"
: string
1 subgoal
PROP : sbi
...
...
@@ -76,6 +84,8 @@ Tactic failure: iSpecialize: cannot instantiate (⌜φ⌝ → P -∗ False)%I wi
--------------------------------------∗
▷ emp
"test_iFrame_later_2"
: string
1 subgoal
PROP : sbi
...
...
@@ -89,6 +99,8 @@ In nested Ltac calls to "iFrame (constr)",
"<iris.proofmode.ltac_tactics.iFrame_go>" and
"<iris.proofmode.ltac_tactics.iFrameHyp>", last call failed.
Tactic failure: iFrame: cannot frame Q.
"test_and_sep_affine_bi"
: string
1 subgoal
PROP : sbi
...
...
@@ -100,6 +112,8 @@ Tactic failure: iFrame: cannot frame Q.
--------------------------------------∗
□ P
"test_big_sepL_simpl"
: string
1 subgoal
PROP : sbi
...
...
@@ -126,6 +140,8 @@ Tactic failure: iFrame: cannot frame Q.
--------------------------------------∗
P
"test_big_sepL2_simpl"
: string
1 subgoal
PROP : sbi
...
...
@@ -153,6 +169,8 @@ Tactic failure: iFrame: cannot frame Q.
--------------------------------------∗
P ∨ True ∗ ([∗ list] _;_ ∈ l1;l2, True)
"test_big_sepL2_iDestruct"
: string
1 subgoal
PROP : sbi
...
...
@@ -165,6 +183,8 @@ Tactic failure: iFrame: cannot frame Q.
--------------------------------------∗
<absorb> Φ x1 x2
"test_reducing_after_iDestruct"
: string
1 subgoal
PROP : sbi
...
...
@@ -173,6 +193,8 @@ Tactic failure: iFrame: cannot frame Q.
--------------------------------------∗
True
"test_reducing_after_iApply"
: string
1 subgoal
PROP : sbi
...
...
@@ -181,6 +203,8 @@ Tactic failure: iFrame: cannot frame Q.
--------------------------------------□
□ emp
"test_reducing_after_iApply_late_evar"
: string
1 subgoal
PROP : sbi
...
...
@@ -189,6 +213,8 @@ Tactic failure: iFrame: cannot frame Q.
--------------------------------------□
□ emp
"test_wandM"
: string
1 subgoal
PROP : sbi
...
...
@@ -227,6 +253,8 @@ Tactic failure: iFrame: cannot frame Q.
--------------------------------------∗
|={E2,E1}=> True
"print_long_line_1"
: string
1 subgoal
PROP : sbi
...
...
@@ -249,6 +277,8 @@ Tactic failure: iFrame: cannot frame Q.
--------------------------------------∗
True
"print_long_line_2"
: string
1 subgoal
PROP : sbi
...
...
@@ -271,6 +301,8 @@ Tactic failure: iFrame: cannot frame Q.
--------------------------------------∗
True
"long_impl"
: string
1 subgoal
PROP : sbi
...
...
@@ -281,6 +313,8 @@ Tactic failure: iFrame: cannot frame Q.
PPPPPPPPPPPPPPPPP
→ QQQQQQQQQQQQQQQQQQ ∗ QQQQQQQQQQQQQQQQQQ ∗ QQQQQQQQQQQQQQQQQQ
"long_impl_nested"
: string
1 subgoal
PROP : sbi
...
...
@@ -292,6 +326,8 @@ Tactic failure: iFrame: cannot frame Q.
→ QQQQQQQQQQQQQQQQQQ ∗ QQQQQQQQQQQQQQQQQQ ∗ QQQQQQQQQQQQQQQQQQ
→ QQQQQQQQQQQQQQQQQQ ∗ QQQQQQQQQQQQQQQQQQ ∗ QQQQQQQQQQQQQQQQQQ
"long_wand"
: string
1 subgoal
PROP : sbi
...
...
@@ -302,6 +338,8 @@ Tactic failure: iFrame: cannot frame Q.
PPPPPPPPPPPPPPPPP
-∗ QQQQQQQQQQQQQQQQQQ ∗ QQQQQQQQQQQQQQQQQQ ∗ QQQQQQQQQQQQQQQQQQ
"long_wand_nested"
: string
1 subgoal
PROP : sbi
...
...
@@ -313,6 +351,8 @@ Tactic failure: iFrame: cannot frame Q.
-∗ QQQQQQQQQQQQQQQQQQ ∗ QQQQQQQQQQQQQQQQQQ ∗ QQQQQQQQQQQQQQQQQQ
-∗ QQQQQQQQQQQQQQQQQQ ∗ QQQQQQQQQQQQQQQQQQ ∗ QQQQQQQQQQQQQQQQQQ
"long_fupd"
: string
1 subgoal
PROP : sbi
...
...
@@ -324,6 +364,8 @@ Tactic failure: iFrame: cannot frame Q.
PPPPPPPPPPPPPPPPP
={E}=∗ QQQQQQQQQQQQQQQQQQ ∗ QQQQQQQQQQQQQQQQQQ ∗ QQQQQQQQQQQQQQQQQQ
"long_fupd_nested"
: string
1 subgoal
PROP : sbi
...
...
This diff is collapsed.
Click to expand it.
tests/proofmode.v
+
23
−
2
View file @
67183a36
...
...
@@ -6,6 +6,7 @@ Section tests.
Context
{
PROP
:
sbi
}
.
Implicit
Types
P
Q
R
:
PROP
.
Check
"demo_0"
.
Lemma
demo_0
P
Q
:
□
(
P
∨
Q
)
-∗
(
∀
x
,
⌜
x
=
0
⌝
∨
⌜
x
=
1
⌝
)
→
(
Q
∨
P
)
.
Proof
.
iIntros
"H #H2"
.
Show
.
iDestruct
"H"
as
"###H"
.
...
...
@@ -52,6 +53,7 @@ Proof.
auto
.
Qed
.
Check
"test_iDestruct_and_emp"
.
Lemma
test_iDestruct_and_emp
P
Q
`{
!
Persistent
P
,
!
Persistent
Q
}
:
P
∧
emp
-∗
emp
∧
Q
-∗
<
affine
>
(
P
∗
Q
)
.
Proof
.
iIntros
"[#? _] [_ #?]"
.
Show
.
auto
.
Qed
.
...
...
@@ -365,6 +367,7 @@ Lemma test_iNext_plus_1 P n1 n2 : ▷ ▷^n1 ▷^n2 P -∗ ▷^n1 ▷^n2 ▷ P.
Proof
.
iIntros
"H"
.
iNext
.
iNext
.
by
iNext
.
Qed
.
Lemma
test_iNext_plus_2
P
n
m
:
▷^
n
▷^
m
P
-∗
▷^
(
n
+
m
)
P
.
Proof
.
iIntros
"H"
.
iNext
.
done
.
Qed
.
Check
"test_iNext_plus_3"
.
Lemma
test_iNext_plus_3
P
Q
n
m
k
:
▷^
m
▷^
(
2
+
S
n
+
k
)
P
-∗
▷^
m
▷
▷^
(
2
+
S
n
)
Q
-∗
▷^
k
▷
▷^
(
S
(
S
n
+
S
m
))
(
P
∗
Q
)
.
Proof
.
iIntros
"H1 H2"
.
iNext
.
iNext
.
iNext
.
iFrame
.
Show
.
iModIntro
.
done
.
Qed
.
...
...
@@ -408,9 +411,11 @@ Lemma test_iPureIntro_absorbing (φ : Prop) :
φ
→
sbi_emp_valid
(
PROP
:=
PROP
)
(
<
absorb
>
⌜
φ
⌝
)
%
I
.
Proof
.
intros
?
.
iPureIntro
.
done
.
Qed
.
Check
"test_iFrame_later_1"
.
Lemma
test_iFrame_later_1
P
Q
:
P
∗
▷
Q
-∗
▷
(
P
∗
▷
Q
)
.
Proof
.
iIntros
"H"
.
iFrame
"H"
.
Show
.
auto
.
Qed
.
Check
"test_iFrame_later_2"
.
Lemma
test_iFrame_later_2
P
Q
:
▷
P
∗
▷
Q
-∗
▷
(
▷
P
∗
▷
Q
)
.
Proof
.
iIntros
"H"
.
iFrame
"H"
.
Show
.
auto
.
Qed
.
...
...
@@ -480,11 +485,13 @@ Proof.
-
iDestruct
"H"
as
"[_ [_ #$]]"
.
Qed
.
Check
"test_and_sep_affine_bi"
.
Lemma
test_and_sep_affine_bi
`{
BiAffine
PROP
}
P
Q
:
□
P
∧
Q
⊢
□
P
∗
Q
.
Proof
.
iIntros
"[??]"
.
iSplit
;
last
done
.
Show
.
done
.
Qed
.
Check
"test_big_sepL_simpl"
.
Lemma
test_big_sepL_simpl
x
(
l
:
list
nat
)
P
:
P
-∗
([
∗
list
]
k
↦
y
∈
l
,
<
affine
>
⌜
y
=
y
⌝
)
-∗
...
...
@@ -492,6 +499,7 @@ Lemma test_big_sepL_simpl x (l : list nat) P :
P
.
Proof
.
iIntros
"HP ??"
.
Show
.
simpl
.
Show
.
done
.
Qed
.
Check
"test_big_sepL2_simpl"
.
Lemma
test_big_sepL2_simpl
x1
x2
(
l1
l2
:
list
nat
)
P
:
P
-∗
([
∗
list
]
k
↦
y1
;
y2
∈
[];
l2
,
<
affine
>
⌜
y1
=
y2
⌝
)
-∗
...
...
@@ -499,6 +507,7 @@ Lemma test_big_sepL2_simpl x1 x2 (l1 l2 : list nat) P :
P
∨
([
∗
list
]
y1
;
y2
∈
x1
::
l1
;
x2
::
l2
,
True
)
.
Proof
.
iIntros
"HP ??"
.
Show
.
simpl
.
Show
.
by
iLeft
.
Qed
.
Check
"test_big_sepL2_iDestruct"
.
Lemma
test_big_sepL2_iDestruct
(
Φ
:
nat
→
nat
→
PROP
)
x1
x2
(
l1
l2
:
list
nat
)
:
([
∗
list
]
y1
;
y2
∈
x1
::
l1
;
x2
::
l2
,
Φ
y1
y2
)
-∗
<
absorb
>
Φ
x1
x2
.
...
...
@@ -512,6 +521,7 @@ Proof. iIntros "$ ?". iFrame. Qed.
Lemma
test_lemma_1
(
b
:
bool
)
:
emp
⊢@
{
PROP
}
□
?b
True
.
Proof
.
destruct
b
;
simpl
;
eauto
.
Qed
.
Check
"test_reducing_after_iDestruct"
.
Lemma
test_reducing_after_iDestruct
:
emp
⊢@
{
PROP
}
True
.
Proof
.
iIntros
"H"
.
iDestruct
(
test_lemma_1
true
with
"H"
)
as
"H"
.
Show
.
done
.
...
...
@@ -520,6 +530,7 @@ Qed.
Lemma
test_lemma_2
(
b
:
bool
)
:
□
?b
emp
⊢@
{
PROP
}
emp
.
Proof
.
destruct
b
;
simpl
;
eauto
.
Qed
.
Check
"test_reducing_after_iApply"
.
Lemma
test_reducing_after_iApply
:
emp
⊢@
{
PROP
}
emp
.
Proof
.
iIntros
"#H"
.
iApply
(
test_lemma_2
true
)
.
Show
.
auto
.
...
...
@@ -528,6 +539,7 @@ Qed.
Lemma
test_lemma_3
(
b
:
bool
)
:
□
?b
emp
⊢@
{
PROP
}
⌜
b
=
b
⌝.
Proof
.
destruct
b
;
simpl
;
eauto
.
Qed
.
Check
"test_reducing_after_iApply_late_evar"
.
Lemma
test_reducing_after_iApply_late_evar
:
emp
⊢@
{
PROP
}
⌜
true
=
true
⌝.
Proof
.
iIntros
"#H"
.
iApply
(
test_lemma_3
)
.
Show
.
auto
.
...
...
@@ -535,6 +547,7 @@ Qed.
Section
wandM
.
Import
proofmode
.
base
.
Check
"test_wandM"
.
Lemma
test_wandM
mP
Q
R
:
(
mP
-∗
?
Q
)
-∗
(
Q
-∗
R
)
-∗
(
mP
-∗
?
R
)
.
Proof
.
...
...
@@ -564,7 +577,8 @@ Proof. iIntros ">Hacc". Show. Abort.
(* Test line breaking of long assumptions. *)
Section
linebreaks
.
Lemma
print_long_line
(
P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P
:
PROP
)
:
Check
"print_long_line_1"
.
Lemma
print_long_line_1
(
P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P
:
PROP
)
:
P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P
∗
P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P
-∗
True
.
...
...
@@ -576,38 +590,45 @@ Abort.
the proofmode notation breaks the output. *)
Local
Notation
"'TESTNOTATION' '{{' P '|' Q '}' '}'"
:=
(
P
∧
Q
)
%
I
(
format
"'TESTNOTATION' '{{' P '|' '/' Q '}' '}'"
)
:
bi_scope
.
Lemma
print_long_line
(
P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P
:
PROP
)
:
Check
"print_long_line_2"
.
Lemma
print_long_line_2
(
P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P
:
PROP
)
:
TESTNOTATION
{{
P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P
|
P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P_P
}}
-∗
True
.
Proof
.
iIntros
"HP"
.
Show
.
Undo
.
iIntros
"?"
.
Show
.
Abort
.
Check
"long_impl"
.
Lemma
long_impl
(
PPPPPPPPPPPPPPPPP
QQQQQQQQQQQQQQQQQQ
:
PROP
)
:
(
PPPPPPPPPPPPPPPPP
→
(
QQQQQQQQQQQQQQQQQQ
∗
QQQQQQQQQQQQQQQQQQ
∗
QQQQQQQQQQQQQQQQQQ
))
%
I
.
Proof
.
iStartProof
.
Show
.
Abort
.
Check
"long_impl_nested"
.
Lemma
long_impl_nested
(
PPPPPPPPPPPPPPPPP
QQQQQQQQQQQQQQQQQQ
:
PROP
)
:
(
PPPPPPPPPPPPPPPPP
→
(
QQQQQQQQQQQQQQQQQQ
∗
QQQQQQQQQQQQQQQQQQ
∗
QQQQQQQQQQQQQQQQQQ
)
→
(
QQQQQQQQQQQQQQQQQQ
∗
QQQQQQQQQQQQQQQQQQ
∗
QQQQQQQQQQQQQQQQQQ
))
%
I
.
Proof
.
iStartProof
.
Show
.
Abort
.
Check
"long_wand"
.
Lemma
long_wand
(
PPPPPPPPPPPPPPPPP
QQQQQQQQQQQQQQQQQQ
:
PROP
)
:
(
PPPPPPPPPPPPPPPPP
-∗
(
QQQQQQQQQQQQQQQQQQ
∗
QQQQQQQQQQQQQQQQQQ
∗
QQQQQQQQQQQQQQQQQQ
))
%
I
.
Proof
.
iStartProof
.
Show
.
Abort
.
Check
"long_wand_nested"
.
Lemma
long_wand_nested
(
PPPPPPPPPPPPPPPPP
QQQQQQQQQQQQQQQQQQ
:
PROP
)
:
(
PPPPPPPPPPPPPPPPP
-∗
(
QQQQQQQQQQQQQQQQQQ
∗
QQQQQQQQQQQQQQQQQQ
∗
QQQQQQQQQQQQQQQQQQ
)
-∗
(
QQQQQQQQQQQQQQQQQQ
∗
QQQQQQQQQQQQQQQQQQ
∗
QQQQQQQQQQQQQQQQQQ
))
%
I
.
Proof
.
iStartProof
.
Show
.
Abort
.
Check
"long_fupd"
.
Lemma
long_fupd
E
(
PPPPPPPPPPPPPPPPP
QQQQQQQQQQQQQQQQQQ
:
PROP
)
:
PPPPPPPPPPPPPPPPP
=
{
E
}
=∗
QQQQQQQQQQQQQQQQQQ
∗
QQQQQQQQQQQQQQQQQQ
∗
QQQQQQQQQQQQQQQQQQ
.
Proof
.
iStartProof
.
Show
.
Abort
.
Check
"long_fupd_nested"
.
Lemma
long_fupd_nested
E1
E2
(
PPPPPPPPPPPPPPPPP
QQQQQQQQQQQQQQQQQQ
:
PROP
)
:
PPPPPPPPPPPPPPPPP
=
{
E1
,
E2
}
=∗
QQQQQQQQQQQQQQQQQQ
∗
QQQQQQQQQQQQQQQQQQ
∗
QQQQQQQQQQQQQQQQQQ
=
{
E1
,
E2
}
=∗
QQQQQQQQQQQQQQQQQQ
∗
QQQQQQQQQQQQQQQQQQ
.
...
...
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