Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 13:44:54 +0100] rev 1419
The alpha5_eqvt tactic works if I manage to build the goal.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 13:34:45 +0100] rev 1418
With the 4 cheats, all examples fully lift.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 12:30:53 +0100] rev 1417
Lift alpha_bn_constants.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 12:26:24 +0100] rev 1416
Lifting constants.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 11:41:27 +0100] rev 1415
Proper error message.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 11:32:37 +0100] rev 1414
Lifting constants works for all examples.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 11:25:56 +0100] rev 1413
Remove tracing from fv/alpha.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 11:25:18 +0100] rev 1412
Equivp working only on the standard alpha-equivalences.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 11:20:50 +0100] rev 1411
explicit cheat_fv_eqvt
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 11:15:14 +0100] rev 1410
extract build_eqvts_tac.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 10:39:29 +0100] rev 1409
build_eqvts no longer requires permutations.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 10:22:24 +0100] rev 1408
Add explicit alpha_eqvt_cheat.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 10:10:23 +0100] rev 1407
Export tactic out of alpha_eqvt.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 16:59:08 +0100] rev 1406
merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 16:58:14 +0100] rev 1405
More tries about the proofs in trm5
Christian Urban <urbanc@in.tum.de> [Wed, 10 Mar 2010 16:51:15 +0100] rev 1404
merged
Christian Urban <urbanc@in.tum.de> [Wed, 10 Mar 2010 16:50:42 +0100] rev 1403
almost done with showing the equivalence between old and new alpha-equivalence (one subgoal remaining)
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 15:40:15 +0100] rev 1402
alpha_equivp for trm5
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 15:34:13 +0100] rev 1401
Undoing mistakenly committed parser experiments.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 15:32:51 +0100] rev 1400
alpha_eqvt for recursive term1.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 14:47:04 +0100] rev 1399
Looking at alpha_eqvt for term5, not much progress.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 14:24:27 +0100] rev 1398
Reordered examples in Test.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 13:29:12 +0100] rev 1397
Allows multiple bindings with same lhs.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 13:10:00 +0100] rev 1396
Linked parser to fv and alpha.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 12:53:44 +0100] rev 1395
merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 12:53:30 +0100] rev 1394
A minor fix for shallow binders. LF works again.
Christian Urban <urbanc@in.tum.de> [Wed, 10 Mar 2010 12:48:55 +0100] rev 1393
merged
Christian Urban <urbanc@in.tum.de> [Wed, 10 Mar 2010 12:48:38 +0100] rev 1392
parser produces ordered bn-fun information
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 11:39:28 +0100] rev 1391
Testing equalities in trm5, all seems good.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 11:19:59 +0100] rev 1390
Fv&Alpha seem to work.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 10:47:21 +0100] rev 1389
include alpha in the definitions.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 10:11:20 +0100] rev 1388
Filled the algorithm for alpha_bn_arg
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 09:58:43 +0100] rev 1387
rhs of alpha_bn, and template for the arguments.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 09:45:38 +0100] rev 1386
alpha_bn_constr template
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 09:36:07 +0100] rev 1385
exported template for alpha_bn
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 09:10:11 +0100] rev 1384
merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 09:09:52 +0100] rev 1383
Use alpha_bns in normal alpha defs.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 08:44:19 +0100] rev 1382
alpha_bn_frees
Christian Urban <urbanc@in.tum.de> [Tue, 09 Mar 2010 22:10:10 +0100] rev 1381
merged
Christian Urban <urbanc@in.tum.de> [Tue, 09 Mar 2010 22:08:38 +0100] rev 1380
added bn-information, but it is not yet ordered according to the dts
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 21:22:22 +0100] rev 1379
Separate lists for separate constructors, to match bn_eqs.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 17:25:35 +0100] rev 1378
All examples should work.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 17:02:29 +0100] rev 1377
Fix to get old alpha.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 16:57:51 +0100] rev 1376
Separate primrecs in Fv.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 16:24:39 +0100] rev 1375
A version of Fv that takes into account recursive and non-recursive bindings.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 11:36:40 +0100] rev 1374
Trying to prove that old alpha is the same as new recursive one. Lets still to do.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 11:06:57 +0100] rev 1373
fv_bi and alpha_bi
Christian Urban <urbanc@in.tum.de> [Tue, 09 Mar 2010 09:55:19 +0100] rev 1372
merged
Christian Urban <urbanc@in.tum.de> [Tue, 09 Mar 2010 09:54:58 +0100] rev 1371
added first test about new compat
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 09:38:49 +0100] rev 1370
fv_compat
Christian Urban <urbanc@in.tum.de> [Tue, 09 Mar 2010 08:46:55 +0100] rev 1369
added another compat example
Christian Urban <urbanc@in.tum.de> [Mon, 08 Mar 2010 20:18:27 +0100] rev 1368
added a test-file for compatibility
Christian Urban <urbanc@in.tum.de> [Mon, 08 Mar 2010 16:11:42 +0100] rev 1367
added compat definitions to some examples
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 08 Mar 2010 15:28:25 +0100] rev 1366
Proper recognition of atoms and atom sets.
Christian Urban <urbanc@in.tum.de> [Mon, 08 Mar 2010 15:06:14 +0100] rev 1365
deleted comments about "weird"
Christian Urban <urbanc@in.tum.de> [Mon, 08 Mar 2010 15:01:26 +0100] rev 1364
merged
Christian Urban <urbanc@in.tum.de> [Mon, 08 Mar 2010 15:01:01 +0100] rev 1363
updated to new Isabelle
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 08 Mar 2010 14:31:04 +0100] rev 1362
Term5 written as nominal_datatype is the recursive let.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 08 Mar 2010 11:25:57 +0100] rev 1361
With restricted_nominal=1, exp7 and exp8 work. Not sure about proving bn_rsp there.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 08 Mar 2010 11:12:15 +0100] rev 1360
More fine-grained nominal restriction for debugging.