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
Iris
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
Rodolphe Lepigre
Iris
Commits
48419ecc
Commit
48419ecc
authored
Dec 13, 2017
by
Ralf Jung
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
CHANGELOG
parent
3b1fcdab
Changes
1
Show whitespace changes
Inline
Sidebyside
Showing
1 changed file
with
22 additions
and
18 deletions
+22
18
CHANGELOG.md
CHANGELOG.md
+22
18
No files found.
CHANGELOG.md
View file @
48419ecc
...
@@ 7,13 +7,15 @@ Coq development, but not every APIbreaking change is listed. Changes marked
...
@@ 7,13 +7,15 @@ Coq development, but not every APIbreaking change is listed. Changes marked
Changes in and extensions of the theory:
Changes in and extensions of the theory:
*
[Experimental feature] Add new modality: ■ ("plainly").
*
Define
`uPred`
as a quotient on monotone predicates
`M > SProp`
.
*
Define
`uPred`
as a quotient on monotone predicates
`M > SProp`
.
*
Get rid of some primitive laws; they can be derived:
`True ⊢ □ True`
and
`□ (P ∧ Q) ⊢ □ (P ∗ Q)`
*
Camera morphisms have to be homomorphisms, not just monotone functions.
*
Camera morphisms have to be homomorphisms, not just monotone functions.
*
Add a proof that
`f`
has a fixed point if
`f^k`
is contractive.
*
Add a proof that
`f`
has a fixed point if
`f^k`
is contractive.
*
Constructions for least and greatest fixed points over monotone predicates
*
Constructions for least and greatest fixed points over monotone predicates
(defined in the logic of Iris using impredicative quantification).
(defined in the logic of Iris using impredicative quantification).
*
Add a proof of the inverse of
`wp_bind`
.
*
Add a proof of the inverse of
`wp_bind`
.
*
[Experimental feature] Add new modality: ■ ("plainly").
*
[Experimental feature] Support verifying code that might get stuck by
*
[Experimental feature] Support verifying code that might get stuck by
distinguishing "nonstuck" vs. "(potentially) stuck" weakest
distinguishing "nonstuck" vs. "(potentially) stuck" weakest
preconditions. (See [Swasey et al., OOPSLA '17] for examples.) The nonstuck
preconditions. (See [Swasey et al., OOPSLA '17] for examples.) The nonstuck
...
@@ 25,6 +27,18 @@ Changes in and extensions of the theory:
...
@@ 25,6 +27,18 @@ Changes in and extensions of the theory:
Changes in Coq:
Changes in Coq:
*
Move the
`prelude`
folder to its own project: std++
*
Some extensions/improvements of heap_lang:

Improve handling of pure (nonstatedependent) reductions.

Add fetchandadd (
`FAA`
) operation.

Add syntax for all Coq's binary operations on
`Z`
.
*
Generalize
`saved_prop`
to let the user choose the location of the typelevel
later. Rename the general form to
`saved_anything`
. Provide
`saved_prop`
and
`saved_pred`
as special cases.
*
Improved big operators:
+
They are no longer tied to cameras, but work on any monoid
+
The version of big operations over lists was redefined so that it enjoys
more definitional equalities.
*
Rename some things and change notation:
*
Rename some things and change notation:

The unit of a camera:
`empty`
>
`unit`
,
`∅`
>
`ε`

The unit of a camera:
`empty`
>
`unit`
,
`∅`
>
`ε`

Disjointness:
`⊥`
>
`##`

Disjointness:
`⊥`
>
`##`
...
@@ 63,6 +77,8 @@ Changes in Coq:
...
@@ 63,6 +77,8 @@ Changes in Coq:
```
```
sed 's/\bPersistentP\b/Persistent/g; s/\bTimelessP\b/Timeless/g; s/\bCMRADiscrete\b/CmraDiscrete/g; s/\bCMRAT\b/CmraT/g; s/\bCMRAMixin\b/CmraMixin/g; s/\bUCMRAT\b/UcmraT/g; s/\bUCMRAMixin\b/UcmraMixin/g; s/\bSTS\b/Sts/g' i $(find name "*.v")
sed 's/\bPersistentP\b/Persistent/g; s/\bTimelessP\b/Timeless/g; s/\bCMRADiscrete\b/CmraDiscrete/g; s/\bCMRAT\b/CmraT/g; s/\bCMRAMixin\b/CmraMixin/g; s/\bUCMRAT\b/UcmraT/g; s/\bUCMRAMixin\b/UcmraMixin/g; s/\bSTS\b/Sts/g' i $(find name "*.v")
```
```
*
`PersistentL`
and
`TimelessL`
(persistence and timelessness of lists of
propositions) are replaces by
`TCForall`
from std++.
*
Fix a bunch of consistency issues in the proof mode, and make it overall more
*
Fix a bunch of consistency issues in the proof mode, and make it overall more
usable. In particular:
usable. In particular:

All proof mode tactics start the proof mode if necessary;
`iStartProof`
is

All proof mode tactics start the proof mode if necessary;
`iStartProof`
is
...
@@ 84,9 +100,6 @@ sed 's/\bPersistentP\b/Persistent/g; s/\bTimelessP\b/Timeless/g; s/\bCMRADiscret
...
@@ 84,9 +100,6 @@ sed 's/\bPersistentP\b/Persistent/g; s/\bTimelessP\b/Timeless/g; s/\bCMRADiscret
behind a type class opaque definition. Furthermore, this can change the
behind a type class opaque definition. Furthermore, this can change the
name of anonymous identifiers introduced with the "%" pattern.
name of anonymous identifiers introduced with the "%" pattern.
*
Make
`ofe_fun`
dependently typed, subsuming
`iprod`
. The latter got removed.
*
Make
`ofe_fun`
dependently typed, subsuming
`iprod`
. The latter got removed.
*
Generalize
`saved_prop`
to let the user choose the location of the typelevel
later. Rename the general form to
`saved_anything`
. Provide
`saved_prop`
and
`saved_pred`
as special cases.
*
Define the generic
`fill`
operation of the
`ectxi_language`
construct in terms
*
Define the generic
`fill`
operation of the
`ectxi_language`
construct in terms
of a left fold instead of a right fold. This gives rise to more definitional
of a left fold instead of a right fold. This gives rise to more definitional
equalities.
equalities.
...
@@ 95,25 +108,16 @@ sed 's/\bPersistentP\b/Persistent/g; s/\bTimelessP\b/Timeless/g; s/\bCMRADiscret
...
@@ 95,25 +108,16 @@ sed 's/\bPersistentP\b/Persistent/g; s/\bTimelessP\b/Timeless/g; s/\bCMRADiscret
type classes and canonical structures. Also, it now uses explicit mixins. The
type classes and canonical structures. Also, it now uses explicit mixins. The
file
`program_logic/ectxi_language`
contains some documentation on how to
file
`program_logic/ectxi_language`
contains some documentation on how to
setup Iris for your language.
setup Iris for your language.
*
Improved big operators:
*
Restore the original, stronger notion of atomicity alongside the weaker
+
They are no longer tied to cameras, but work on any monoid
notion. These are
`Atomic a e`
where the stuckness bit
`s`
indicates whether
+
The version of big operations over lists was redefined so that it enjoys
expression
`e`
is weakly (
`a = WeaklyAtomic`
) or strongly (
`a =
more definitional equalities
.
StronglyAtomic`
) atomic
.
*
Various improvements to
`solve_ndisj`
.
*
Various improvements to
`solve_ndisj`
.
*
Some extensions/improvements of heap_lang:

Improve handling of pure (nonstatedependent) reductions.

Add fetchandadd (
`FAA`
) operation.

Syntax for all Coq's binary operations on
`Z`
.
*
Use
`Hint Mode`
to prevent Coq from making arbitrary guesses in the presence
*
Use
`Hint Mode`
to prevent Coq from making arbitrary guesses in the presence
of evars, which often led to divergence. There are a few places where type
of evars, which often led to divergence. There are a few places where type
annotations are now needed.
annotations are now needed.
*
Move the
`prelude`
folder to its own project: std++
*
The rules
`internal_eq_rewrite`
and
`internal_eq_rewrite_contractive`
are now
*
The rules
`internal_eq_rewrite`
and
`internal_eq_rewrite_contractive`
are now
stated in the logic, i.e. they are
`iApply`
friendly.
stated in the logic, i.e., they are
`iApply`
friendly.
*
Restore the original, stronger notion of atomicity alongside the weaker
notion. These are
`Atomic a e`
where the stuckness bit
`s`
indicates whether
expression
`e`
is weakly (
`a = WeaklyAtomic`
) or strongly (
`a =
StronglyAtomic`
) atomic.
## Iris 3.0.0 (released 20170111)
## Iris 3.0.0 (released 20170111)
...
...
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