 19 Nov, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored
That range includes tabs and new lines. Thanks Morten for spotting this problem.

 17 Nov, 2016 5 commits


Robbert Krebbers authored

Robbert Krebbers authored
This way we can use set_solver to solve goals involving ∈.

Ralf Jung authored

Ralf Jung authored
This has bothered me repeatedly in proofs, now I finally got around to fix it at the source

Robbert Krebbers authored

 16 Nov, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 15 Nov, 2016 4 commits


Ralf Jung authored

Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored
(These instances are not defined for any FinMap to avoid overlapping instances for EqDecision, which may have awkward consequences for type class search).

 10 Nov, 2016 1 commit


Robbert Krebbers authored
Having Is_true as a type class caused problems with rewrite: when the rewrited lemma has a premise of the shape Is_true, the rewrite tactic will complain that it cannot find a type class instance, instead of generating a goal for that premise.

 07 Nov, 2016 1 commit


JacquesHenri Jourdan authored

 27 Oct, 2016 2 commits
 13 Oct, 2016 1 commit


Ralf Jung authored

 04 Oct, 2016 2 commits


Zhen Zhang authored

Zhen Zhang authored

 03 Oct, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 28 Sep, 2016 2 commits


Robbert Krebbers authored

Robbert Krebbers authored

 27 Sep, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored

Robbert Krebbers authored

 20 Sep, 2016 3 commits


Robbert Krebbers authored

Robbert Krebbers authored
This also solves a name clash with the extension order of CMRAs.

Robbert Krebbers authored

 14 Sep, 2016 1 commit


JacquesHenri Jourdan authored
This makes the typeclass mechanism able to use instances like [Is_true X > Blah], where X reduces to X.

 09 Sep, 2016 2 commits


Robbert Krebbers authored

JacquesHenri Jourdan authored

 29 Aug, 2016 2 commits


Robbert Krebbers authored
This happened for example in <[i:=x]>∅, where simpl unfold insert (despite it being declared simpl never) because ∅ reduces to a constructor.

Ralf Jung authored

 24 Aug, 2016 1 commit


Robbert Krebbers authored

 22 Aug, 2016 3 commits


Robbert Krebbers authored
The previous commit is not really necesarry anymore, but my proof for UIP of types with decidable equality is a bit more general, so I won't revert it.

Robbert Krebbers authored
This way we get rid of the (unused) axiom eq_rect_eq reported by coqchk.

Ralf Jung authored
