Wed, 03 Feb 2010 14:22:25 +0100 Cezary Kaliszyk merge
Wed, 03 Feb 2010 14:19:53 +0100 Cezary Kaliszyk Lets are ok.
Wed, 03 Feb 2010 14:15:07 +0100 Christian Urban merged
Wed, 03 Feb 2010 14:12:50 +0100 Christian Urban added type-scheme example
Wed, 03 Feb 2010 13:00:37 +0100 Cezary Kaliszyk merge
Wed, 03 Feb 2010 13:00:07 +0100 Cezary Kaliszyk Definitions for trm5
Wed, 03 Feb 2010 12:58:02 +0100 Christian Urban another adaptation for the eqvt-change
Wed, 03 Feb 2010 12:45:06 +0100 Christian Urban merged
Wed, 03 Feb 2010 12:44:29 +0100 Christian Urban fixed proofs that broke because of eqvt
Wed, 03 Feb 2010 12:34:53 +0100 Cezary Kaliszyk Minor fix.
Wed, 03 Feb 2010 12:34:01 +0100 Cezary Kaliszyk merge
Wed, 03 Feb 2010 12:29:45 +0100 Cezary Kaliszyk alpha5 pseudo-injective
Wed, 03 Feb 2010 12:31:58 +0100 Christian Urban fixed proofs in Abs.thy
Wed, 03 Feb 2010 12:13:22 +0100 Christian Urban merged
Wed, 03 Feb 2010 12:06:10 +0100 Christian Urban added a first eqvt_tac which pushes permutations inside terms
Wed, 03 Feb 2010 12:11:23 +0100 Cezary Kaliszyk The alpha-equivalence relation for let-rec. Not sure if correct...
Wed, 03 Feb 2010 11:47:37 +0100 Cezary Kaliszyk Starting with a let-rec example.
Wed, 03 Feb 2010 11:21:34 +0100 Cezary Kaliszyk Minor
Wed, 03 Feb 2010 10:50:24 +0100 Cezary Kaliszyk Some cleaning and eqvt proof
Wed, 03 Feb 2010 09:25:21 +0100 Cezary Kaliszyk The trm1_support lemma explicitly and stated a strong induction principle.
Wed, 03 Feb 2010 08:32:24 +0100 Cezary Kaliszyk More ingredients in Terms.
Tue, 02 Feb 2010 17:10:42 +0100 Cezary Kaliszyk Finished the supp_fv proof; first proof that analyses the structure of 'Let' :)
Tue, 02 Feb 2010 16:51:00 +0100 Cezary Kaliszyk More in Terms
Tue, 02 Feb 2010 14:55:07 +0100 Cezary Kaliszyk First experiments in Terms.
Tue, 02 Feb 2010 13:10:46 +0100 Cezary Kaliszyk LF ported to alpha_gen, equivp solved and one of the missing proofs in support<-> fv solved. Still some supp properties left.
Tue, 02 Feb 2010 12:48:12 +0100 Cezary Kaliszyk Disambiguating the syntax.
Tue, 02 Feb 2010 12:36:01 +0100 Cezary Kaliszyk Minor uncommited changes from LamEx2.
Tue, 02 Feb 2010 11:56:37 +0100 Cezary Kaliszyk Some equivariance machinery that comes useful in LF.
Tue, 02 Feb 2010 11:23:17 +0100 Cezary Kaliszyk Generalized the eqvt proof for single binders.
Tue, 02 Feb 2010 10:43:48 +0100 Cezary Kaliszyk With induct instead of induct_tac, just one induction is sufficient.
(0) -1000 -300 -100 -50 -30 +30 +50 +100 +300 +1000 tip