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
Abel Nieto
Iris
Commits
4e597ea3
Commit
4e597ea3
authored
6 years ago
by
Robbert Krebbers
Browse files
Options
Downloads
Patches
Plain Diff
Rename constructors of intro pattern stack_items (used in the parser).
This is to avoid confusion with those of selection patterns.
parent
b1270b7d
No related branches found
Branches containing commit
No related tags found
Tags containing commit
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
theories/proofmode/intro_patterns.v
+48
-48
48 additions, 48 deletions
theories/proofmode/intro_patterns.v
with
48 additions
and
48 deletions
theories/proofmode/intro_patterns.v
+
48
−
48
View file @
4e597ea3
...
@@ -24,25 +24,25 @@ Inductive intro_pat :=
...
@@ -24,25 +24,25 @@ Inductive intro_pat :=
Module
intro_pat
.
Module
intro_pat
.
Inductive
stack_item
:=
Inductive
stack_item
:=
|
SPat
:
intro_pat
→
stack_item
|
S
t
Pat
:
intro_pat
→
stack_item
|
SList
:
stack_item
|
S
t
List
:
stack_item
|
SConjList
:
stack_item
|
S
t
ConjList
:
stack_item
|
SBar
:
stack_item
|
S
t
Bar
:
stack_item
|
SAmp
:
stack_item
|
S
t
Amp
:
stack_item
|
SAlwaysElim
:
stack_item
|
S
t
AlwaysElim
:
stack_item
|
SModalElim
:
stack_item
.
|
S
t
ModalElim
:
stack_item
.
Notation
stack
:=
(
list
stack_item
)
.
Notation
stack
:=
(
list
stack_item
)
.
Fixpoint
close_list
(
k
:
stack
)
Fixpoint
close_list
(
k
:
stack
)
(
ps
:
list
intro_pat
)
(
pss
:
list
(
list
intro_pat
))
:
option
stack
:=
(
ps
:
list
intro_pat
)
(
pss
:
list
(
list
intro_pat
))
:
option
stack
:=
match
k
with
match
k
with
|
SList
::
k
=>
Some
(
SPat
(
IList
(
ps
::
pss
))
::
k
)
|
S
t
List
::
k
=>
Some
(
S
t
Pat
(
IList
(
ps
::
pss
))
::
k
)
|
SPat
pat
::
k
=>
close_list
k
(
pat
::
ps
)
pss
|
S
t
Pat
pat
::
k
=>
close_list
k
(
pat
::
ps
)
pss
|
SAlwaysElim
::
k
=>
|
S
t
AlwaysElim
::
k
=>
''
(
p
,
ps
)
←
maybe2
(::)
ps
;
close_list
k
(
IAlwaysElim
p
::
ps
)
pss
''
(
p
,
ps
)
←
maybe2
(::)
ps
;
close_list
k
(
IAlwaysElim
p
::
ps
)
pss
|
SModalElim
::
k
=>
|
S
t
ModalElim
::
k
=>
''
(
p
,
ps
)
←
maybe2
(::)
ps
;
close_list
k
(
IModalElim
p
::
ps
)
pss
''
(
p
,
ps
)
←
maybe2
(::)
ps
;
close_list
k
(
IModalElim
p
::
ps
)
pss
|
SBar
::
k
=>
close_list
k
[]
(
ps
::
pss
)
|
S
t
Bar
::
k
=>
close_list
k
[]
(
ps
::
pss
)
|
_
=>
None
|
_
=>
None
end
.
end
.
...
@@ -57,55 +57,55 @@ Fixpoint big_conj (ps : list intro_pat) : intro_pat :=
...
@@ -57,55 +57,55 @@ Fixpoint big_conj (ps : list intro_pat) : intro_pat :=
Fixpoint
close_conj_list
(
k
:
stack
)
Fixpoint
close_conj_list
(
k
:
stack
)
(
cur
:
option
intro_pat
)
(
ps
:
list
intro_pat
)
:
option
stack
:=
(
cur
:
option
intro_pat
)
(
ps
:
list
intro_pat
)
:
option
stack
:=
match
k
with
match
k
with
|
SConjList
::
k
=>
|
S
t
ConjList
::
k
=>
ps
←
match
cur
with
ps
←
match
cur
with
|
None
=>
guard
(
ps
=
[]);
Some
[]
|
Some
p
=>
Some
(
p
::
ps
)
|
None
=>
guard
(
ps
=
[]);
Some
[]
|
Some
p
=>
Some
(
p
::
ps
)
end
;
end
;
Some
(
SPat
(
big_conj
ps
)
::
k
)
Some
(
S
t
Pat
(
big_conj
ps
)
::
k
)
|
SPat
pat
::
k
=>
guard
(
cur
=
None
);
close_conj_list
k
(
Some
pat
)
ps
|
S
t
Pat
pat
::
k
=>
guard
(
cur
=
None
);
close_conj_list
k
(
Some
pat
)
ps
|
SAlwaysElim
::
k
=>
p
←
cur
;
close_conj_list
k
(
Some
(
IAlwaysElim
p
))
ps
|
S
t
AlwaysElim
::
k
=>
p
←
cur
;
close_conj_list
k
(
Some
(
IAlwaysElim
p
))
ps
|
SModalElim
::
k
=>
p
←
cur
;
close_conj_list
k
(
Some
(
IModalElim
p
))
ps
|
S
t
ModalElim
::
k
=>
p
←
cur
;
close_conj_list
k
(
Some
(
IModalElim
p
))
ps
|
SAmp
::
k
=>
p
←
cur
;
close_conj_list
k
None
(
p
::
ps
)
|
S
t
Amp
::
k
=>
p
←
cur
;
close_conj_list
k
None
(
p
::
ps
)
|
_
=>
None
|
_
=>
None
end
.
end
.
Fixpoint
parse_go
(
ts
:
list
token
)
(
k
:
stack
)
:
option
stack
:=
Fixpoint
parse_go
(
ts
:
list
token
)
(
k
:
stack
)
:
option
stack
:=
match
ts
with
match
ts
with
|
[]
=>
Some
k
|
[]
=>
Some
k
|
TName
"_"
::
ts
=>
parse_go
ts
(
SPat
IDrop
::
k
)
|
TName
"_"
::
ts
=>
parse_go
ts
(
S
t
Pat
IDrop
::
k
)
|
TName
s
::
ts
=>
parse_go
ts
(
SPat
(
IIdent
s
)
::
k
)
|
TName
s
::
ts
=>
parse_go
ts
(
S
t
Pat
(
IIdent
s
)
::
k
)
|
TAnom
::
ts
=>
parse_go
ts
(
SPat
IAnom
::
k
)
|
TAnom
::
ts
=>
parse_go
ts
(
S
t
Pat
IAnom
::
k
)
|
TFrame
::
ts
=>
parse_go
ts
(
SPat
IFrame
::
k
)
|
TFrame
::
ts
=>
parse_go
ts
(
S
t
Pat
IFrame
::
k
)
|
TBracketL
::
ts
=>
parse_go
ts
(
SList
::
k
)
|
TBracketL
::
ts
=>
parse_go
ts
(
S
t
List
::
k
)
|
TBar
::
ts
=>
parse_go
ts
(
SBar
::
k
)
|
TBar
::
ts
=>
parse_go
ts
(
S
t
Bar
::
k
)
|
TBracketR
::
ts
=>
close_list
k
[]
[]
≫=
parse_go
ts
|
TBracketR
::
ts
=>
close_list
k
[]
[]
≫=
parse_go
ts
|
TParenL
::
ts
=>
parse_go
ts
(
SConjList
::
k
)
|
TParenL
::
ts
=>
parse_go
ts
(
S
t
ConjList
::
k
)
|
TAmp
::
ts
=>
parse_go
ts
(
SAmp
::
k
)
|
TAmp
::
ts
=>
parse_go
ts
(
S
t
Amp
::
k
)
|
TParenR
::
ts
=>
close_conj_list
k
None
[]
≫=
parse_go
ts
|
TParenR
::
ts
=>
close_conj_list
k
None
[]
≫=
parse_go
ts
|
TPure
::
ts
=>
parse_go
ts
(
SPat
IPureElim
::
k
)
|
TPure
::
ts
=>
parse_go
ts
(
S
t
Pat
IPureElim
::
k
)
|
TAlways
::
ts
=>
parse_go
ts
(
SAlwaysElim
::
k
)
|
TAlways
::
ts
=>
parse_go
ts
(
S
t
AlwaysElim
::
k
)
|
TModal
::
ts
=>
parse_go
ts
(
SModalElim
::
k
)
|
TModal
::
ts
=>
parse_go
ts
(
S
t
ModalElim
::
k
)
|
TArrow
d
::
ts
=>
parse_go
ts
(
SPat
(
IRewrite
d
)
::
k
)
|
TArrow
d
::
ts
=>
parse_go
ts
(
S
t
Pat
(
IRewrite
d
)
::
k
)
|
TPureIntro
::
ts
=>
parse_go
ts
(
SPat
IPureIntro
::
k
)
|
TPureIntro
::
ts
=>
parse_go
ts
(
S
t
Pat
IPureIntro
::
k
)
|
TAlwaysIntro
::
ts
=>
parse_go
ts
(
SPat
IAlwaysIntro
::
k
)
|
TAlwaysIntro
::
ts
=>
parse_go
ts
(
S
t
Pat
IAlwaysIntro
::
k
)
|
TModalIntro
::
ts
=>
parse_go
ts
(
SPat
IModalIntro
::
k
)
|
TModalIntro
::
ts
=>
parse_go
ts
(
S
t
Pat
IModalIntro
::
k
)
|
TSimpl
::
ts
=>
parse_go
ts
(
SPat
ISimpl
::
k
)
|
TSimpl
::
ts
=>
parse_go
ts
(
S
t
Pat
ISimpl
::
k
)
|
TDone
::
ts
=>
parse_go
ts
(
SPat
IDone
::
k
)
|
TDone
::
ts
=>
parse_go
ts
(
S
t
Pat
IDone
::
k
)
|
TAll
::
ts
=>
parse_go
ts
(
SPat
IAll
::
k
)
|
TAll
::
ts
=>
parse_go
ts
(
S
t
Pat
IAll
::
k
)
|
TForall
::
ts
=>
parse_go
ts
(
SPat
IForall
::
k
)
|
TForall
::
ts
=>
parse_go
ts
(
S
t
Pat
IForall
::
k
)
|
TBraceL
::
ts
=>
parse_clear
ts
k
|
TBraceL
::
ts
=>
parse_clear
ts
k
|
_
=>
None
|
_
=>
None
end
end
with
parse_clear
(
ts
:
list
token
)
(
k
:
stack
)
:
option
stack
:=
with
parse_clear
(
ts
:
list
token
)
(
k
:
stack
)
:
option
stack
:=
match
ts
with
match
ts
with
|
TFrame
::
TName
s
::
ts
=>
parse_clear
ts
(
SPat
(
IClearFrame
(
SelIdent
s
))
::
k
)
|
TFrame
::
TName
s
::
ts
=>
parse_clear
ts
(
S
t
Pat
(
IClearFrame
(
SelIdent
s
))
::
k
)
|
TFrame
::
TPure
::
ts
=>
parse_clear
ts
(
SPat
(
IClearFrame
SelPure
)
::
k
)
|
TFrame
::
TPure
::
ts
=>
parse_clear
ts
(
S
t
Pat
(
IClearFrame
SelPure
)
::
k
)
|
TFrame
::
TAlways
::
ts
=>
parse_clear
ts
(
SPat
(
IClearFrame
SelPersistent
)
::
k
)
|
TFrame
::
TAlways
::
ts
=>
parse_clear
ts
(
S
t
Pat
(
IClearFrame
SelPersistent
)
::
k
)
|
TFrame
::
TSep
::
ts
=>
parse_clear
ts
(
SPat
(
IClearFrame
SelSpatial
)
::
k
)
|
TFrame
::
TSep
::
ts
=>
parse_clear
ts
(
S
t
Pat
(
IClearFrame
SelSpatial
)
::
k
)
|
TName
s
::
ts
=>
parse_clear
ts
(
SPat
(
IClear
(
SelIdent
s
))
::
k
)
|
TName
s
::
ts
=>
parse_clear
ts
(
S
t
Pat
(
IClear
(
SelIdent
s
))
::
k
)
|
TPure
::
ts
=>
parse_clear
ts
(
SPat
(
IClear
SelPure
)
::
k
)
|
TPure
::
ts
=>
parse_clear
ts
(
S
t
Pat
(
IClear
SelPure
)
::
k
)
|
TAlways
::
ts
=>
parse_clear
ts
(
SPat
(
IClear
SelPersistent
)
::
k
)
|
TAlways
::
ts
=>
parse_clear
ts
(
S
t
Pat
(
IClear
SelPersistent
)
::
k
)
|
TSep
::
ts
=>
parse_clear
ts
(
SPat
(
IClear
SelSpatial
)
::
k
)
|
TSep
::
ts
=>
parse_clear
ts
(
S
t
Pat
(
IClear
SelSpatial
)
::
k
)
|
TBraceR
::
ts
=>
parse_go
ts
k
|
TBraceR
::
ts
=>
parse_go
ts
k
|
_
=>
None
|
_
=>
None
end
.
end
.
...
@@ -113,9 +113,9 @@ with parse_clear (ts : list token) (k : stack) : option stack :=
...
@@ -113,9 +113,9 @@ with parse_clear (ts : list token) (k : stack) : option stack :=
Fixpoint
close
(
k
:
stack
)
(
ps
:
list
intro_pat
)
:
option
(
list
intro_pat
)
:=
Fixpoint
close
(
k
:
stack
)
(
ps
:
list
intro_pat
)
:
option
(
list
intro_pat
)
:=
match
k
with
match
k
with
|
[]
=>
Some
ps
|
[]
=>
Some
ps
|
SPat
pat
::
k
=>
close
k
(
pat
::
ps
)
|
S
t
Pat
pat
::
k
=>
close
k
(
pat
::
ps
)
|
SAlwaysElim
::
k
=>
''
(
p
,
ps
)
←
maybe2
(::)
ps
;
close
k
(
IAlwaysElim
p
::
ps
)
|
S
t
AlwaysElim
::
k
=>
''
(
p
,
ps
)
←
maybe2
(::)
ps
;
close
k
(
IAlwaysElim
p
::
ps
)
|
SModalElim
::
k
=>
''
(
p
,
ps
)
←
maybe2
(::)
ps
;
close
k
(
IModalElim
p
::
ps
)
|
S
t
ModalElim
::
k
=>
''
(
p
,
ps
)
←
maybe2
(::)
ps
;
close
k
(
IModalElim
p
::
ps
)
|
_
=>
None
|
_
=>
None
end
.
end
.
...
...
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