Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
Iris
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package registry
Model registry
Operate
Environments
Terraform modules
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
Adam
Iris
Commits
77fd4c86
Commit
77fd4c86
authored
8 months ago
by
Robbert Krebbers
Browse files
Options
Downloads
Patches
Plain Diff
Documentation.
parent
3e55344c
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
iris/proofmode/reduction.v
+16
-5
16 additions, 5 deletions
iris/proofmode/reduction.v
with
16 additions
and
5 deletions
iris/proofmode/reduction.v
+
16
−
5
View file @
77fd4c86
...
...
@@ -2,11 +2,22 @@ From iris.bi Require Import bi telescopes.
From
iris
.
proofmode
Require
Import
base
environments
.
From
iris
.
prelude
Require
Import
options
.
(** Called by all tactics to perform computation to lookup items in the
context. We avoid reducing anything user-visible here to make sure we
do not reduce e.g. before unification happens in [iApply].
This needs to contain all definitions used in the user-visible statements in
[coq_tactics], and their dependencies. *)
(** The following tactics should be used when performing computation in the
proofmode:
- Use [cbv]/[vm_compute] (depending on expected size of computation) if the
expected result is a simple term (say, a boolean, number, list of strings),
and the input term does *not* involve user terms (such as bodies of hypotheses
in the proof mode environment).
- Use [lazy] if the expected result is a simple term and the input term *does*
involve user terms.
- Use [pm_eval] otherwise, particularly to compute new proof mode environments
and to lookup items in the proof mode environment. *)
(** The reduction [pm_eval] avoids reducing anything user-visible to make sure
we do not reduce e.g., before unification happens in [iApply]. This needs to
contain all definitions used in the user-visible statements in [coq_tactics],
and their dependencies. *)
Declare
Reduction
pm_eval
:=
cbv
[
(* base *)
base
.
negb
base
.
beq
...
...
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