Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
I
iriscoq
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Janno
iriscoq
Commits
abc98e0a
Commit
abc98e0a
authored
Jul 02, 2018
by
Ralf Jung
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
CHANGELOG
parent
29c965ba
Changes
1
Hide whitespace changes
Inline
Sidebyside
Showing
1 changed file
with
21 additions
and
0 deletions
+21
0
CHANGELOG.md
CHANGELOG.md
+21
0
No files found.
CHANGELOG.md
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 allnew generalized proofmode that abstracts away from Iris! The proofmode
can now be used with nonstepindexed and even nonaffine (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`
.

Bigops 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 prettyprinting of Iris connectives (in particular WP and fancy
updates) when Coq has to linewrap 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
...
...
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