CHANGELOG.md 7.6 KB
Newer Older
Ralf Jung's avatar
Ralf Jung committed
1 2 3
In this changelog, we document "large-ish" changes to Iris that affect even the
way the logic is used on paper.  We also mention some significant changes in the
Coq development, but not every API-breaking change is listed.  Changes marked
4
`[#]` still need to be ported to the Iris Documentation LaTeX file(s).
5

Ralf Jung's avatar
Ralf Jung committed
6
## Iris 3.1.0 (unfinished)
7

Ralf Jung's avatar
Ralf Jung committed
8 9
Changes in and extensions of the theory:

Ralf Jung's avatar
Ralf Jung committed
10
* [#] Add new modality: ■ ("plainly").
11 12 13 14 15
* [#] Camera morphisms have to be homomorphisms, not just monotone functions.
* [#] A proof that `f` has a fixed point if `f^k` is contractive.
* Constructions for least and greatest fixed points over monotone predicates
  (defined in the logic of Iris using impredicative quantification).
* A proof of the inverse of `wp_bind`.
Ralf Jung's avatar
Ralf Jung committed
16 17 18 19

Changes in Coq:

* Some things got renamed and notation changed:
20 21 22 23 24 25 26 27
  - The unit of a camera: `empty` -> `unit`, `∅` -> `ε`
  - The proof mode type class `IntoOp` -> `IsOp`
  - OFEs with all elements being discrete: `Discrete` -> `OfeDiscrete`
  - OFE elements whose equality is discrete: `Timeless` -> `Discrete`
  - Timeless propositions: `TimelessP` -> `Timeless`
  - Camera elements such that `core x = x`: `Persistent` -> `CoreId`
  - Persistent propositions: `PersistentP` -> `Persistent`
  - The persistent modality: `always` -> `persistently`
Ralf Jung's avatar
Ralf Jung committed
28
  - Consistently SnakeCase identifiers:
29 30 31 32 33 34 35 36 37 38
    + `CMRAMixin` -> `CmraMixin`
    + `CMRAT` -> `CmraT`
    + `CMRATotal` -> `CmraTotal`
    + `CMRAMorphism` -> `CmraMorphism`
    + `CMRADiscrete` -> `CmraDiscrete`
    + `UCMRAMixin` -> `UcmraMixin`
    + `UCMRAT` -> `UcmraT`
    + `DRAMixin` -> `DraMixin`
    + `DRAT` -> `DraT`
    + `STS` -> `Sts`
Ralf Jung's avatar
Ralf Jung committed
39
  - Many lemmas also changed their name.  A partial list:
40 41 42 43 44 45 46 47 48 49 50
    + `impl_wand` -> `impl_wand_1` (it only involves one direction of the
      equivalent)
    + `always_impl_wand` -> `impl_wand`
    + `always_and_sep_l` -> `and_sep_l`
    + `always_and_sep_r` -> `and_sep_r`
    + `always_sep_dup` -> `sep_dup`
    + `wand_impl_always` -> `impl_wand_persistently` (additionally,
      the direction of this equivalence got swapped for consistency's sake)
    + `always_wand_impl` -> `persistently_impl_wand` (additionally, the
      direction of this equivalence got swapped for consistency's sake)
  The following `sed` snippet should get you most of the way:
Ralf Jung's avatar
Ralf Jung committed
51 52 53
```
sed 's/\bPersistentP\b/Persistent/g; s/\bTimelessP\b/Timeless/g; s/\bCMRADiscrete\b/CmraDiscrete/g; s/\bSTS\b/Sts/g' -i $(find -name "*.v")
```
Ralf Jung's avatar
Ralf Jung committed
54 55
* Fix a bunch of consistency issues in the proof mode, and make it overall more
  usable.  In particular:
56 57 58 59 60 61 62 63 64 65 66 67
  - All proof mode tactics start the proof mode if necessary; `iStartProof` is
    no longer needed and should only be used for building custom proof mode
    tactics.
  - Change in the grammar of specialization patterns: `>[...]` -> `[> ...]`
  - Various new specification patterns for `done` and framing.
  - There is common machinery for symbolic execution of pure reductions. This
    is provided by the type classes `PureExec` and `IntoVal`.
  - 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
    mode.
  - Many missing type class instances for distributing connectives have been
    defined.
68 69 70 71 72 73
  - The tactics `iIntros (?)` and `iIntros "!#"` (i.e. `iAlways`) are now
    implemented using type classes. That way, they are more generic, e.g.
    `iIntros (?)` also works when the universal quantifier is below a modality,
    and `iAlways` also works for the plainness modality. A breaking change,
    however, is that these tactics now no longer work when the universal
    quantifier or modality is behind a type class opaque definition.
74 75 76 77 78 79 80 81
* The generic `fill` operation of the `ectxi_language` construct has been
  defined in terms of a left fold instead of a right fold. This gives rise to
  more definitional equalities.
* The big operators have been improved:
  + 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
    definitional equalities.
* Various improvements to `solve_ndisj`.
Ralf Jung's avatar
Ralf Jung committed
82
* Improve handling of pure (non-state-dependent) reductions in heap_lang.
83 84 85 86
* 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
  annotations are now needed.
* The `prelude` folder has been moved to its own project: std++
87

Ralf Jung's avatar
Ralf Jung committed
88
## Iris 3.0.0 (released 2017-01-11)
89

Ralf Jung's avatar
Ralf Jung committed
90 91 92
* There now is a deprecation process.  The modules `*.deprecated` contain
  deprecated notations and definitions that are provided for backwards
  compatibility and will be removed in a future version of Iris.
Ralf Jung's avatar
Ralf Jung committed
93
* View shifts are radically simplified to just internalize frame-preserving
94
  updates.  Weakestpre is defined inside the logic, and invariants and view
Ralf Jung's avatar
Ralf Jung committed
95
  shifts with masks are also coded up inside Iris.  Adequacy of weakestpre is
96
  proven in the logic. The old ownership of the entire physical state is
Ralf Jung's avatar
Ralf Jung committed
97 98
  replaced by a user-selected predicate over physical state that is maintained
  by weakestpre.
99
* Use OFEs instead of COFEs everywhere.  COFEs are only used for solving the
100 101
  recursive domain equation.  As a consequence, CMRAs no longer need a proof of
  completeness.  (The old `cofeT` is provided by `algebra.deprecated`.)
102
* Implement a new agreement construction.  Unlike the old one, this one
103 104
  preserves discreteness.  dec_agree is thus no longer needed and has been moved
  to algebra.deprecated.
105 106 107
* Renaming and moving things around: uPred and the rest of the base logic are in
  `base_logic`, while `program_logic` is for everything involving the general
  Iris notion of a language.
108 109 110 111
* Renaming in prelude.list: Rename `prefix_of` -> `prefix` and `suffix_of` ->
  `suffix` in lemma names, but keep notation ``l1 `prefix_of` l2`` and ``l1
  `suffix_of` l2``.  `` l1 `sublist` l2`` becomes ``l1 `sublist_of` l2``. Rename
  `contains` -> `submseteq` and change `` l1 `contains` l2`` to ``l1 ⊆+ l2``.
Ralf Jung's avatar
Ralf Jung committed
112 113 114 115 116
* Slightly weaker notion of atomicity: an expression is atomic if it reduces in
  one step to something that does not reduce further.
* Changed notation for embedding Coq assertions into Iris.  The new notation is
  ⌜φ⌝.  Also removed `=` and `⊥` from the Iris scope.  (The old notations are
  provided in `base_logic.deprecated`.)
117
* Up-closure of namespaces is now a notation (↑) instead of a coercion.
118 119
* With invariants and the physical state being handled in the logic, there is no
  longer any reason to demand the CMRA unit to be discrete.
Ralf Jung's avatar
Ralf Jung committed
120
* The language can now fork off multiple threads at once.
121 122
* Local Updates (for the authoritative monoid) are now a 4-way relation with
  syntax-directed lemmas proving them.
Ralf Jung's avatar
Ralf Jung committed
123 124 125

## Iris 2.0

Ralf Jung's avatar
Ralf Jung committed
126 127 128 129
* [heap_lang] No longer use dependent types for expressions.  Instead, values
  carry a proof of closedness.  Substitution, closedness and value-ness proofs
  are performed by computation after reflecting into a term langauge that knows
  about values and closed expressions.
130 131
* [program_logic/language] The language does not define its own "atomic"
  predicate.  Instead, atomicity is defined as reducing in one step to a value.
132 133 134 135 136
* [program_logic] Due to a lack of maintenance and usefulness, lifting lemmas
  for Hoare triples are removed.

## Iris 2.0-rc2

Ralf Jung's avatar
Ralf Jung committed
137
This version matches the final ICFP 2016 paper.
138 139

* [algebra] Make the core of an RA or CMRA a partial function.
Ralf Jung's avatar
Ralf Jung committed
140
* [program_logic/lifting] Lifting lemmas no longer round-trip through a
Ralf Jung's avatar
Ralf Jung committed
141 142 143
  user-chosen predicate to define the configurations we can reduce to; they
  directly relate to the operational semantics.  This is equivalent and
  much simpler to read.
Ralf Jung's avatar
Ralf Jung committed
144 145 146

## Iris 2.0-rc1

Ralf Jung's avatar
Ralf Jung committed
147
This is the Coq development and Iris Documentation as submitted to ICFP 2016.