Mon, 06 Jun 2011 13:11:04 +0100 slightly stronger property in fundef_ex_prop
Christian Urban <urbanc@in.tum.de> [Mon, 06 Jun 2011 13:11:04 +0100] rev 2820
slightly stronger property in fundef_ex_prop
Sun, 05 Jun 2011 21:14:23 +0100 added an option for an invariant (at the moment only a stub)
Christian Urban <urbanc@in.tum.de> [Sun, 05 Jun 2011 21:14:23 +0100] rev 2819
added an option for an invariant (at the moment only a stub)
Sun, 05 Jun 2011 16:58:18 +0100 added a more general lemma fro fundef_ex1
Christian Urban <urbanc@in.tum.de> [Sun, 05 Jun 2011 16:58:18 +0100] rev 2818
added a more general lemma fro fundef_ex1
Sat, 04 Jun 2011 14:50:57 +0900 Trying the induction on the graph
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sat, 04 Jun 2011 14:50:57 +0900] rev 2817
Trying the induction on the graph
Sat, 04 Jun 2011 09:07:50 +0900 Finish and test the locale approach
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sat, 04 Jun 2011 09:07:50 +0900] rev 2816
Finish and test the locale approach
Fri, 03 Jun 2011 22:31:44 +0900 FiniteSupp precondition in the function is enough to get rid of completeness obligationss
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 03 Jun 2011 22:31:44 +0900] rev 2815
FiniteSupp precondition in the function is enough to get rid of completeness obligationss
Fri, 03 Jun 2011 12:46:23 +0100 recursion combinator inside a locale
Christian Urban <urbanc@in.tum.de> [Fri, 03 Jun 2011 12:46:23 +0100] rev 2814
recursion combinator inside a locale
Fri, 03 Jun 2011 18:33:11 +0900 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 03 Jun 2011 18:33:11 +0900] rev 2813
merge
Fri, 03 Jun 2011 18:32:22 +0900 F for lambda used to define translation to locally nameless
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 03 Jun 2011 18:32:22 +0900] rev 2812
F for lambda used to define translation to locally nameless
Thu, 02 Jun 2011 16:15:18 +0100 typo
Christian Urban <urbanc@in.tum.de> [Thu, 02 Jun 2011 16:15:18 +0100] rev 2811
typo
Thu, 02 Jun 2011 15:35:33 +0100 removed dead code
Christian Urban <urbanc@in.tum.de> [Thu, 02 Jun 2011 15:35:33 +0100] rev 2810
removed dead code
Thu, 02 Jun 2011 22:24:33 +0900 finished the missing obligations
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 02 Jun 2011 22:24:33 +0900] rev 2809
finished the missing obligations
Thu, 02 Jun 2011 12:14:03 +0100 merged
Christian Urban <urbanc@in.tum.de> [Thu, 02 Jun 2011 12:14:03 +0100] rev 2808
merged
Thu, 02 Jun 2011 12:09:31 +0100 a test with a recursion combinator defined on top of nominal_primrec
Christian Urban <urbanc@in.tum.de> [Thu, 02 Jun 2011 12:09:31 +0100] rev 2807
a test with a recursion combinator defined on top of nominal_primrec
Thu, 02 Jun 2011 16:41:09 +0900 Use FCB to simplify proof
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 02 Jun 2011 16:41:09 +0900] rev 2806
Use FCB to simplify proof
Thu, 02 Jun 2011 10:11:50 +0900 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 02 Jun 2011 10:11:50 +0900] rev 2805
merge
Thu, 02 Jun 2011 10:09:23 +0900 Remove SMT
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 02 Jun 2011 10:09:23 +0900] rev 2804
Remove SMT
Wed, 01 Jun 2011 22:55:14 +0100 hopefully final fix for ho-functions
Christian Urban <urbanc@in.tum.de> [Wed, 01 Jun 2011 22:55:14 +0100] rev 2803
hopefully final fix for ho-functions
Wed, 01 Jun 2011 21:03:30 +0100 first test to fix the problem with free variables
Christian Urban <urbanc@in.tum.de> [Wed, 01 Jun 2011 21:03:30 +0100] rev 2802
first test to fix the problem with free variables
Wed, 01 Jun 2011 16:13:42 +0900 proved subst for All constructor in type schemes.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 01 Jun 2011 16:13:42 +0900] rev 2801
proved subst for All constructor in type schemes.
Wed, 01 Jun 2011 13:41:30 +0900 DB translation using index; easier to reason about.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 01 Jun 2011 13:41:30 +0900] rev 2800
DB translation using index; easier to reason about.
Wed, 01 Jun 2011 13:35:37 +0900 Problem: free variables in the goal
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 01 Jun 2011 13:35:37 +0900] rev 2799
Problem: free variables in the goal
Wed, 01 Jun 2011 11:01:39 +0900 fixed previous commit
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 01 Jun 2011 11:01:39 +0900] rev 2798
fixed previous commit
Wed, 01 Jun 2011 10:59:07 +0900 equivariance of db_trans
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 01 Jun 2011 10:59:07 +0900] rev 2797
equivariance of db_trans
Tue, 31 May 2011 12:22:28 +0100 fixed the problem with cps-like functions
Christian Urban <urbanc@in.tum.de> [Tue, 31 May 2011 12:22:28 +0100] rev 2796
fixed the problem with cps-like functions
Tue, 31 May 2011 14:12:31 +0900 DeBruijn translation in a simplifier friendly way
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 31 May 2011 14:12:31 +0900] rev 2795
DeBruijn translation in a simplifier friendly way
Tue, 31 May 2011 13:25:35 +0900 map_term can be defined when equivariance is assumed
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 31 May 2011 13:25:35 +0900] rev 2794
map_term can be defined when equivariance is assumed
Tue, 31 May 2011 13:21:00 +0900 map_term is not a function the way it is defined
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 31 May 2011 13:21:00 +0900] rev 2793
map_term is not a function the way it is defined
Tue, 31 May 2011 12:59:10 +0900 Defined translation from nominal to de-Bruijn; with a freshness condition for the lambda case.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 31 May 2011 12:59:10 +0900] rev 2792
Defined translation from nominal to de-Bruijn; with a freshness condition for the lambda case.
Tue, 31 May 2011 12:54:21 +0900 Simple eqvt proofs with perm_simps for clarity
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 31 May 2011 12:54:21 +0900] rev 2791
Simple eqvt proofs with perm_simps for clarity
(0) -1000 -300 -100 -50 -30 +30 +50 +100 +300 tip