Tue, 07 Jun 2011 23:38:39 +0900 Proof of trans with invariant
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 07 Jun 2011 23:38:39 +0900] rev 2824
Proof of trans with invariant
Tue, 07 Jun 2011 23:22:58 +0900 Testing invariant in Lambda_F_T
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 07 Jun 2011 23:22:58 +0900] rev 2823
Testing invariant in Lambda_F_T
Tue, 07 Jun 2011 10:40:06 +0100 cleaned ups a bit the examples with the invariant framework; exported nominal_function_config datatype into separate structure and file
Christian Urban <urbanc@in.tum.de> [Tue, 07 Jun 2011 10:40:06 +0100] rev 2822
cleaned ups a bit the examples with the invariant framework; exported nominal_function_config datatype into separate structure and file
Tue, 07 Jun 2011 08:52:59 +0100 fixed problem with earlier commit about nominal_function_common; added facility for specifying an invariant - added a definition of frees_set which need a finiteness invariant
Christian Urban <urbanc@in.tum.de> [Tue, 07 Jun 2011 08:52:59 +0100] rev 2821
fixed problem with earlier commit about nominal_function_common; added facility for specifying an invariant - added a definition of frees_set which need a finiteness invariant
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
Tue, 31 May 2011 00:36:16 +0100 tuned last commit
Christian Urban <urbanc@in.tum.de> [Tue, 31 May 2011 00:36:16 +0100] rev 2790
tuned last commit
Tue, 31 May 2011 00:17:22 +0100 functions involving if and case do not throw exceptions anymore; but eqvt_at assumption has now a precondition
Christian Urban <urbanc@in.tum.de> [Tue, 31 May 2011 00:17:22 +0100] rev 2789
functions involving if and case do not throw exceptions anymore; but eqvt_at assumption has now a precondition
Thu, 26 May 2011 06:36:29 +0200 updated to new Isabelle
Christian Urban <urbanc@in.tum.de> [Thu, 26 May 2011 06:36:29 +0200] rev 2788
updated to new Isabelle
Wed, 25 May 2011 21:38:50 +0200 added eq_iff and distinct lemmas of nominal datatypes to the simplifier
Christian Urban <urbanc@in.tum.de> [Wed, 25 May 2011 21:38:50 +0200] rev 2787
added eq_iff and distinct lemmas of nominal datatypes to the simplifier
Tue, 24 May 2011 19:39:38 +0200 more on slides
Christian Urban <urbanc@in.tum.de> [Tue, 24 May 2011 19:39:38 +0200] rev 2786
more on slides
Sun, 22 May 2011 10:20:18 +0200 added slides for copenhagen
Christian Urban <urbanc@in.tum.de> [Sun, 22 May 2011 10:20:18 +0200] rev 2785
added slides for copenhagen
Sat, 14 May 2011 10:16:16 +0100 added a problem with inductive_cases (reported by Randy)
Christian Urban <urbanc@in.tum.de> [Sat, 14 May 2011 10:16:16 +0100] rev 2784
added a problem with inductive_cases (reported by Randy)
Fri, 13 May 2011 14:50:17 +0100 misc
Christian Urban <urbanc@in.tum.de> [Fri, 13 May 2011 14:50:17 +0100] rev 2783
misc
Tue, 10 May 2011 17:10:22 +0100 made the subtyping work again
Christian Urban <urbanc@in.tum.de> [Tue, 10 May 2011 17:10:22 +0100] rev 2782
made the subtyping work again
Tue, 10 May 2011 07:47:06 +0100 updated to new Isabelle (> 9 May)
Christian Urban <urbanc@in.tum.de> [Tue, 10 May 2011 07:47:06 +0100] rev 2781
updated to new Isabelle (> 9 May)
Mon, 09 May 2011 04:49:58 +0100 merged
Christian Urban <urbanc@in.tum.de> [Mon, 09 May 2011 04:49:58 +0100] rev 2780
merged
Tue, 03 May 2011 15:39:30 +0100 added two mutual recursive inductive definitions
Christian Urban <urbanc@in.tum.de> [Tue, 03 May 2011 15:39:30 +0100] rev 2779
added two mutual recursive inductive definitions
Tue, 03 May 2011 13:25:02 +0100 deleted two functions from the API
Christian Urban <urbanc@in.tum.de> [Tue, 03 May 2011 13:25:02 +0100] rev 2778
deleted two functions from the API
Tue, 03 May 2011 13:09:08 +0100 proved that lfp is equivariant (that simplifies equivariance proofs of inductively defined predicates)
Christian Urban <urbanc@in.tum.de> [Tue, 03 May 2011 13:09:08 +0100] rev 2777
proved that lfp is equivariant (that simplifies equivariance proofs of inductively defined predicates)
Mon, 09 May 2011 04:46:43 +0100 more on pearl-paper
Christian Urban <urbanc@in.tum.de> [Mon, 09 May 2011 04:46:43 +0100] rev 2776
more on pearl-paper
Wed, 04 May 2011 15:27:04 +0800 more on pearl-paper
Christian Urban <urbanc@in.tum.de> [Wed, 04 May 2011 15:27:04 +0800] rev 2775
more on pearl-paper
Mon, 02 May 2011 13:01:02 +0800 updated Quotient paper so that it compiles again
Christian Urban <urbanc@in.tum.de> [Mon, 02 May 2011 13:01:02 +0800] rev 2774
updated Quotient paper so that it compiles again
Thu, 28 Apr 2011 11:51:01 +0800 merged
Christian Urban <urbanc@in.tum.de> [Thu, 28 Apr 2011 11:51:01 +0800] rev 2773
merged
Thu, 28 Apr 2011 11:44:36 +0800 added slides for beijing
Christian Urban <urbanc@in.tum.de> [Thu, 28 Apr 2011 11:44:36 +0800] rev 2772
added slides for beijing
Fri, 22 Apr 2011 00:18:25 +0800 more to the pearl paper
Christian Urban <urbanc@in.tum.de> [Fri, 22 Apr 2011 00:18:25 +0800] rev 2771
more to the pearl paper
Tue, 19 Apr 2011 13:03:08 +0100 updated to snapshot Isabelle 19 April
Christian Urban <urbanc@in.tum.de> [Tue, 19 Apr 2011 13:03:08 +0100] rev 2770
updated to snapshot Isabelle 19 April
Mon, 18 Apr 2011 15:57:45 +0100 merged
Christian Urban <urbanc@in.tum.de> [Mon, 18 Apr 2011 15:57:45 +0100] rev 2769
merged
Mon, 18 Apr 2011 15:56:07 +0100 added permute_pure back into the nominal_inductive procedure; updated to Isabelle 17 April
Christian Urban <urbanc@in.tum.de> [Mon, 18 Apr 2011 15:56:07 +0100] rev 2768
added permute_pure back into the nominal_inductive procedure; updated to Isabelle 17 April
Fri, 15 Apr 2011 15:20:56 +0900 New way of forward elimination of Abs1_eq and simplifications of the function obligation proofs.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 15 Apr 2011 15:20:56 +0900] rev 2767
New way of forward elimination of Abs1_eq and simplifications of the function obligation proofs.
Wed, 13 Apr 2011 13:44:25 +0100 merged
Christian Urban <urbanc@in.tum.de> [Wed, 13 Apr 2011 13:44:25 +0100] rev 2766
merged
Wed, 13 Apr 2011 13:41:52 +0100 introduced framework for finetuning eqvt-rules; this solves problem with permute_pure called in nominal_inductive
Christian Urban <urbanc@in.tum.de> [Wed, 13 Apr 2011 13:41:52 +0100] rev 2765
introduced framework for finetuning eqvt-rules; this solves problem with permute_pure called in nominal_inductive
(0) -1000 -300 -100 -60 +60 +100 +300 tip