Wed, 08 Jun 2011 08:44:01 +0100 Christian Urban using the option "default" the function package allows one to give an explicit default value
Wed, 08 Jun 2011 17:52:06 +0900 Cezary Kaliszyk Simpler proof of TypeSchemes/substs
Wed, 08 Jun 2011 17:25:54 +0900 Cezary Kaliszyk Simplify fcb_res
Wed, 08 Jun 2011 09:56:39 +0900 Cezary Kaliszyk FCB for res binding and simplified proof of subst for type schemes
Wed, 08 Jun 2011 07:06:20 +0900 Cezary Kaliszyk Simplify ln-trans proof
Wed, 08 Jun 2011 07:02:52 +0900 Cezary Kaliszyk cbvs can be easily defined without an invariant
Tue, 07 Jun 2011 20:58:00 +0100 Christian Urban defined the "count-bound-variables-occurences" function which has an accumulator like trans
Tue, 07 Jun 2011 17:45:38 +0100 Christian Urban merged
Tue, 07 Jun 2011 23:42:12 +0900 Cezary Kaliszyk remove garbage (proofs that assumes the invariant outside function)
Tue, 07 Jun 2011 23:38:39 +0900 Cezary Kaliszyk Proof of trans with invariant
Tue, 07 Jun 2011 23:22:58 +0900 Cezary Kaliszyk Testing invariant in Lambda_F_T
Tue, 07 Jun 2011 10:40:06 +0100 Christian Urban 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 Christian Urban 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 Christian Urban slightly stronger property in fundef_ex_prop
Sun, 05 Jun 2011 21:14:23 +0100 Christian Urban added an option for an invariant (at the moment only a stub)
Sun, 05 Jun 2011 16:58:18 +0100 Christian Urban added a more general lemma fro fundef_ex1
Sat, 04 Jun 2011 14:50:57 +0900 Cezary Kaliszyk Trying the induction on the graph
Sat, 04 Jun 2011 09:07:50 +0900 Cezary Kaliszyk Finish and test the locale approach
Fri, 03 Jun 2011 22:31:44 +0900 Cezary Kaliszyk FiniteSupp precondition in the function is enough to get rid of completeness obligationss
Fri, 03 Jun 2011 12:46:23 +0100 Christian Urban recursion combinator inside a locale
Fri, 03 Jun 2011 18:33:11 +0900 Cezary Kaliszyk merge
Fri, 03 Jun 2011 18:32:22 +0900 Cezary Kaliszyk F for lambda used to define translation to locally nameless
Thu, 02 Jun 2011 16:15:18 +0100 Christian Urban typo
Thu, 02 Jun 2011 15:35:33 +0100 Christian Urban removed dead code
Thu, 02 Jun 2011 22:24:33 +0900 Cezary Kaliszyk finished the missing obligations
Thu, 02 Jun 2011 12:14:03 +0100 Christian Urban merged
Thu, 02 Jun 2011 12:09:31 +0100 Christian Urban a test with a recursion combinator defined on top of nominal_primrec
Thu, 02 Jun 2011 16:41:09 +0900 Cezary Kaliszyk Use FCB to simplify proof
Thu, 02 Jun 2011 10:11:50 +0900 Cezary Kaliszyk merge
Thu, 02 Jun 2011 10:09:23 +0900 Cezary Kaliszyk Remove SMT
Wed, 01 Jun 2011 22:55:14 +0100 Christian Urban hopefully final fix for ho-functions
Wed, 01 Jun 2011 21:03:30 +0100 Christian Urban first test to fix the problem with free variables
Wed, 01 Jun 2011 16:13:42 +0900 Cezary Kaliszyk proved subst for All constructor in type schemes.
Wed, 01 Jun 2011 13:41:30 +0900 Cezary Kaliszyk DB translation using index; easier to reason about.
Wed, 01 Jun 2011 13:35:37 +0900 Cezary Kaliszyk Problem: free variables in the goal
Wed, 01 Jun 2011 11:01:39 +0900 Cezary Kaliszyk fixed previous commit
Wed, 01 Jun 2011 10:59:07 +0900 Cezary Kaliszyk equivariance of db_trans
Tue, 31 May 2011 12:22:28 +0100 Christian Urban fixed the problem with cps-like functions
Tue, 31 May 2011 14:12:31 +0900 Cezary Kaliszyk DeBruijn translation in a simplifier friendly way
Tue, 31 May 2011 13:25:35 +0900 Cezary Kaliszyk map_term can be defined when equivariance is assumed
Tue, 31 May 2011 13:21:00 +0900 Cezary Kaliszyk map_term is not a function the way it is defined
Tue, 31 May 2011 12:59:10 +0900 Cezary Kaliszyk Defined translation from nominal to de-Bruijn; with a freshness condition for the lambda case.
Tue, 31 May 2011 12:54:21 +0900 Cezary Kaliszyk Simple eqvt proofs with perm_simps for clarity
Tue, 31 May 2011 00:36:16 +0100 Christian Urban tuned last commit
Tue, 31 May 2011 00:17:22 +0100 Christian Urban 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 Christian Urban updated to new Isabelle
Wed, 25 May 2011 21:38:50 +0200 Christian Urban added eq_iff and distinct lemmas of nominal datatypes to the simplifier
Tue, 24 May 2011 19:39:38 +0200 Christian Urban more on slides
Sun, 22 May 2011 10:20:18 +0200 Christian Urban added slides for copenhagen
Sat, 14 May 2011 10:16:16 +0100 Christian Urban added a problem with inductive_cases (reported by Randy)
Fri, 13 May 2011 14:50:17 +0100 Christian Urban misc
Tue, 10 May 2011 17:10:22 +0100 Christian Urban made the subtyping work again
Tue, 10 May 2011 07:47:06 +0100 Christian Urban updated to new Isabelle (> 9 May)
Mon, 09 May 2011 04:49:58 +0100 Christian Urban merged
Tue, 03 May 2011 15:39:30 +0100 Christian Urban added two mutual recursive inductive definitions
Tue, 03 May 2011 13:25:02 +0100 Christian Urban deleted two functions from the API
Tue, 03 May 2011 13:09:08 +0100 Christian Urban proved that lfp is equivariant (that simplifies equivariance proofs of inductively defined predicates)
Mon, 09 May 2011 04:46:43 +0100 Christian Urban more on pearl-paper
Wed, 04 May 2011 15:27:04 +0800 Christian Urban more on pearl-paper
Mon, 02 May 2011 13:01:02 +0800 Christian Urban updated Quotient paper so that it compiles again
(0) -1000 -300 -100 -60 +60 +100 +300 tip