2011-06-20 Update TODO
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 20 Jun 2011 09:36:16 +0900] rev 2873
Update TODO
2011-06-20 Let/minor
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 20 Jun 2011 09:29:42 +0900] rev 2872
Let/minor
2011-06-19 Update Quotient/TODO and remove some attic code
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 20 Jun 2011 08:50:13 +0900] rev 2871
Update Quotient/TODO and remove some attic code
2011-06-19 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 19 Jun 2011 13:14:37 +0900] rev 2870
merge
2011-06-19 little on cps2
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 19 Jun 2011 13:10:15 +0900] rev 2869
little on cps2
2011-06-16 got rid of the boolean flag in the raw_equivariance function
Christian Urban <urbanc@in.tum.de> [Thu, 16 Jun 2011 20:07:03 +0100] rev 2868
got rid of the boolean flag in the raw_equivariance function
2011-06-16 Fix
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 16 Jun 2011 23:11:50 +0900] rev 2867
Fix
2011-06-16 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 16 Jun 2011 22:00:52 +0900] rev 2866
merge
2011-06-16 CPS3 can be defined with eqvt_rhs.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 16 Jun 2011 21:23:38 +0900] rev 2865
CPS3 can be defined with eqvt_rhs.
2011-06-16 moved for the moment CPS translations into the example directory
Christian Urban <urbanc@in.tum.de> [Thu, 16 Jun 2011 13:32:36 +0100] rev 2864
moved for the moment CPS translations into the example directory
2011-06-16 merged
Christian Urban <urbanc@in.tum.de> [Thu, 16 Jun 2011 13:14:53 +0100] rev 2863
merged
2011-06-16 added eqvt_at and invariant for boths sides of the equations
Christian Urban <urbanc@in.tum.de> [Thu, 16 Jun 2011 13:14:16 +0100] rev 2862
added eqvt_at and invariant for boths sides of the equations
2011-06-16 Added the CPS translation experiments. CPS1 comes with all the proofs, CPS2,3 just have the function and need eqvt_rhs to finish the obligations.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 16 Jun 2011 20:56:30 +0900] rev 2861
Added the CPS translation experiments. CPS1 comes with all the proofs, CPS2,3 just have the function and need eqvt_rhs to finish the obligations.
2011-06-16 added a test that every function must be of pt-sort
Christian Urban <urbanc@in.tum.de> [Thu, 16 Jun 2011 12:12:25 +0100] rev 2860
added a test that every function must be of pt-sort
2011-06-16 all tests work again
Christian Urban <urbanc@in.tum.de> [Thu, 16 Jun 2011 11:03:01 +0100] rev 2859
all tests work again
2011-06-15 added size-lemmas to simplifier; as a result termination can be proved by the standard lexicographic_order method
Christian Urban <urbanc@in.tum.de> [Wed, 15 Jun 2011 22:36:59 +0100] rev 2858
added size-lemmas to simplifier; as a result termination can be proved by the standard lexicographic_order method
2011-06-15 added an abstract
Christian Urban <urbanc@in.tum.de> [Wed, 15 Jun 2011 12:52:48 +0100] rev 2857
added an abstract
2011-06-15 added a stub for function paper; "isabelle make fnpaper"
Christian Urban <urbanc@in.tum.de> [Wed, 15 Jun 2011 12:32:40 +0100] rev 2856
added a stub for function paper; "isabelle make fnpaper"
2011-06-15 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 15 Jun 2011 11:06:48 +0900] rev 2855
merge
2011-06-15 one TODO and one Problem?
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 15 Jun 2011 11:06:31 +0900] rev 2854
one TODO and one Problem?
2011-06-15 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 15 Jun 2011 09:51:26 +0900] rev 2853
merge
2011-06-15 Some TODOs
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 15 Jun 2011 09:50:53 +0900] rev 2852
Some TODOs
2011-06-15 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 15 Jun 2011 09:31:59 +0900] rev 2851
merge
2011-06-15 TypeSchemes work with 'default'.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 15 Jun 2011 09:25:36 +0900] rev 2850
TypeSchemes work with 'default'.
2011-06-14 tuned some proofs
Christian Urban <urbanc@in.tum.de> [Tue, 14 Jun 2011 19:11:44 +0100] rev 2849
tuned some proofs
2011-06-14 fixed the problem when giving a complex default-term; the fundef lemmas in Nominal_Base were not general enough
Christian Urban <urbanc@in.tum.de> [Tue, 14 Jun 2011 14:07:07 +0100] rev 2848
fixed the problem when giving a complex default-term; the fundef lemmas in Nominal_Base were not general enough
2011-06-14 tuned
Christian Urban <urbanc@in.tum.de> [Tue, 14 Jun 2011 11:43:06 +0100] rev 2847
tuned
2011-06-10 Move working examples before non-working ones
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 10 Jun 2011 15:52:17 +0900] rev 2846
Move working examples before non-working ones
2011-06-10 Optimized proofs and removed some garbage.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 10 Jun 2011 15:45:49 +0900] rev 2845
Optimized proofs and removed some garbage.
2011-06-10 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 10 Jun 2011 15:31:14 +0900] rev 2844
merge
2011-06-10 Slightly modify fcb for list1 and put in common place.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 10 Jun 2011 15:30:09 +0900] rev 2843
Slightly modify fcb for list1 and put in common place.
2011-06-10 Experiments with Let
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 10 Jun 2011 09:00:24 +0900] rev 2842
Experiments with Let
2011-06-09 Eval can be defined with additional freshness
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 09 Jun 2011 15:34:51 +0900] rev 2841
Eval can be defined with additional freshness
2011-06-09 Minor simplification
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 09 Jun 2011 15:03:58 +0900] rev 2840
Minor simplification
2011-06-09 abs_res_fcb will be enough to finish the multiple-recursive proof, if we have a working 'default'.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 09 Jun 2011 11:10:41 +0900] rev 2839
abs_res_fcb will be enough to finish the multiple-recursive proof, if we have a working 'default'.
2011-06-09 More experiments with 'default'
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 09 Jun 2011 09:44:51 +0900] rev 2838
More experiments with 'default'
2011-06-08 Finished the proof with the invariant
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 08 Jun 2011 21:44:03 +0900] rev 2837
Finished the proof with the invariant
2011-06-08 Issue with 'default'
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 08 Jun 2011 21:32:35 +0900] rev 2836
Issue with 'default'
2011-06-08 merged
Christian Urban <urbanc@in.tum.de> [Wed, 08 Jun 2011 12:30:56 +0100] rev 2835
merged
2011-06-08 merged
Christian Urban <urbanc@in.tum.de> [Wed, 08 Jun 2011 12:30:46 +0100] rev 2834
merged
2011-06-08 using the option "default" the function package allows one to give an explicit default value
Christian Urban <urbanc@in.tum.de> [Wed, 08 Jun 2011 08:44:01 +0100] rev 2833
using the option "default" the function package allows one to give an explicit default value
2011-06-08 Simpler proof of TypeSchemes/substs
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 08 Jun 2011 17:52:06 +0900] rev 2832
Simpler proof of TypeSchemes/substs
2011-06-08 Simplify fcb_res
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 08 Jun 2011 17:25:54 +0900] rev 2831
Simplify fcb_res
2011-06-08 FCB for res binding and simplified proof of subst for type schemes
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 08 Jun 2011 09:56:39 +0900] rev 2830
FCB for res binding and simplified proof of subst for type schemes
2011-06-07 Simplify ln-trans proof
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 08 Jun 2011 07:06:20 +0900] rev 2829
Simplify ln-trans proof
2011-06-07 cbvs can be easily defined without an invariant
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 08 Jun 2011 07:02:52 +0900] rev 2828
cbvs can be easily defined without an invariant
2011-06-07 defined the "count-bound-variables-occurences" function which has an accumulator like trans
Christian Urban <urbanc@in.tum.de> [Tue, 07 Jun 2011 20:58:00 +0100] rev 2827
defined the "count-bound-variables-occurences" function which has an accumulator like trans
2011-06-07 merged
Christian Urban <urbanc@in.tum.de> [Tue, 07 Jun 2011 17:45:38 +0100] rev 2826
merged
2011-06-07 remove garbage (proofs that assumes the invariant outside function)
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 07 Jun 2011 23:42:12 +0900] rev 2825
remove garbage (proofs that assumes the invariant outside function)
2011-06-07 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
2011-06-07 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
2011-06-07 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
2011-06-07 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
2011-06-06 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
2011-06-05 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)
2011-06-05 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
2011-06-04 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
2011-06-04 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
2011-06-03 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
2011-06-03 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
2011-06-03 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 03 Jun 2011 18:33:11 +0900] rev 2813
merge
2011-06-03 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
2011-06-02 typo
Christian Urban <urbanc@in.tum.de> [Thu, 02 Jun 2011 16:15:18 +0100] rev 2811
typo
2011-06-02 removed dead code
Christian Urban <urbanc@in.tum.de> [Thu, 02 Jun 2011 15:35:33 +0100] rev 2810
removed dead code
2011-06-02 finished the missing obligations
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 02 Jun 2011 22:24:33 +0900] rev 2809
finished the missing obligations
2011-06-02 merged
Christian Urban <urbanc@in.tum.de> [Thu, 02 Jun 2011 12:14:03 +0100] rev 2808
merged
2011-06-02 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
2011-06-02 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
2011-06-02 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 02 Jun 2011 10:11:50 +0900] rev 2805
merge
2011-06-02 Remove SMT
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 02 Jun 2011 10:09:23 +0900] rev 2804
Remove SMT
2011-06-01 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
2011-06-01 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
2011-06-01 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.
2011-06-01 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.
2011-06-01 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
2011-06-01 fixed previous commit
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 01 Jun 2011 11:01:39 +0900] rev 2798
fixed previous commit
2011-06-01 equivariance of db_trans
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 01 Jun 2011 10:59:07 +0900] rev 2797
equivariance of db_trans
2011-05-31 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
2011-05-31 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
2011-05-31 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
2011-05-31 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
2011-05-31 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.
2011-05-31 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
2011-05-30 tuned last commit
Christian Urban <urbanc@in.tum.de> [Tue, 31 May 2011 00:36:16 +0100] rev 2790
tuned last commit
2011-05-30 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
2011-05-26 updated to new Isabelle
Christian Urban <urbanc@in.tum.de> [Thu, 26 May 2011 06:36:29 +0200] rev 2788
updated to new Isabelle
2011-05-25 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
2011-05-24 more on slides
Christian Urban <urbanc@in.tum.de> [Tue, 24 May 2011 19:39:38 +0200] rev 2786
more on slides
2011-05-22 added slides for copenhagen
Christian Urban <urbanc@in.tum.de> [Sun, 22 May 2011 10:20:18 +0200] rev 2785
added slides for copenhagen
2011-05-14 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)
2011-05-13 misc
Christian Urban <urbanc@in.tum.de> [Fri, 13 May 2011 14:50:17 +0100] rev 2783
misc
2011-05-10 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
2011-05-10 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)
2011-05-09 merged
Christian Urban <urbanc@in.tum.de> [Mon, 09 May 2011 04:49:58 +0100] rev 2780
merged
2011-05-03 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
2011-05-03 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
2011-05-03 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)
2011-05-09 more on pearl-paper
Christian Urban <urbanc@in.tum.de> [Mon, 09 May 2011 04:46:43 +0100] rev 2776
more on pearl-paper
2011-05-04 more on pearl-paper
Christian Urban <urbanc@in.tum.de> [Wed, 04 May 2011 15:27:04 +0800] rev 2775
more on pearl-paper
2011-05-02 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
2011-04-28 merged
Christian Urban <urbanc@in.tum.de> [Thu, 28 Apr 2011 11:51:01 +0800] rev 2773
merged
2011-04-28 added slides for beijing
Christian Urban <urbanc@in.tum.de> [Thu, 28 Apr 2011 11:44:36 +0800] rev 2772
added slides for beijing
2011-04-21 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
2011-04-19 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
2011-04-18 merged
Christian Urban <urbanc@in.tum.de> [Mon, 18 Apr 2011 15:57:45 +0100] rev 2769
merged
2011-04-18 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
2011-04-15 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.
2011-04-13 merged
Christian Urban <urbanc@in.tum.de> [Wed, 13 Apr 2011 13:44:25 +0100] rev 2766
merged
2011-04-13 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
2011-04-12 shanghai slides
Christian Urban <urbanc@in.tum.de> [Tue, 12 Apr 2011 15:46:35 +0800] rev 2764
shanghai slides
2011-04-11 pictures for slides
Christian Urban <urbanc@in.tum.de> [Mon, 11 Apr 2011 02:25:25 +0100] rev 2763
pictures for slides
2011-04-11 Shanghai slides
Christian Urban <urbanc@in.tum.de> [Mon, 11 Apr 2011 02:04:11 +0100] rev 2762
Shanghai slides
2011-04-10 more paper
Christian Urban <urbanc@in.tum.de> [Sun, 10 Apr 2011 14:13:55 +0800] rev 2761
more paper
2011-04-09 eqvt of supp and fresh is proved using equivariance infrastructure
Christian Urban <urbanc@in.tum.de> [Sun, 10 Apr 2011 07:41:52 +0800] rev 2760
eqvt of supp and fresh is proved using equivariance infrastructure
2011-04-09 more paper
Christian Urban <urbanc@in.tum.de> [Sun, 10 Apr 2011 04:07:15 +0800] rev 2759
more paper
2011-04-09 more on the paper
Christian Urban <urbanc@in.tum.de> [Sat, 09 Apr 2011 13:44:49 +0800] rev 2758
more on the paper
2011-04-08 tuned paper
Christian Urban <urbanc@in.tum.de> [Sat, 09 Apr 2011 00:29:40 +0100] rev 2757
tuned paper
2011-04-08 tuned paper
Christian Urban <urbanc@in.tum.de> [Sat, 09 Apr 2011 00:28:53 +0100] rev 2756
tuned paper
2011-04-08 typo
Christian Urban <urbanc@in.tum.de> [Sat, 09 Apr 2011 02:10:49 +0800] rev 2755
typo
2011-04-08 more on paper
Christian Urban <urbanc@in.tum.de> [Fri, 08 Apr 2011 14:23:28 +0800] rev 2754
more on paper
2011-04-07 eqvt_lambda without eta-expansion
Christian Urban <urbanc@in.tum.de> [Fri, 08 Apr 2011 03:47:50 +0800] rev 2753
eqvt_lambda without eta-expansion
2011-04-06 changed default preprocessor that does not catch variables only occuring on the right
Christian Urban <urbanc@in.tum.de> [Wed, 06 Apr 2011 13:47:08 +0100] rev 2752
changed default preprocessor that does not catch variables only occuring on the right
2011-03-31 final version of slides
Christian Urban <urbanc@in.tum.de> [Thu, 31 Mar 2011 15:25:35 +0200] rev 2751
final version of slides
2011-03-30 more on the slides
Christian Urban <urbanc@in.tum.de> [Wed, 30 Mar 2011 22:27:26 +0200] rev 2750
more on the slides
2011-03-30 tuned IsaMakefile
Christian Urban <urbanc@in.tum.de> [Wed, 30 Mar 2011 08:11:36 +0200] rev 2749
tuned IsaMakefile
2011-03-29 rearranged directories and updated to new Isabelle
Christian Urban <urbanc@in.tum.de> [Tue, 29 Mar 2011 23:52:14 +0200] rev 2748
rearranged directories and updated to new Isabelle
2011-03-16 precise path to LaTeXsugar
Christian Urban <urbanc@in.tum.de> [Wed, 16 Mar 2011 21:14:43 +0100] rev 2747
precise path to LaTeXsugar
2011-03-16 a lit bit more on the pearl-jv paper
Christian Urban <urbanc@in.tum.de> [Wed, 16 Mar 2011 21:07:50 +0100] rev 2746
a lit bit more on the pearl-jv paper
2011-03-16 ported changes from function package....needs Isabelle 16 March or above
Christian Urban <urbanc@in.tum.de> [Wed, 16 Mar 2011 20:42:14 +0100] rev 2745
ported changes from function package....needs Isabelle 16 March or above
2011-03-14 more on the pearl paper
Christian Urban <urbanc@in.tum.de> [Tue, 15 Mar 2011 00:40:39 +0100] rev 2744
more on the pearl paper
2011-03-14 equivariance for All and Ex can be proved in terms of their definition
Christian Urban <urbanc@in.tum.de> [Mon, 14 Mar 2011 16:35:59 +0100] rev 2743
equivariance for All and Ex can be proved in terms of their definition
2011-03-11 more on the paper
Christian Urban <urbanc@in.tum.de> [Fri, 11 Mar 2011 08:51:39 +0000] rev 2742
more on the paper
2011-03-08 merged
Christian Urban <urbanc@in.tum.de> [Tue, 08 Mar 2011 09:07:49 +0000] rev 2741
merged
2011-03-08 more on the pearl paper
Christian Urban <urbanc@in.tum.de> [Tue, 08 Mar 2011 09:07:27 +0000] rev 2740
more on the pearl paper
2011-03-02 distinct names at toplevel
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 02 Mar 2011 16:07:56 +0900] rev 2739
distinct names at toplevel
2011-03-02 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 02 Mar 2011 12:49:01 +0900] rev 2738
merge
2011-03-02 Pairing function
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 02 Mar 2011 12:48:00 +0900] rev 2737
Pairing function
2011-03-02 updated pearl papers
Christian Urban <urbanc@in.tum.de> [Wed, 02 Mar 2011 00:06:28 +0000] rev 2736
updated pearl papers
2011-03-01 a bit more tuning
Christian Urban <urbanc@in.tum.de> [Tue, 01 Mar 2011 00:14:02 +0000] rev 2735
a bit more tuning
2011-02-28 included old test cases for perm_simp into ROOT.ML file
Christian Urban <urbanc@in.tum.de> [Mon, 28 Feb 2011 16:47:13 +0000] rev 2734
included old test cases for perm_simp into ROOT.ML file
2011-02-28 split the library into a basics file; merged Nominal_Eqvt into Nominal_Base
Christian Urban <urbanc@in.tum.de> [Mon, 28 Feb 2011 15:21:10 +0000] rev 2733
split the library into a basics file; merged Nominal_Eqvt into Nominal_Base
2011-02-25 some slight polishing
Christian Urban <urbanc@in.tum.de> [Fri, 25 Feb 2011 21:23:30 +0000] rev 2732
some slight polishing
2011-02-24 merged
Christian Urban <urbanc@in.tum.de> [Thu, 24 Feb 2011 18:50:02 +0000] rev 2731
merged
2011-02-24 added a lemma about fresh_star and Abs
Christian Urban <urbanc@in.tum.de> [Thu, 24 Feb 2011 16:26:11 +0000] rev 2730
added a lemma about fresh_star and Abs
2011-02-23 Reduce the definition of trans to FCB; test that FCB can be proved with simp rules.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 23 Feb 2011 11:11:02 +0900] rev 2729
Reduce the definition of trans to FCB; test that FCB can be proved with simp rules.
2011-02-19 typeschemes/subst
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sat, 19 Feb 2011 09:31:22 +0900] rev 2728
typeschemes/subst
2011-02-17 further experiments with typeschemes subst
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 17 Feb 2011 17:02:25 +0900] rev 2727
further experiments with typeschemes subst
2011-02-17 Finished the proof of a function that invents fresh variable names.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 17 Feb 2011 12:01:08 +0900] rev 2726
Finished the proof of a function that invents fresh variable names.
2011-02-16 added eqvt for length
Christian Urban <urbanc@in.tum.de> [Wed, 16 Feb 2011 14:44:33 +0000] rev 2725
added eqvt for length
2011-02-16 added eqvt lemmas for filter and distinct
Christian Urban <urbanc@in.tum.de> [Wed, 16 Feb 2011 14:03:26 +0000] rev 2724
added eqvt lemmas for filter and distinct
2011-02-07 added eqvt for cartesian products
Christian Urban <urbanc@in.tum.de> [Mon, 07 Feb 2011 16:00:24 +0000] rev 2723
added eqvt for cartesian products
2011-02-07 cleaned up the experiments so that the tests go through
Christian Urban <urbanc@in.tum.de> [Mon, 07 Feb 2011 15:59:37 +0000] rev 2722
cleaned up the experiments so that the tests go through
2011-02-04 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sat, 05 Feb 2011 07:39:00 +0900] rev 2721
merge
2011-02-04 Experiments defining a function on Let
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sat, 05 Feb 2011 07:38:22 +0900] rev 2720
Experiments defining a function on Let
2011-02-04 updated TODO
Christian Urban <urbanc@in.tum.de> [Fri, 04 Feb 2011 04:45:04 +0000] rev 2719
updated TODO
2011-02-04 Lambda.thy which works with Nominal_Isabelle2011
Christian Urban <urbanc@in.tum.de> [Fri, 04 Feb 2011 03:52:38 +0000] rev 2718
Lambda.thy which works with Nominal_Isabelle2011
2011-02-03 merged
Christian Urban <urbanc@in.tum.de> [Thu, 03 Feb 2011 02:57:04 +0000] rev 2717
merged
2011-02-03 removed diagnostic code
Christian Urban <urbanc@in.tum.de> [Thu, 03 Feb 2011 02:51:57 +0000] rev 2716
removed diagnostic code
2011-02-01 Only one of the subgoals is needed
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 01 Feb 2011 09:07:55 +0900] rev 2715
Only one of the subgoals is needed
2011-01-31 Experiments with substitution on set+
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 01 Feb 2011 08:57:50 +0900] rev 2714
Experiments with substitution on set+
2011-01-31 More properties that relate abs_res and abs_set. Also abs_res with less binders.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 01 Feb 2011 08:48:14 +0900] rev 2713
More properties that relate abs_res and abs_set. Also abs_res with less binders.
2011-01-30 alpha_res implies alpha_set :)
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 30 Jan 2011 12:09:23 +0900] rev 2712
alpha_res implies alpha_set :)
2011-01-30 Showing that the binders difference is fresh for the left side solves the goal for 'set'.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 30 Jan 2011 09:57:37 +0900] rev 2711
Showing that the binders difference is fresh for the left side solves the goal for 'set'.
2011-01-29 Experiments with functions
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sat, 29 Jan 2011 14:26:47 +0900] rev 2710
Experiments with functions
2011-01-27 some experiments
Christian Urban <urbanc@in.tum.de> [Thu, 27 Jan 2011 20:19:13 +0100] rev 2709
some experiments
2011-01-27 the proofs with eqvt_at
Christian Urban <urbanc@in.tum.de> [Thu, 27 Jan 2011 04:24:17 +0100] rev 2708
the proofs with eqvt_at
2011-01-25 made eqvt-proof explicit in the function definitions
Christian Urban <urbanc@in.tum.de> [Tue, 25 Jan 2011 18:58:26 +0100] rev 2707
made eqvt-proof explicit in the function definitions
2011-01-24 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 25 Jan 2011 02:51:44 +0900] rev 2706
merge
2011-01-24 minor
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 25 Jan 2011 02:46:05 +0900] rev 2705
minor
2011-01-24 Down as infixr
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 25 Jan 2011 02:42:15 +0900] rev 2704
Down as infixr
2011-01-23 added some slides
Christian Urban <urbanc@in.tum.de> [Sat, 22 Jan 2011 23:24:20 -0600] rev 2703
added some slides
2011-01-23 added Tutorial6
Christian Urban <urbanc@in.tum.de> [Sun, 23 Jan 2011 03:29:22 +0100] rev 2702
added Tutorial6
2011-01-23 cleaning up
Christian Urban <urbanc@in.tum.de> [Sat, 22 Jan 2011 18:59:48 -0600] rev 2701
cleaning up
2011-01-22 merged
Christian Urban <urbanc@in.tum.de> [Sat, 22 Jan 2011 16:37:00 -0600] rev 2700
merged
2011-01-22 cleaned up Tutorial 3 with solutions
Christian Urban <urbanc@in.tum.de> [Sat, 22 Jan 2011 16:36:21 -0600] rev 2699
cleaned up Tutorial 3 with solutions
2011-01-22 Missing val.simps
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 23 Jan 2011 07:32:28 +0900] rev 2698
Missing val.simps
2011-01-22 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 23 Jan 2011 07:17:35 +0900] rev 2697
merge
2011-01-22 Tutorial 4s
Cezary Kaliszyk <kaliszyk@in.tum.de> [Sun, 23 Jan 2011 07:15:59 +0900] rev 2696
Tutorial 4s
2011-01-22 cleaned up and solution section
Christian Urban <urbanc@in.tum.de> [Sat, 22 Jan 2011 16:04:40 -0600] rev 2695
cleaned up and solution section
2011-01-22 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
2011-01-22 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
2011-01-21 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
2011-01-21 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
2011-01-21 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
2011-01-21 added unbind example
Christian Urban <urbanc@in.tum.de> [Fri, 21 Jan 2011 21:58:51 +0100] rev 2689
added unbind example
2011-01-20 a bit tuning
Christian Urban <urbanc@in.tum.de> [Fri, 21 Jan 2011 00:55:28 +0100] rev 2688
a bit tuning
2011-01-20 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
2011-01-19 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
2011-01-19 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
2011-01-19 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)
2011-01-19 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
2011-01-19 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)
2011-01-19 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
2011-01-19 removed diagnostic code
Christian Urban <urbanc@in.tum.de> [Wed, 19 Jan 2011 17:54:06 +0100] rev 2680
removed diagnostic code
2011-01-19 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
2011-01-19 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
2011-01-18 deleted diagnostic code
Christian Urban <urbanc@in.tum.de> [Tue, 18 Jan 2011 21:28:07 +0100] rev 2677
deleted diagnostic code
2011-01-18 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
2011-01-18 defined properly substitution
Christian Urban <urbanc@in.tum.de> [Tue, 18 Jan 2011 19:27:30 +0100] rev 2675
defined properly substitution
2011-01-18 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
2011-01-18 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
2011-01-18 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
2011-01-18 alpha_abs_set_stronger1
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 18 Jan 2011 22:11:49 +0900] rev 2671
alpha_abs_set_stronger1
2011-01-18 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
2011-01-18 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
2011-01-18 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
2011-01-17 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)
2011-01-17 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
2011-01-17 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
2011-01-17 removed old testing code from Lambda.thy
Christian Urban <urbanc@in.tum.de> [Mon, 17 Jan 2011 12:37:37 +0000] rev 2664
removed old testing code from Lambda.thy
2011-01-17 moved high level code from LamTest into the main libraries.
Christian Urban <urbanc@in.tum.de> [Mon, 17 Jan 2011 12:34:11 +0000] rev 2663
moved high level code from LamTest into the main libraries.
2011-01-17 eliminated tracing code; added flag so that equivariance is only proved for the function graph, not the relation
Christian Urban <urbanc@in.tum.de> [Mon, 17 Jan 2011 12:33:37 +0000] rev 2662
eliminated tracing code; added flag so that equivariance is only proved for the function graph, not the relation
2011-01-15 subst also works now
Christian Urban <urbanc@in.tum.de> [Sat, 15 Jan 2011 21:16:15 +0000] rev 2661
subst also works now
2011-01-15 nominal_function works now completely for frees and depth; still a propbelm with subst; no unproved assumptions
Christian Urban <urbanc@in.tum.de> [Sat, 15 Jan 2011 20:24:16 +0000] rev 2660
nominal_function works now completely for frees and depth; still a propbelm with subst; no unproved assumptions
2011-01-14 strengthened renaming lemmas
Christian Urban <urbanc@in.tum.de> [Fri, 14 Jan 2011 14:22:25 +0000] rev 2659
strengthened renaming lemmas
2011-01-13 added eqvt_lemmas for subset and psubset
Christian Urban <urbanc@in.tum.de> [Thu, 13 Jan 2011 12:12:47 +0000] rev 2658
added eqvt_lemmas for subset and psubset
2011-01-10 a few lemmas about freshness for at and at_base
Christian Urban <urbanc@in.tum.de> [Mon, 10 Jan 2011 11:36:55 +0000] rev 2657
a few lemmas about freshness for at and at_base
2011-01-10 added a property about finite support in the presense of eqvt_at
Christian Urban <urbanc@in.tum.de> [Mon, 10 Jan 2011 08:51:51 +0000] rev 2656
added a property about finite support in the presense of eqvt_at
2011-01-09 instantiated fundef_ex1_eqvt_at theorem with the indction hypothesis
Christian Urban <urbanc@in.tum.de> [Sun, 09 Jan 2011 05:38:53 +0000] rev 2655
instantiated fundef_ex1_eqvt_at theorem with the indction hypothesis
2011-01-09 solved subgoals for depth and subst function
Christian Urban <urbanc@in.tum.de> [Sun, 09 Jan 2011 04:28:24 +0000] rev 2654
solved subgoals for depth and subst function
2011-01-09 added eqvt_at premises in function definition - however not proved at the moment
Christian Urban <urbanc@in.tum.de> [Sun, 09 Jan 2011 01:17:44 +0000] rev 2653
added eqvt_at premises in function definition - however not proved at the moment
2011-01-07 added one further lemma about equivariance of THE_default
Christian Urban <urbanc@in.tum.de> [Fri, 07 Jan 2011 05:40:31 +0000] rev 2652
added one further lemma about equivariance of THE_default
2011-01-07 equivariance of THE_default under the uniqueness assumption
Christian Urban <urbanc@in.tum.de> [Fri, 07 Jan 2011 05:06:25 +0000] rev 2651
equivariance of THE_default under the uniqueness assumption
2011-01-07 derived equivariance for the function graph and function relation
Christian Urban <urbanc@in.tum.de> [Fri, 07 Jan 2011 02:30:00 +0000] rev 2650
derived equivariance for the function graph and function relation
(0) -1000 -224 +224 tip