Skip to content
Snippets Groups Projects
Commit c5c0d373 authored by Robbert Krebbers's avatar Robbert Krebbers
Browse files

Allow memory refinements to behave like simple renaming.

Memory refinements now carry a boolean parameter that has the following
meaning:

[false] : Behave like a simple renaming of memories that merely allows to
          permute object identifiers. It does not allow to refine memories
          into a more defined version.
[true]  : Behave like before. Objects can be injected, and memory contents can
          be refined into a more defined variant.

We make refinements parametric in these two variant to avoid code duplication,
and because the [false] variant is a special case of the [true] variant.

For completeness of the executable semantics, we now use the [false] variant.
parent 68254659
No related branches found
No related tags found
No related merge requests found
...@@ -744,6 +744,8 @@ Class FreshSpec A C `{ElemOf A C, ...@@ -744,6 +744,8 @@ Class FreshSpec A C `{ElemOf A C,
(** * Booleans *) (** * Booleans *)
(** The following coercion allows us to use Booleans as propositions. *) (** The following coercion allows us to use Booleans as propositions. *)
Coercion Is_true : bool >-> Sortclass. Coercion Is_true : bool >-> Sortclass.
Hint Unfold Is_true.
Hint Resolve orb_prop_intro andb_prop_intro.
Notation "(&&)" := andb (only parsing). Notation "(&&)" := andb (only parsing).
Notation "(||)" := orb (only parsing). Notation "(||)" := orb (only parsing).
Infix "&&*" := (zip_with (&&)) (at level 40). Infix "&&*" := (zip_with (&&)) (at level 40).
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment