| Wed, 23 May 2012 23:57:27 +0100 |
Christian Urban |
improved handling in the simplifier for inequalities derived from freshness assumptions
|
file |
diff |
annotate
|
| Tue, 10 Apr 2012 15:22:16 +0100 |
Christian Urban |
updated to latest changes (10 April) to quotient package (lift_raw_const only takes dummy theorem TrueI....in the future this will not work anymore)
|
file |
diff |
annotate
|
| Sat, 17 Mar 2012 05:13:59 +0000 |
Christian Urban |
updated to new Isabelle (declared keywords)
|
file |
diff |
annotate
|
| Wed, 21 Dec 2011 13:06:09 +0900 |
Cezary Kaliszyk |
Port CR_Takahashi from Nominal1, no more "sorry" in BetaCR.
|
file |
diff |
annotate
|
| Sat, 17 Dec 2011 17:08:47 +0000 |
Christian Urban |
cleaned examples for stable branch
Nominal2-Isabelle2011-1
|
file |
diff |
annotate
|
| Thu, 15 Dec 2011 16:20:42 +0000 |
Christian Urban |
updated to lates changes in the datatype package
|
file |
diff |
annotate
|
| Tue, 08 Nov 2011 22:31:31 +0000 |
Cezary Kaliszyk |
Add equivariance for alpha_lam_raw and abs_lam.
|
file |
diff |
annotate
|
| Mon, 07 Nov 2011 13:58:18 +0000 |
Christian Urban |
all examples work again after quotient package has been "de-localised"
|
file |
diff |
annotate
|
| Fri, 19 Aug 2011 11:01:52 +0900 |
Cezary Kaliszyk |
Comment out examples with 'True' that do not work because function still does not work
|
file |
diff |
annotate
|
| Fri, 22 Jul 2011 11:37:16 +0100 |
Christian Urban |
completed the eqvt-proofs for functions; they are stored under the name function_name.eqvt and added to the eqvt-list
|
file |
diff |
annotate
|
| Tue, 19 Jul 2011 02:30:05 +0100 |
Christian Urban |
preliminary version of automatically generation the eqvt-lemmas for functions defined with nominal_primrec
|
file |
diff |
annotate
|
| Tue, 19 Jul 2011 01:40:36 +0100 |
Christian Urban |
generated the partial eqvt-theorem for functions
|
file |
diff |
annotate
|
| Mon, 18 Jul 2011 17:40:13 +0100 |
Christian Urban |
added a flag (eqvt) to termination proofs arising fron nominal_primrecs
|
file |
diff |
annotate
|
| Mon, 18 Jul 2011 10:50:21 +0100 |
Christian Urban |
moved eqvt for Option.map
|
file |
diff |
annotate
|
| Tue, 05 Jul 2011 23:47:20 +0200 |
Christian Urban |
added some relatively simple examples from paper by Norrish
|
file |
diff |
annotate
|
| Tue, 05 Jul 2011 18:42:34 +0200 |
Christian Urban |
changed bind to binds in specifications; bind will cause trouble with Monad_Syntax
|
file |
diff |
annotate
|
| Tue, 05 Jul 2011 16:22:18 +0200 |
Christian Urban |
made the tests go through again
|
file |
diff |
annotate
|
| Tue, 05 Jul 2011 04:23:33 +0200 |
Christian Urban |
merged
|
file |
diff |
annotate
|
| Tue, 05 Jul 2011 04:18:45 +0200 |
Christian Urban |
exported various FCB-lemmas to a separate file
|
file |
diff |
annotate
|
| Tue, 05 Jul 2011 10:13:34 +0900 |
Cezary Kaliszyk |
Express trans_db with Option.map and Option.bind. Possibly mbind is a copy of bind?
|
file |
diff |
annotate
|
| Tue, 05 Jul 2011 09:28:16 +0900 |
Cezary Kaliszyk |
Define a version of aux only for same binders. Completeness is fine.
|
file |
diff |
annotate
|
| Tue, 05 Jul 2011 09:26:20 +0900 |
Cezary Kaliszyk |
Move If / Let with 'True' to the end of Lambda
|
file |
diff |
annotate
|
| Mon, 04 Jul 2011 23:54:05 +0200 |
Christian Urban |
added an example that recurses over two arguments; the interesting proof-obligation is not yet done
|
file |
diff |
annotate
|
| Tue, 28 Jun 2011 00:30:30 +0100 |
Christian Urban |
copied all work to Lambda.thy; had to derive a special version of fcb1 for concrete atom
|
file |
diff |
annotate
|
| Sun, 26 Jun 2011 17:55:22 +0100 |
Christian Urban |
another change to the fcb2; this is needed in order to get all proofs through in Lambda.thy
|
file |
diff |
annotate
|
| Thu, 23 Jun 2011 22:21:43 +0100 |
Christian Urban |
the simplifier can simplify "sort (atom a)" if a is a concrete atom type declared with atom_decl
|
file |
diff |
annotate
|
| Wed, 22 Jun 2011 12:18:22 +0100 |
Christian Urban |
some rudimentary infrastructure for storing data about nominal datatypes
|
file |
diff |
annotate
|
| Thu, 16 Jun 2011 20:07:03 +0100 |
Christian Urban |
got rid of the boolean flag in the raw_equivariance function
|
file |
diff |
annotate
|
| Thu, 16 Jun 2011 12:12:25 +0100 |
Christian Urban |
added a test that every function must be of pt-sort
|
file |
diff |
annotate
|
| Wed, 15 Jun 2011 22:36:59 +0100 |
Christian Urban |
added size-lemmas to simplifier; as a result termination can be proved by the standard lexicographic_order method
|
file |
diff |
annotate
|
| Wed, 15 Jun 2011 09:50:53 +0900 |
Cezary Kaliszyk |
Some TODOs
|
file |
diff |
annotate
|
| Fri, 10 Jun 2011 15:52:17 +0900 |
Cezary Kaliszyk |
Move working examples before non-working ones
|
file |
diff |
annotate
|
| Fri, 10 Jun 2011 15:45:49 +0900 |
Cezary Kaliszyk |
Optimized proofs and removed some garbage.
|
file |
diff |
annotate
|
| Fri, 10 Jun 2011 15:30:09 +0900 |
Cezary Kaliszyk |
Slightly modify fcb for list1 and put in common place.
|
file |
diff |
annotate
|
| Thu, 09 Jun 2011 15:34:51 +0900 |
Cezary Kaliszyk |
Eval can be defined with additional freshness
|
file |
diff |
annotate
|
| Thu, 09 Jun 2011 15:03:58 +0900 |
Cezary Kaliszyk |
Minor simplification
|
file |
diff |
annotate
|
| Wed, 08 Jun 2011 12:30:56 +0100 |
Christian Urban |
merged
|
file |
diff |
annotate
|
| Wed, 08 Jun 2011 12:30:46 +0100 |
Christian Urban |
merged
|
file |
diff |
annotate
|
| Wed, 08 Jun 2011 07:06:20 +0900 |
Cezary Kaliszyk |
Simplify ln-trans proof
|
file |
diff |
annotate
|
| Wed, 08 Jun 2011 07:02:52 +0900 |
Cezary Kaliszyk |
cbvs can be easily defined without an invariant
|
file |
diff |
annotate
|
| Tue, 07 Jun 2011 20:58:00 +0100 |
Christian Urban |
defined the "count-bound-variables-occurences" function which has an accumulator like trans
|
file |
diff |
annotate
|
| Tue, 07 Jun 2011 17:45:38 +0100 |
Christian Urban |
merged
|
file |
diff |
annotate
|
| Tue, 07 Jun 2011 23:42:12 +0900 |
Cezary Kaliszyk |
remove garbage (proofs that assumes the invariant outside function)
|
file |
diff |
annotate
|
| Tue, 07 Jun 2011 23:38:39 +0900 |
Cezary Kaliszyk |
Proof of trans with invariant
|
file |
diff |
annotate
|
| 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
|
file |
diff |
annotate
|
| 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
|
file |
diff |
annotate
|
| Sun, 05 Jun 2011 21:14:23 +0100 |
Christian Urban |
added an option for an invariant (at the moment only a stub)
|
file |
diff |
annotate
|
| Sat, 04 Jun 2011 09:07:50 +0900 |
Cezary Kaliszyk |
Finish and test the locale approach
|
file |
diff |
annotate
|
| Fri, 03 Jun 2011 12:46:23 +0100 |
Christian Urban |
recursion combinator inside a locale
|
file |
diff |
annotate
|
| Thu, 02 Jun 2011 22:24:33 +0900 |
Cezary Kaliszyk |
finished the missing obligations
|
file |
diff |
annotate
|
| Thu, 02 Jun 2011 12:14:03 +0100 |
Christian Urban |
merged
|
file |
diff |
annotate
|
| Thu, 02 Jun 2011 12:09:31 +0100 |
Christian Urban |
a test with a recursion combinator defined on top of nominal_primrec
|
file |
diff |
annotate
|
| Thu, 02 Jun 2011 16:41:09 +0900 |
Cezary Kaliszyk |
Use FCB to simplify proof
|
file |
diff |
annotate
|
| Wed, 01 Jun 2011 22:55:14 +0100 |
Christian Urban |
hopefully final fix for ho-functions
|
file |
diff |
annotate
|
| Wed, 01 Jun 2011 21:03:30 +0100 |
Christian Urban |
first test to fix the problem with free variables
|
file |
diff |
annotate
|
| Wed, 01 Jun 2011 13:41:30 +0900 |
Cezary Kaliszyk |
DB translation using index; easier to reason about.
|
file |
diff |
annotate
|
| Wed, 01 Jun 2011 13:35:37 +0900 |
Cezary Kaliszyk |
Problem: free variables in the goal
|
file |
diff |
annotate
|
| Wed, 01 Jun 2011 11:01:39 +0900 |
Cezary Kaliszyk |
fixed previous commit
|
file |
diff |
annotate
|
| Wed, 01 Jun 2011 10:59:07 +0900 |
Cezary Kaliszyk |
equivariance of db_trans
|
file |
diff |
annotate
|
| Tue, 31 May 2011 12:22:28 +0100 |
Christian Urban |
fixed the problem with cps-like functions
|
file |
diff |
annotate
|
| Tue, 31 May 2011 14:12:31 +0900 |
Cezary Kaliszyk |
DeBruijn translation in a simplifier friendly way
|
file |
diff |
annotate
|
| Tue, 31 May 2011 13:25:35 +0900 |
Cezary Kaliszyk |
map_term can be defined when equivariance is assumed
|
file |
diff |
annotate
|
| Tue, 31 May 2011 13:21:00 +0900 |
Cezary Kaliszyk |
map_term is not a function the way it is defined
|
file |
diff |
annotate
|
| 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.
|
file |
diff |
annotate
|
| Tue, 31 May 2011 12:54:21 +0900 |
Cezary Kaliszyk |
Simple eqvt proofs with perm_simps for clarity
|
file |
diff |
annotate
|
| 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
|
file |
diff |
annotate
|
| Wed, 25 May 2011 21:38:50 +0200 |
Christian Urban |
added eq_iff and distinct lemmas of nominal datatypes to the simplifier
|
file |
diff |
annotate
|
| Sat, 14 May 2011 10:16:16 +0100 |
Christian Urban |
added a problem with inductive_cases (reported by Randy)
|
file |
diff |
annotate
|
| Tue, 03 May 2011 15:39:30 +0100 |
Christian Urban |
added two mutual recursive inductive definitions
|
file |
diff |
annotate
|
| Tue, 03 May 2011 13:09:08 +0100 |
Christian Urban |
proved that lfp is equivariant (that simplifies equivariance proofs of inductively defined predicates)
|
file |
diff |
annotate
|
| Mon, 18 Apr 2011 15:57:45 +0100 |
Christian Urban |
merged
|
file |
diff |
annotate
|
| Mon, 18 Apr 2011 15:56:07 +0100 |
Christian Urban |
added permute_pure back into the nominal_inductive procedure; updated to Isabelle 17 April
|
file |
diff |
annotate
|
| Fri, 15 Apr 2011 15:20:56 +0900 |
Cezary Kaliszyk |
New way of forward elimination of Abs1_eq and simplifications of the function obligation proofs.
|
file |
diff |
annotate
|
| Wed, 13 Apr 2011 13:41:52 +0100 |
Christian Urban |
introduced framework for finetuning eqvt-rules; this solves problem with permute_pure called in nominal_inductive
|
file |
diff |
annotate
|
| Wed, 23 Feb 2011 11:11:02 +0900 |
Cezary Kaliszyk |
Reduce the definition of trans to FCB; test that FCB can be proved with simp rules.
|
file |
diff |
annotate
|
| Tue, 01 Feb 2011 09:07:55 +0900 |
Cezary Kaliszyk |
Only one of the subgoals is needed
|
file |
diff |
annotate
|
| Tue, 25 Jan 2011 18:58:26 +0100 |
Christian Urban |
made eqvt-proof explicit in the function definitions
|
file |
diff |
annotate
|
| Wed, 19 Jan 2011 19:41:50 +0100 |
Christian Urban |
added obtain_fresh lemma; tuned Lambda.thy
|
file |
diff |
annotate
|
| Wed, 19 Jan 2011 18:56:28 +0100 |
Christian Urban |
ported some of the old proofs to serve as testcases
|
file |
diff |
annotate
|
| Wed, 19 Jan 2011 07:06:47 +0100 |
Christian Urban |
defined height as a function that returns an integer
|
file |
diff |
annotate
|
| Tue, 18 Jan 2011 19:27:30 +0100 |
Christian Urban |
defined properly substitution
|
file |
diff |
annotate
|
| Tue, 18 Jan 2011 11:02:57 +0100 |
Christian Urban |
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
|
file |
diff |
annotate
|
| Mon, 17 Jan 2011 17:20:21 +0100 |
Christian Urban |
added a translation function from lambda-terms to deBruijn terms (equivariance fails at the moment)
|
file |
diff |
annotate
|
| Mon, 17 Jan 2011 15:12:03 +0100 |
Christian Urban |
added a few examples of functions to Lambda.thy
|
file |
diff |
annotate
|
| Mon, 17 Jan 2011 12:37:37 +0000 |
Christian Urban |
removed old testing code from Lambda.thy
|
file |
diff |
annotate
|
| Sun, 09 Jan 2011 04:28:24 +0000 |
Christian Urban |
solved subgoals for depth and subst function
|
file |
diff |
annotate
|
| Thu, 06 Jan 2011 23:06:45 +0000 |
Christian Urban |
a modified function package where, as a test, True has been injected into the compatibility condictions
|
file |
diff |
annotate
|
| Thu, 06 Jan 2011 14:02:10 +0000 |
Christian Urban |
tuned
|
file |
diff |
annotate
|
| Fri, 31 Dec 2010 15:37:04 +0000 |
Christian Urban |
changed res keyword to set+ for restrictions; comment by a referee
|
file |
diff |
annotate
|
| Tue, 28 Dec 2010 19:51:25 +0000 |
Christian Urban |
automated all strong induction lemmas
|
file |
diff |
annotate
|
| Wed, 22 Dec 2010 09:13:25 +0000 |
Christian Urban |
properly exported strong exhaust theorem; cleaned up some examples
|
file |
diff |
annotate
|
| Wed, 10 Nov 2010 13:46:21 +0000 |
Christian Urban |
adapted to changes by Florian on the quotient package and removed local fix for function package
|
file |
diff |
annotate
|
| Wed, 29 Sep 2010 16:49:13 -0400 |
Christian Urban |
simplified exhaust proofs
|
file |
diff |
annotate
|
| Wed, 29 Sep 2010 04:42:37 -0400 |
Christian Urban |
test with induct_schema for simpler strong_ind proofs
|
file |
diff |
annotate
|
| Sun, 29 Aug 2010 13:36:03 +0800 |
Christian Urban |
renamed NewParser to Nominal2
|
file |
diff |
annotate
|
| Fri, 27 Aug 2010 13:57:00 +0800 |
Christian Urban |
make copies of the "old" files
|
file |
diff |
annotate
|
| Fri, 27 Aug 2010 03:37:17 +0800 |
Christian Urban |
"isabelle make test" makes all major examples....they work up to supp theorems (excluding)
|
file |
diff |
annotate
|
| Thu, 26 Aug 2010 02:08:00 +0800 |
Christian Urban |
cleaned up (almost completely) the examples
|
file |
diff |
annotate
|
| Wed, 25 Aug 2010 22:55:42 +0800 |
Christian Urban |
automatic lifting
|
file |
diff |
annotate
|
| Wed, 25 Aug 2010 11:58:37 +0800 |
Christian Urban |
now every lemma lifts (even with type variables)
|
file |
diff |
annotate
|
| Wed, 25 Aug 2010 09:02:06 +0800 |
Christian Urban |
can now deal with type variables in nominal datatype definitions
|
file |
diff |
annotate
|
| Sat, 21 Aug 2010 17:55:42 +0800 |
Christian Urban |
nominal_datatypes with type variables do not work
|
file |
diff |
annotate
|
| Sat, 21 Aug 2010 16:20:10 +0800 |
Christian Urban |
changed parser so that the binding mode is indicated as "bind (list)", "bind (set)" or "bind (res)"; if only "bind" is given, then bind (list) is assumed as default
|
file |
diff |
annotate
|
| Mon, 07 Jun 2010 11:43:01 +0200 |
Christian Urban |
work on transitivity proof
|
file |
diff |
annotate
|
| Fri, 21 May 2010 17:17:51 +0200 |
Cezary Kaliszyk |
Match_Lam defined on Quotient Level.
|
file |
diff |
annotate
|
| Fri, 21 May 2010 11:55:22 +0200 |
Cezary Kaliszyk |
More on Function-defined subst.
|
file |
diff |
annotate
|
| Fri, 21 May 2010 10:47:45 +0200 |
Cezary Kaliszyk |
merge
|
file |
diff |
annotate
|
| Fri, 21 May 2010 10:43:14 +0200 |
Cezary Kaliszyk |
Renamings.
|
file |
diff |
annotate
|
| Fri, 21 May 2010 10:47:07 +0200 |
Cezary Kaliszyk |
merge (non-trival)
|
file |
diff |
annotate
|
| Fri, 21 May 2010 10:45:29 +0200 |
Cezary Kaliszyk |
Previously uncommited direct subst definition changes.
|
file |
diff |
annotate
|
| Fri, 21 May 2010 10:44:07 +0200 |
Cezary Kaliszyk |
Function experiments
|
file |
diff |
annotate
|
| Wed, 19 May 2010 12:29:08 +0200 |
Cezary Kaliszyk |
more subst experiments
|
file |
diff |
annotate
|
| Wed, 19 May 2010 11:29:42 +0200 |
Cezary Kaliszyk |
More subst experminets
|
file |
diff |
annotate
|
| Tue, 18 May 2010 17:56:41 +0200 |
Cezary Kaliszyk |
more on subst
|
file |
diff |
annotate
|
| Tue, 18 May 2010 17:17:54 +0200 |
Cezary Kaliszyk |
Single variable substitution
|
file |
diff |
annotate
|
| Tue, 18 May 2010 17:06:21 +0200 |
Cezary Kaliszyk |
subst fix
|
file |
diff |
annotate
|
| Tue, 18 May 2010 15:58:52 +0200 |
Cezary Kaliszyk |
subst experiments
|
file |
diff |
annotate
|
| Wed, 12 May 2010 16:59:53 +0100 |
Christian Urban |
fixed the examples for the new eqvt-procedure....temporarily disabled Manual/Term4.thy
|
file |
diff |
annotate
|
| Tue, 11 May 2010 18:20:25 +0200 |
Cezary Kaliszyk |
Include raw permutation definitions in eqvt
|
file |
diff |
annotate
|
| Tue, 11 May 2010 17:16:57 +0200 |
Cezary Kaliszyk |
Declare alpha_gen_eqvt as eqvt and change the proofs that used 'eqvts[symmetric]'
|
file |
diff |
annotate
|