Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
A
Actris
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
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
Iris
Actris
Commits
9fc2519f
Commit
9fc2519f
authored
4 years ago
by
Jonas Kastberg
Browse files
Options
Downloads
Patches
Plain Diff
WIP: Stated the subtyping rules for texist
parent
6045937e
No related branches found
Branches containing commit
No related tags found
Tags containing commit
1 merge request
!13
Jonas/more polymorphism
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
theories/logrel/subtyping_rules.v
+19
-0
19 additions, 0 deletions
theories/logrel/subtyping_rules.v
with
19 additions
and
0 deletions
theories/logrel/subtyping_rules.v
+
19
−
0
View file @
9fc2519f
...
...
@@ -267,6 +267,25 @@ Section subtyping_rules.
⊢
(
<
??
>
M
A
)
<:
(
<
??
X
>
M
X
)
.
Proof
.
iIntros
"!>"
.
iApply
(
iProto_le_exist_intro_r
)
.
Qed
.
(* Elimination rules need inhabited variant of telescopes in the model *)
Lemma
lty_le_texist_elim_l
{
kt
:
ktele
Σ
}
(
M
:
ltys
kt
→
lmsg
Σ
)
S
:
(
∀
Xs
,
(
<
??
>
M
Xs
)
<:
S
)
-∗
(
<
??.
.
Xs
>
M
Xs
)
<:
S
.
Proof
.
Admitted
.
Lemma
lty_le_texist_elim_r
{
kt
:
ktele
Σ
}
(
M
:
ltys
kt
→
lmsg
Σ
)
S
:
(
∀
Xs
,
S
<:
(
<!!>
M
Xs
))
-∗
S
<:
(
<!!..
Xs
>
M
Xs
)
.
Proof
.
Admitted
.
Lemma
lty_le_texist_intro_l
{
kt
:
ktele
Σ
}
(
M
:
ltys
kt
→
lmsg
Σ
)
Ks
:
⊢
(
<!!..
Xs
>
M
Xs
)
<:
(
<!!>
M
Ks
)
.
Proof
.
Admitted
.
Lemma
lty_le_texist_intro_r
{
kt
:
ktele
Σ
}
(
M
:
ltys
kt
→
lmsg
Σ
)
Ks
:
⊢
(
<
??
>
M
Ks
)
<:
(
<
??.
.
Xs
>
M
Xs
)
.
Proof
.
Admitted
.
Lemma
lty_le_swap_recv_send
A1
A2
S
:
⊢
(
<
??
>
TY
A1
;
<!!>
TY
A2
;
S
)
<:
(
<!!>
TY
A2
;
<
??
>
TY
A1
;
S
)
.
Proof
.
...
...
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