CHANGELOG.md 4.62 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 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31
Changes in and extensions of the theory:

* [#] CMRA morphisms have to be homomorphisms, not just monotone functions.
* [#] Show that f has a fixed point if f^k is contractive.
* Provide least and greatest fixed point (defined in the logic of Iris).
* Prove the inverse of wp_bind.

Changes in Coq:

* Some things got renamed and notation changed:
  - The unit of a CMRA: empty -> unit, ∅ -> ε
  - IntoOp -> IsOp
* Fix a bunch of consistency issues in the proof mode, and make it overall more
  usable.  In particular:
  - All proof mode tactics start the proof mode if necessary; iStartProof is no
    longer needed.
  - Change in the grammar of specialization patterns: >[...] -> [> ...]
  - ? More stuff ?
* Redefine bigops to get more definitional equalities.
* Improve solve_ndisj.
* Improve handling of pure (non-state-dependent) reductions in heap_lang.
* Use Hint Mode to prevent Coq from making arbitrary guesses in the presence of
  evars.  There are a few places where type annotations are now needed.
* The prelude folder has been moved to its own project: std++
32

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

Ralf Jung's avatar
Ralf Jung committed
35 36 37
* 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
38
* View shifts are radically simplified to just internalize frame-preserving
39
  updates.  Weakestpre is defined inside the logic, and invariants and view
Ralf Jung's avatar
Ralf Jung committed
40
  shifts with masks are also coded up inside Iris.  Adequacy of weakestpre is
41
  proven in the logic. The old ownership of the entire physical state is
Ralf Jung's avatar
Ralf Jung committed
42 43
  replaced by a user-selected predicate over physical state that is maintained
  by weakestpre.
44
* Use OFEs instead of COFEs everywhere.  COFEs are only used for solving the
45 46
  recursive domain equation.  As a consequence, CMRAs no longer need a proof of
  completeness.  (The old `cofeT` is provided by `algebra.deprecated`.)
47
* Implement a new agreement construction.  Unlike the old one, this one
48 49
  preserves discreteness.  dec_agree is thus no longer needed and has been moved
  to algebra.deprecated.
50 51 52
* 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.
53 54 55 56
* 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
57 58 59 60 61
* 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`.)
62
* Up-closure of namespaces is now a notation (↑) instead of a coercion.
63 64
* 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
65
* The language can now fork off multiple threads at once.
66 67
* 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
68 69 70

## Iris 2.0

Ralf Jung's avatar
Ralf Jung committed
71 72 73 74
* [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.
75 76
* [program_logic/language] The language does not define its own "atomic"
  predicate.  Instead, atomicity is defined as reducing in one step to a value.
77 78 79 80 81
* [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
82
This version matches the final ICFP 2016 paper.
83 84

* [algebra] Make the core of an RA or CMRA a partial function.
Ralf Jung's avatar
Ralf Jung committed
85
* [program_logic/lifting] Lifting lemmas no longer round-trip through a
Ralf Jung's avatar
Ralf Jung committed
86 87 88
  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
89 90 91

## Iris 2.0-rc1

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