Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add rep_lia to Catalog; closes #628 #659

Merged
merged 1 commit into from
Jan 31, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
Binary file modified doc/VC.pdf
Binary file not shown.
10 changes: 10 additions & 0 deletions doc/VC.tex
Original file line number Diff line number Diff line change
Expand Up @@ -4967,6 +4967,10 @@ \chapter{Catalog of tactics/lemmas}
(tactic; \autopageref{refcard:entailer}, \autopageref{refcard:entailments})
Like \lstinline{entailer}, but faster and more powerful---however,
it sometimes turns a provable goal into an unprovable goal.
\item[\textsf{entailer!!}]
(tactic; \autopageref{refcard:entailer}, \autopageref{refcard:entailments})
Like \lstinline{entailer!}, but does not put hypotheses above the line
derived from SEP and LOCAL clauses.

\item[\textsf{Exists} $v$]
(tactic; \autoref{refcard:EX})
Expand Down Expand Up @@ -5047,6 +5051,12 @@ \chapter{Catalog of tactics/lemmas}
proof goal for abstracting/factoring out as a separate lemma.
% Superordinate tactics: $\mathit{semax\_subcommand}$\\

\item[\textsf{rep\_lia}]
(tactic; \autopageref{refcard:rep-lia})
Solves goals in linear integer arithmetic (like \lstinline{lia}) enhanced
by extra facts about 32-bit and 64-bit modular representations of integers
(Int and Int64 modules).

\item[\textsf{semax\_subcommand\ $V$\ $G$\ $F$}]
(tactic)
Applicable to a proof state with a semax goal.
Expand Down