Commit 2708e2c5 authored by Ralf Jung's avatar Ralf Jung

tweak CHANGELOG

parent 682becbf
...@@ -9,16 +9,16 @@ Changes in and extensions of the theory: ...@@ -9,16 +9,16 @@ Changes in and extensions of the theory:
* [#] Add new modality: ■ ("plainly"). * [#] Add new modality: ■ ("plainly").
* [#] Camera morphisms have to be homomorphisms, not just monotone functions. * [#] Camera morphisms have to be homomorphisms, not just monotone functions.
* [#] 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).
* A proof of the inverse of `wp_bind`. * A proof of the inverse of `wp_bind`.
Changes in Coq: Changes in Coq:
* Some things got renamed and notation changed: * Rename some things and change notation:
- The unit of a camera: `empty` -> `unit`, `∅` -> `ε` - The unit of a camera: `empty` -> `unit`, `∅` -> `ε`
- The proof mode type class `IntoOp` -> `IsOp` - A proof mode type class `IntoOp` -> `IsOp`
- OFEs with all elements being discrete: `Discrete` -> `OfeDiscrete` - OFEs with all elements being discrete: `Discrete` -> `OfeDiscrete`
- OFE elements whose equality is discrete: `Timeless` -> `Discrete` - OFE elements whose equality is discrete: `Timeless` -> `Discrete`
- Timeless propositions: `TimelessP` -> `Timeless` - Timeless propositions: `TimelessP` -> `Timeless`
...@@ -64,29 +64,27 @@ sed 's/\bPersistentP\b/Persistent/g; s/\bTimelessP\b/Timeless/g; s/\bCMRADiscret ...@@ -64,29 +64,27 @@ sed 's/\bPersistentP\b/Persistent/g; s/\bTimelessP\b/Timeless/g; s/\bCMRADiscret
- There is a new connective `tc_opaque`, which can be used to make definitions - There is a new connective `tc_opaque`, which can be used to make definitions
opaque for type classes, and thus opaque for most tactics of the proof opaque for type classes, and thus opaque for most tactics of the proof
mode. mode.
- Many missing type class instances for distributing connectives have been - Define Many missing type class instances for distributing connectives.
defined. - Implement the tactics `iIntros (?)` and `iIntros "!#"` (i.e. `iAlways`)
- The tactics `iIntros (?)` and `iIntros "!#"` (i.e. `iAlways`) are now using type classes. This makes them more generic, e.g., `iIntros (?)` also
implemented using type classes. That way, they are more generic, e.g. works when the universal quantifier is below a modality, and `iAlways` also
`iIntros (?)` also works when the universal quantifier is below a modality, works for the plainness modality. A breaking change, however, is that these
and `iAlways` also works for the plainness modality. A breaking change, tactics now no longer work when the universal quantifier or modality is
however, is that these tactics now no longer work when the universal behind a type class opaque definition. Furthermore, this can change the
quantifier or modality is behind a type class opaque definition. name of anonymous identifiers introduced with the "%" pattern.
Furthermore, this can change the name of anonymous identifiers introduced * Define the generic `fill` operation of the `ectxi_language` construct in terms
with the "%" pattern. of a left fold instead of a right fold. This gives rise to more definitional
* The generic `fill` operation of the `ectxi_language` construct has been equalities.
defined in terms of a left fold instead of a right fold. This gives rise to * Improved big operators:
more definitional equalities.
* The big operators have been improved:
+ They are no longer tied to cameras, but work on any monoid + They are no longer tied to cameras, but work on any monoid
+ The version of big operations over lists was redefined so that it enjoy more + The version of big operations over lists was redefined so that it enjoys
definitional equalities. more definitional equalities.
* Various improvements to `solve_ndisj`. * Various improvements to `solve_ndisj`.
* Improve handling of pure (non-state-dependent) reductions in heap_lang. * Improve handling of pure (non-state-dependent) reductions in heap_lang.
* 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.
* The `prelude` folder has been moved to its own project: std++ * Move the `prelude` folder to its own project: std++
## Iris 3.0.0 (released 2017-01-11) ## Iris 3.0.0 (released 2017-01-11)
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment