- 15 Aug, 2017 1 commit
-
-
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 5 commits
-
-
Dan Frumin authored
- Still does not compile
-
Dan Frumin authored
-
Dan Frumin authored
-
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 3 commits
-
-
Dan Frumin authored
-
Dan Frumin authored
-
Dan Frumin authored
-
- 10 Aug, 2017 3 commits
-
-
Dan Frumin authored
-
Dan Frumin authored
-
Dan Frumin authored
-
- 09 Aug, 2017 1 commit
-
-
Dan Frumin authored
-
- 08 Aug, 2017 2 commits
-
-
Dan Frumin authored
-
Dan Frumin authored
- This allows us to get rid of `rewrite !Closed_subst_id.`
-
- 07 Aug, 2017 9 commits
-
-
Dan Frumin authored
-
Dan Frumin authored
-
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
We have to call tac_rel_rec_r in reshape_expr because reshape_expr just decomposes the expression into a `(K',e')` without guaranteeing that `e` is actually head-reducible. Because of that it might be the case that `e` is `K[App (Rec f x e1) e2]`, but `e2` is not a value.
-
Dan Frumin authored
-
Dan Frumin authored
-
- 02 Aug, 2017 1 commit
-
-
Dan Frumin authored
-
- 01 Aug, 2017 1 commit
-
-
Dan Frumin authored
-
- 25 Jul, 2017 1 commit
-
-
Dan Frumin authored
-
- 21 Jul, 2017 1 commit
-
-
Dan Frumin authored
-
- 20 Jul, 2017 3 commits
-
-
Dan Frumin authored
-
Dan Frumin authored
-
Dan Frumin authored
-
- 19 Jul, 2017 2 commits
-
-
Dan Frumin authored
In the interpretation of recursive types
-
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
-
- 16 Jul, 2017 1 commit
-
-
Dan Frumin authored
-
- 14 Jul, 2017 4 commits
-
-
Dan Frumin authored
-
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
-