- 09 Sep, 2017 2 commits
-
-
Robbert Krebbers authored
-
Robbert Krebbers authored
-
- 06 Sep, 2017 1 commit
-
-
Dan Frumin authored
-
- 05 Sep, 2017 2 commits
-
-
Dan Frumin authored
-
Dan Frumin authored
-
- 22 Aug, 2017 1 commit
-
-
Dan Frumin authored
-
- 21 Aug, 2017 2 commits
-
-
Dan Frumin authored
-
Dan Frumin authored
- The typeclass `PureExec e1 e2` controls pure deterministic reductions - General tactics rel_pure_l and rel_pure_r that depend on that typeclass - The same typeclass can be used for WP tactics and tp tactics, potentially
-
- 17 Aug, 2017 1 commit
-
-
Dan Frumin authored
- Use the type of literals in `val` - Notation for `match` - "Better" coercions
-
- 15 Aug, 2017 2 commits
-
-
Dan Frumin authored
- Add more binary ops to the language - An example refinement for module types
-
Dan Frumin authored
Modify the logical relation judment to include an environment Δ that contains a list of semantic types to interpret free type variables.
-
- 14 Aug, 2017 2 commits
-
-
Dan Frumin authored
- Change the types in the examples slightly - Use notations in the examples - Modify some tactics to make the proofs more smooth
-
Dan Frumin authored
-
- 11 Aug, 2017 2 commits
-
-
Dan Frumin authored
-
Dan Frumin authored
-
- 10 Aug, 2017 1 commit
-
-
Dan Frumin authored
-
- 09 Aug, 2017 1 commit
-
-
Dan Frumin authored
-
- 08 Aug, 2017 1 commit
-
-
Dan Frumin authored
- This allows us to get rid of `rewrite !Closed_subst_id.`
-
- 07 Aug, 2017 5 commits
-
-
Dan Frumin authored
-
Dan Frumin authored
- Twiggle with the burden of proof in log_related_arrow - rel_rec_l/r returns a goal with an (unsimplified) lamsubst and can detect locked lambdas - Fix some notational issues [hax.v] - Rewrite the counter refinement proof to make greater use of lamsubst
-
Dan Frumin authored
-
Dan Frumin authored
-
Dan Frumin authored
-
- 20 Jul, 2017 1 commit
-
-
Dan Frumin authored
-
- 19 Jul, 2017 1 commit
-
-
Dan Frumin authored
- rename `bin_log_related_bind_l` to `bin_log_related_wp_l` - use `bin_log_related_wp_l` to simplify derived rules
-
- 17 Jul, 2017 1 commit
-
-
Dan Frumin authored
-
- 14 Jul, 2017 3 commits
-
-
Dan Frumin authored
-
Dan Frumin authored
-
Dan Frumin authored
Using the lambdasubst hack-- instead of formulating lemmas for (App e1 v), formulate them for (e1[x:=v]).
-
- 12 Jul, 2017 1 commit
-
-
Dan Frumin authored
..by introducing a hint database for typeability
-
- 11 Jul, 2017 1 commit
-
-
Dan Frumin authored
- Make sure that arguments to the lemmas are in the consistent order: \Gamma, E1, E2, K, e1, e2, \tau -- from left to right, as you write it on paper - Add masks to all the lemmas - Add missing rules - Remove unnecessary closedness conditions
-
- 04 Jul, 2017 2 commits
-
-
Dan Frumin authored
- Remove commented out code - Pull std++ related lemmas into a separate file
-
Dan Frumin authored
The current prove does not reuse certain lemmas
-
- 03 Jul, 2017 1 commit
-
-
Dan Frumin authored
We are switich away from De Bruijn indices because 1) it's hard to read terms with De Bruijn indices 2) they are making lots of things slower
-
- 08 May, 2017 1 commit
-
-
Dan Frumin authored
-
- 06 May, 2017 1 commit
-
-
Dan Frumin authored
-
- 04 May, 2017 1 commit
-
-
Dan Frumin authored
The new _with_lock rule does not mentioned lower level details of the relational interpretation.
-
- 03 May, 2017 2 commits
-
-
Dan Frumin authored
-
Dan Frumin authored
-
- 18 Apr, 2017 1 commit
-
-
Dan Frumin authored
-