Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Contribute to GitLab
Sign in
Toggle navigation
C
cpdt
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
research
cpdt
Commits
549c7318
Commit
549c7318
authored
Apr 12, 2012
by
Adam Chlipala
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Comment CpdtTactics.v
parent
d0d7243d
Changes
2
Expand all
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
94 additions
and
31 deletions
+94
-31
CpdtTactics.v
src/CpdtTactics.v
+93
-30
Intro.v
src/Intro.v
+1
-1
No files found.
src/CpdtTactics.v
View file @
549c7318
This diff is collapsed.
Click to expand it.
src/Intro.v
View file @
549c7318
...
...
@@ -177,7 +177,7 @@ Previous versions of the book included some suggested exercises at the ends of c
(
**
To
make
it
possible
to
start
from
fancy
proof
automation
,
rather
than
working
up
to
it
,
I
have
included
with
the
book
source
a
library
of
%
\
emph
{%
#
<
i
>
#
tactics
#
</
i
>
#
%}%,
or
programs
that
find
proofs
,
since
the
built
-
in
Coq
tactics
do
not
support
a
high
enough
level
of
automation
.
I
use
these
tactics
even
from
the
first
chapter
with
code
examples
.
Some
readers
have
asked
about
the
pragmatics
of
using
this
tactic
library
in
their
own
developments
.
My
position
there
is
that
this
tactic
library
was
designed
with
the
specific
examples
of
the
book
in
mind
;
I
do
not
recommend
using
it
in
other
settings
.
Part
III
should
impart
the
necessary
skills
to
reimplement
these
tactics
and
beyond
.
One
generally
deals
with
undecidable
problems
in
interactive
theorem
proving
,
so
there
can
be
no
tactic
that
solves
all
goals
,
though
the
%
\
index
{
tactics
!
crush
}%
[
crush
]
tactic
that
we
will
meet
soon
may
sometimes
feel
like
that
!
There
are
still
very
useful
tricks
found
in
the
implementations
of
[
crush
]
and
its
cousins
,
so
it
may
be
useful
to
examine
the
commented
source
file
%
\
texttt
{%
#
<
tt
>
#
CpdtTactics
.
v
#
</
tt
>.
#
%}.
\
footnote
{
It
'
s
not
actually
commented
yet
.
\
texttt
{;-
)
}}
%
I
implement
a
new
tactic
library
for
each
new
project
,
since
each
project
involves
a
different
mix
of
undecidable
theories
where
a
different
set
of
heuristics
turns
out
to
work
well
;
and
that
is
what
I
recommend
others
do
,
too
.
Some
readers
have
asked
about
the
pragmatics
of
using
this
tactic
library
in
their
own
developments
.
My
position
there
is
that
this
tactic
library
was
designed
with
the
specific
examples
of
the
book
in
mind
;
I
do
not
recommend
using
it
in
other
settings
.
Part
III
should
impart
the
necessary
skills
to
reimplement
these
tactics
and
beyond
.
One
generally
deals
with
undecidable
problems
in
interactive
theorem
proving
,
so
there
can
be
no
tactic
that
solves
all
goals
,
though
the
%
\
index
{
tactics
!
crush
}%
[
crush
]
tactic
that
we
will
meet
soon
may
sometimes
feel
like
that
!
There
are
still
very
useful
tricks
found
in
the
implementations
of
[
crush
]
and
its
cousins
,
so
it
may
be
useful
to
examine
the
commented
source
file
%
\
texttt
{%
#
<
tt
>
#
CpdtTactics
.
v
#
</
tt
>.
#
%}.%
I
implement
a
new
tactic
library
for
each
new
project
,
since
each
project
involves
a
different
mix
of
undecidable
theories
where
a
different
set
of
heuristics
turns
out
to
work
well
;
and
that
is
what
I
recommend
others
do
,
too
.
*
)
(
**
**
Installation
and
Emacs
Set
-
Up
*
)
...
...
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