The proof is not pretty, though...

Thanks to Amin Timany for the suggestion.

add a version of [cancel] that works with goals of the form [_ |- pvs _]; and use that for the barrier proof

This cleans up some ad-hoc stuff and prepares for a generalization
of saved propositions.

And now the part that I forgot to commit.

Now that there is more of it, it deserves its own place :).

start the heap construction: load from a heap is done... store, CAS, and singleton (mapsto) to be done

Notable changes:
* I am now using the same names for the fields of the language record and the
  instances in heap_lang. In order to deal with shadowing, I have put all
  definitions in heap_lang.v in a module.
* Instead of defining evaluation contexts recursively, these are now defined
  using lists. This way we can easily reuse operations on lists. For example,
  composition of evaluation contexts is just appending lists. Also, it allowed
  me to simplify the rather complicated proof of step_by_val as induction on
  the shape of contexts no longer results in a blow-up of the number of cases.
* Use better automation to prove all lemmas of heap_lang.
* I have introduced tactics to invert steps and to do steps. These tactics
  greatly helped simplifying boring parts of lifting lemmas.