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
Gaëtan Gilbert
Iris
Commits
abc98e0a
Commit
abc98e0a
authored
6 years ago
by
Ralf Jung
Browse files
Options
Downloads
Patches
Plain Diff
CHANGELOG
parent
29c965ba
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
CHANGELOG.md
+21
-0
21 additions, 0 deletions
CHANGELOG.md
with
21 additions
and
0 deletions
CHANGELOG.md
+
21
−
0
View file @
abc98e0a
...
@@ -11,12 +11,33 @@ Changes in and extensions of the theory:
...
@@ -11,12 +11,33 @@ Changes in and extensions of the theory:
the quantification over the next states and the later modality. This makes it
the quantification over the next states and the later modality. This makes it
possible to prove more powerful lifting lemmas: The new versions feature an
possible to prove more powerful lifting lemmas: The new versions feature an
"update that takes a step".
"update that takes a step".
*
[#] Weaken the semantics of CAS in heap_lang to be efficiently implementable:
CAS may only be used to compare "unboxed" values that can be represented in a
single machine word.
*
[#] Add weakest preconditions for total program correctness.
*
[#] Add weakest preconditions for total program correctness.
*
[#] "(Potentially) stuck" weakest preconditions are no longer considered
*
[#] "(Potentially) stuck" weakest preconditions are no longer considered
experimental.
experimental.
Changes in Coq:
Changes in Coq:
*
An all-new generalized proofmode that abstracts away from Iris! The proofmode
can now be used with non-step-indexed and even non-affine (i.e., linear)
logics. TODO: Add reference to paper. Developments instantiating the
proofmode typeclasses may need significant changes. For developments just
using the proofmode tactics, porting should not be too much effort. Notable
things to port are:
-
All the BI laws moved from the
`uPred`
module to the
`bi`
module. For
example,
`uPred.later_equivI`
became
`bi.later_equivI`
.
-
Big-ops are automatically imported, imports of
`iris.base_logic.big_op`
have
to be removed.
-
The ⊢ notation can sometimes infer different (but convertible) terms when
seraching for the BI to use, which (due to Coq limitations) can lead to
failing rewrites, in particular when rewriting at function types.
*
The
`iInv`
tactic can now be used without the second argument (the name for
the closing update). It will then instead add the obligation to close the
invariant to the goal.
*
Improved pretty-printing of Iris connectives (in particular WP and fancy
updates) when Coq has to line-wrap the output.
*
Rename
`timelessP`
->
`timeless`
(projection of the
`Timeless`
class)
*
Rename
`timelessP`
->
`timeless`
(projection of the
`Timeless`
class)
*
The CMRA axiom
`cmra_extend`
is now stated in
`Type`
, using
`sigT`
instead of
*
The CMRA axiom
`cmra_extend`
is now stated in
`Type`
, using
`sigT`
instead of
in
`Prop`
using
`exists`
. This makes it possible to define the function space
in
`Prop`
using
`exists`
. This makes it possible to define the function space
...
...
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