| 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
|