 07 Aug, 2017 5 commits


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 headreducible. 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

 11 Jul, 2017 2 commits


Dan Frumin authored

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

 10 Jul, 2017 1 commit


Dan Frumin authored
It can be deduce from [head_reducible e], since values are nonreducible.

 09 Jul, 2017 1 commit


Dan Frumin authored

 06 Jul, 2017 4 commits


Dan Frumin authored

Dan Frumin authored

Dan Frumin authored

Dan Frumin authored

 05 Jul, 2017 1 commit


Dan Frumin authored

 04 Jul, 2017 5 commits


Dan Frumin authored
 Remove commented out code  Pull std++ related lemmas into a separate file

Dan Frumin authored
In this file I will keep all the comments regarding different aspects of formalisation.

Dan Frumin authored
The current prove does not reuse certain lemmas

Dan Frumin authored

Dan Frumin authored
Following the advice of Amin Timany generalize all the compatibility lemmas at the same time by declaring a mask E in a Section.

 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 3 commits


Dan Frumin authored

Dan Frumin authored

Dan Frumin authored
