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
Terraform modules
Monitor
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
Pierre Roux
Iris
Commits
9d04874f
Commit
9d04874f
authored
2 years ago
by
Ralf Jung
Browse files
Options
Downloads
Patches
Plain Diff
fix changelog style
parent
a3bed7ea
No related branches found
Branches containing commit
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
CHANGELOG.md
+6
-6
6 additions, 6 deletions
CHANGELOG.md
with
6 additions
and
6 deletions
CHANGELOG.md
+
6
−
6
View file @
9d04874f
...
@@ -15,11 +15,11 @@ lemma.
...
@@ -15,11 +15,11 @@ lemma.
**Changes in `proofmode`:**
**Changes in `proofmode`:**
*
`iAssumption`
no longer instantiate
s
evar premises with
`False`
. This
used
*
Change
`iAssumption`
to
no longer instantiate evar premises with
`False`
. This
to occur when the conclusion contains variables that are not in scope of
the
used
to occur when the conclusion contains variables that are not in scope of
evar, thus blocking the default behavior of instantiating the premise with
the
evar, thus blocking the default behavior of instantiating the premise with
the conclusion. The old behavior can be emulated with
`iExFalso. iExact "H".`
the conclusion. The old behavior can be emulated with
`iExFalso. iExact "H".`
*
`iInduction`
now
support
s
induction schemes that involve
`Forall`
and
*
In
`iInduction`
,
support induction schemes that involve
`Forall`
and
`Forall2`
(for example, for trees with finite branching).
`Forall2`
(for example, for trees with finite branching).
**Changes in `base_logic`:**
**Changes in `base_logic`:**
...
@@ -29,7 +29,7 @@ lemma.
...
@@ -29,7 +29,7 @@ lemma.
**Changes in `iris_heap_lang`:**
**Changes in `iris_heap_lang`:**
*
Change
d
the
`num_laters_per_step`
of
`heap_lang`
to
`λ n, n`
, signifying that
*
Change the
`num_laters_per_step`
of
`heap_lang`
to
`λ n, n`
, signifying that
each step of the weakest precondition strips
`n`
laters, where
`n`
is the
each step of the weakest precondition strips
`n`
laters, where
`n`
is the
number of steps taken so far. This number is tied to ghost state in the state
number of steps taken so far. This number is tied to ghost state in the state
interpretation, which is exposed, updated, and used with new lemmas
interpretation, which is exposed, updated, and used with new lemmas
...
...
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