Sat, 22 Jan 2011 15:07:36 -0600 cleaned up tutorial1...added solution file
Christian Urban <urbanc@in.tum.de> [Sat, 22 Jan 2011 15:07:36 -0600] rev 2694
cleaned up tutorial1...added solution file
Sat, 22 Jan 2011 12:46:01 -0600 better version of Tutorial 1
Christian Urban <urbanc@in.tum.de> [Sat, 22 Jan 2011 12:46:01 -0600] rev 2693
better version of Tutorial 1
Fri, 21 Jan 2011 22:58:03 +0100 better flow of proofs and definitions and proof
Christian Urban <urbanc@in.tum.de> [Fri, 21 Jan 2011 22:58:03 +0100] rev 2692
better flow of proofs and definitions and proof
Fri, 21 Jan 2011 22:23:44 +0100 separated type preservation and progress into a separate file
Christian Urban <urbanc@in.tum.de> [Fri, 21 Jan 2011 22:23:44 +0100] rev 2691
separated type preservation and progress into a separate file
Fri, 21 Jan 2011 22:02:34 +0100 substitution lemma in separate file
Christian Urban <urbanc@in.tum.de> [Fri, 21 Jan 2011 22:02:34 +0100] rev 2690
substitution lemma in separate file
Fri, 21 Jan 2011 21:58:51 +0100 added unbind example
Christian Urban <urbanc@in.tum.de> [Fri, 21 Jan 2011 21:58:51 +0100] rev 2689
added unbind example
Fri, 21 Jan 2011 00:55:28 +0100 a bit tuning
Christian Urban <urbanc@in.tum.de> [Fri, 21 Jan 2011 00:55:28 +0100] rev 2688
a bit tuning
Thu, 20 Jan 2011 23:19:30 +0100 first split of tutorrial theory
Christian Urban <urbanc@in.tum.de> [Thu, 20 Jan 2011 23:19:30 +0100] rev 2687
first split of tutorrial theory
Wed, 19 Jan 2011 23:58:12 +0100 added a very rough version of the tutorial; all seems to work
Christian Urban <urbanc@in.tum.de> [Wed, 19 Jan 2011 23:58:12 +0100] rev 2686
added a very rough version of the tutorial; all seems to work
Wed, 19 Jan 2011 19:41:50 +0100 added obtain_fresh lemma; tuned Lambda.thy
Christian Urban <urbanc@in.tum.de> [Wed, 19 Jan 2011 19:41:50 +0100] rev 2685
added obtain_fresh lemma; tuned Lambda.thy
Wed, 19 Jan 2011 19:06:52 +0100 base file for the tutorial (contains definitions for heigt, subst and beta-reduction)
Christian Urban <urbanc@in.tum.de> [Wed, 19 Jan 2011 19:06:52 +0100] rev 2684
base file for the tutorial (contains definitions for heigt, subst and beta-reduction)
Wed, 19 Jan 2011 18:56:28 +0100 ported some of the old proofs to serve as testcases
Christian Urban <urbanc@in.tum.de> [Wed, 19 Jan 2011 18:56:28 +0100] rev 2683
ported some of the old proofs to serve as testcases
Wed, 19 Jan 2011 18:07:29 +0100 added eqvt and supp lemma for removeAll (function from List.thy)
Christian Urban <urbanc@in.tum.de> [Wed, 19 Jan 2011 18:07:29 +0100] rev 2682
added eqvt and supp lemma for removeAll (function from List.thy)
Wed, 19 Jan 2011 17:54:50 +0100 theory name as it should be
Christian Urban <urbanc@in.tum.de> [Wed, 19 Jan 2011 17:54:50 +0100] rev 2681
theory name as it should be
Wed, 19 Jan 2011 17:54:06 +0100 removed diagnostic code
Christian Urban <urbanc@in.tum.de> [Wed, 19 Jan 2011 17:54:06 +0100] rev 2680
removed diagnostic code
Wed, 19 Jan 2011 17:11:10 +0100 added Minimal file to test things
Christian Urban <urbanc@in.tum.de> [Wed, 19 Jan 2011 17:11:10 +0100] rev 2679
added Minimal file to test things
Wed, 19 Jan 2011 07:06:47 +0100 defined height as a function that returns an integer
Christian Urban <urbanc@in.tum.de> [Wed, 19 Jan 2011 07:06:47 +0100] rev 2678
defined height as a function that returns an integer
Tue, 18 Jan 2011 21:28:07 +0100 deleted diagnostic code
Christian Urban <urbanc@in.tum.de> [Tue, 18 Jan 2011 21:28:07 +0100] rev 2677
deleted diagnostic code
Tue, 18 Jan 2011 21:26:58 +0100 some tryes about substitution over type-schemes
Christian Urban <urbanc@in.tum.de> [Tue, 18 Jan 2011 21:26:58 +0100] rev 2676
some tryes about substitution over type-schemes
Tue, 18 Jan 2011 19:27:30 +0100 defined properly substitution
Christian Urban <urbanc@in.tum.de> [Tue, 18 Jan 2011 19:27:30 +0100] rev 2675
defined properly substitution
Tue, 18 Jan 2011 18:04:40 +0100 derived stronger Abs_eq_iff2 theorems
Christian Urban <urbanc@in.tum.de> [Tue, 18 Jan 2011 18:04:40 +0100] rev 2674
derived stronger Abs_eq_iff2 theorems
Tue, 18 Jan 2011 17:30:47 +0100 made alpha_abs_set_stronger1 stronger
Christian Urban <urbanc@in.tum.de> [Tue, 18 Jan 2011 17:30:47 +0100] rev 2673
made alpha_abs_set_stronger1 stronger
Tue, 18 Jan 2011 17:19:50 +0100 removed finiteness assumption from set_rename_perm
Christian Urban <urbanc@in.tum.de> [Tue, 18 Jan 2011 17:19:50 +0100] rev 2672
removed finiteness assumption from set_rename_perm
Tue, 18 Jan 2011 22:11:49 +0900 alpha_abs_set_stronger1
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 18 Jan 2011 22:11:49 +0900] rev 2671
alpha_abs_set_stronger1
Tue, 18 Jan 2011 21:12:25 +0900 alpha_abs_let_stronger is not true in the same form
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 18 Jan 2011 21:12:25 +0900] rev 2670
alpha_abs_let_stronger is not true in the same form
Tue, 18 Jan 2011 11:02:57 +0100 the function translating lambda terms to locally nameless lambda terms; still needs a stronger abs_eq_iff lemma...at the moment only proved for restrictions
Christian Urban <urbanc@in.tum.de> [Tue, 18 Jan 2011 11:02:57 +0100] rev 2669
the function translating lambda terms to locally nameless lambda terms; still needs a stronger abs_eq_iff lemma...at the moment only proved for restrictions
Tue, 18 Jan 2011 06:55:18 +0100 modified the renaming_perm lemmas
Christian Urban <urbanc@in.tum.de> [Tue, 18 Jan 2011 06:55:18 +0100] rev 2668
modified the renaming_perm lemmas
Mon, 17 Jan 2011 17:20:21 +0100 added a translation function from lambda-terms to deBruijn terms (equivariance fails at the moment)
Christian Urban <urbanc@in.tum.de> [Mon, 17 Jan 2011 17:20:21 +0100] rev 2667
added a translation function from lambda-terms to deBruijn terms (equivariance fails at the moment)
Mon, 17 Jan 2011 15:12:03 +0100 added a few examples of functions to Lambda.thy
Christian Urban <urbanc@in.tum.de> [Mon, 17 Jan 2011 15:12:03 +0100] rev 2666
added a few examples of functions to Lambda.thy
Mon, 17 Jan 2011 14:37:18 +0100 exported nominal function code to external file
Christian Urban <urbanc@in.tum.de> [Mon, 17 Jan 2011 14:37:18 +0100] rev 2665
exported nominal function code to external file
(0) -1000 -300 -100 -50 -30 +30 +50 +100 +300 tip