Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Community forum
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
Service Desk
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Operations
Operations
Incidents
Environments
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
ab4ddced
Commit
ab4ddced
authored
Jul 06, 2018
by
Ralf Jung
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
CHANGELOG
parent
3130384d
Changes
1
Hide whitespace changes
Inline
Sidebyside
Showing
1 changed file
with
15 additions
and
6 deletions
+15
6
CHANGELOG.md
CHANGELOG.md
+15
6
No files found.
CHANGELOG.md
View file @
ab4ddced
...
...
@@ 17,15 +17,19 @@ Changes in and extensions of the theory:
*
[#] Add weakest preconditions for total program correctness.
*
[#] "(Potentially) stuck" weakest preconditions are no longer considered
experimental.
*
[#] The Löb rule is now a derived rule; it follows from laterintro, later
being contractive and the fact that we can take fixpoints of contractive
functions.
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:
can now be used with logics derived from Iris (like iGPS), with
nonstepindexed logics and even with nonaffine (i.e., linear) logics. See
<http://irisproject.org/mosel/>
for the corresponding 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
...
...
@@ 38,8 +42,13 @@ Changes in Coq:
invariant to the goal.
*
Added support for defining derived connectives involving nary binders using
telescopes.
*
The proof mode now more consistently "prettifies" the goal after each tactic.
Prettification also simplifies some BI connectives, like conditional
modalities and telescope quantifiers.
*
Improved prettyprinting of Iris connectives (in particular WP and fancy
updates) when Coq has to linewrap the output.
updates) when Coq has to linewrap the output. This goes handinhand with an
improved test suite that also tests prettyprinting.
*
Added a
`gmultiset`
RA.
*
Rename
`timelessP`
>
`timeless`
(projection of the
`Timeless`
class)
*
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
...
...
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