Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
S
stdpp
Project overview
Project overview
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
21
Issues
21
List
Boards
Labels
Milestones
Merge Requests
1
Merge Requests
1
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Iris
stdpp
Commits
b6d58ca6
Commit
b6d58ca6
authored
Jan 17, 2018
by
Robbert Krebbers
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Support `` in `naive_solver`.
parent
a2a2d978
Changes
1
Hide whitespace changes
Inline
Sidebyside
Showing
1 changed file
with
3 additions
and
0 deletions
+3
0
theories/tactics.v
theories/tactics.v
+3
0
No files found.
theories/tactics.v
View file @
b6d58ca6
...
@@ 517,6 +517,8 @@ Tactic Notation "naive_solver" tactic(tac) :=
...
@@ 517,6 +517,8 @@ Tactic Notation "naive_solver" tactic(tac) :=


Is_true
(
_
&&
_
)
=>
apply
andb_True
;
split


Is_true
(
_
&&
_
)
=>
apply
andb_True
;
split

H
:
_
∨
_

_
=>

H
:
_
∨
_

_
=>
let
H1
:
=
fresh
in
destruct
H
as
[
H1

H1
]
;
try
clear
H
let
H1
:
=
fresh
in
destruct
H
as
[
H1

H1
]
;
try
clear
H

H
:
Is_true
(
_

_
)

_
=>
apply
orb_True
in
H
;
let
H1
:
=
fresh
in
destruct
H
as
[
H1

H1
]
;
try
clear
H
(**i solve the goal using the user supplied tactic *)
(**i solve the goal using the user supplied tactic *)


_
=>
solve
[
tac
]


_
=>
solve
[
tac
]
end
;
end
;
...
@@ 525,6 +527,7 @@ Tactic Notation "naive_solver" tactic(tac) :=
...
@@ 525,6 +527,7 @@ Tactic Notation "naive_solver" tactic(tac) :=
(**i instantiation of the conclusion *)
(**i instantiation of the conclusion *)


∃
x
,
_
=>
no_new_unsolved_evars
ltac
:
(
eexists
;
go
n
)


∃
x
,
_
=>
no_new_unsolved_evars
ltac
:
(
eexists
;
go
n
)


_
∨
_
=>
first
[
left
;
go
n

right
;
go
n
]


_
∨
_
=>
first
[
left
;
go
n

right
;
go
n
]


Is_true
(
_

_
)
=>
apply
orb_True
;
first
[
left
;
go
n

right
;
go
n
]

_
=>

_
=>
(**i instantiations of assumptions. *)
(**i instantiations of assumptions. *)
lazymatch
n
with
lazymatch
n
with
...
...
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