Wed, 17 Mar 2010 12:23:04 +0100 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 12:23:04 +0100] rev 1481
merge
Wed, 17 Mar 2010 12:18:35 +0100 cheat_alpha_eqvt no longer needed. Cleaned the tracing messages.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 12:18:35 +0100] rev 1480
cheat_alpha_eqvt no longer needed. Cleaned the tracing messages.
Wed, 17 Mar 2010 11:54:22 +0100 merged
Christian Urban <urbanc@in.tum.de> [Wed, 17 Mar 2010 11:54:22 +0100] rev 1479
merged
Wed, 17 Mar 2010 11:53:56 +0100 added proof of supp/fv for type schemes
Christian Urban <urbanc@in.tum.de> [Wed, 17 Mar 2010 11:53:56 +0100] rev 1478
added proof of supp/fv for type schemes
Wed, 17 Mar 2010 11:40:58 +0100 Updated Type Schemes to automatic lifting. One goal is not true because of the restriction.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 11:40:58 +0100] rev 1477
Updated Type Schemes to automatic lifting. One goal is not true because of the restriction.
Wed, 17 Mar 2010 11:20:24 +0100 Remove Term5a, since it is now identical to Term5.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 11:20:24 +0100] rev 1476
Remove Term5a, since it is now identical to Term5.
Wed, 17 Mar 2010 11:11:42 +0100 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 11:11:42 +0100] rev 1475
merge
Wed, 17 Mar 2010 11:11:25 +0100 Finished all proofs in Term5 and Term5n.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 11:11:25 +0100] rev 1474
Finished all proofs in Term5 and Term5n.
Wed, 17 Mar 2010 10:34:25 +0100 added partial proof of supp for type schemes
Christian Urban <urbanc@in.tum.de> [Wed, 17 Mar 2010 10:34:25 +0100] rev 1473
added partial proof of supp for type schemes
Wed, 17 Mar 2010 09:57:54 +0100 Fix in alpha; support of the recursive Let works :)
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 09:57:54 +0100] rev 1472
Fix in alpha; support of the recursive Let works :)
Wed, 17 Mar 2010 09:42:56 +0100 The recursive supp just has one equation too much.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 09:42:56 +0100] rev 1471
The recursive supp just has one equation too much.
Wed, 17 Mar 2010 09:25:01 +0100 Fix for the change of alpha_gen.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 09:25:01 +0100] rev 1470
Fix for the change of alpha_gen.
Wed, 17 Mar 2010 09:18:27 +0100 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 09:18:27 +0100] rev 1469
merge
Wed, 17 Mar 2010 09:17:55 +0100 Generate compound FV and Alpha for recursive bindings.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 09:17:55 +0100] rev 1468
Generate compound FV and Alpha for recursive bindings.
Wed, 17 Mar 2010 08:39:46 +0100 Lifting theorems with compound fv and compound alpha.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 17 Mar 2010 08:39:46 +0100] rev 1467
Lifting theorems with compound fv and compound alpha.
Wed, 17 Mar 2010 08:07:25 +0100 commented out examples that should not work; but for example type-scheme example should work
Christian Urban <urbanc@in.tum.de> [Wed, 17 Mar 2010 08:07:25 +0100] rev 1466
commented out examples that should not work; but for example type-scheme example should work
Wed, 17 Mar 2010 06:49:33 +0100 added another supp-proof for the non-recursive case
Christian Urban <urbanc@in.tum.de> [Wed, 17 Mar 2010 06:49:33 +0100] rev 1465
added another supp-proof for the non-recursive case
Tue, 16 Mar 2010 20:07:13 +0100 Revert 7c8cd6eae8e2, now all proofs in Term5 go through, both recursive and not.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 20:07:13 +0100] rev 1464
Revert 7c8cd6eae8e2, now all proofs in Term5 go through, both recursive and not.
Tue, 16 Mar 2010 18:19:00 +0100 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 18:19:00 +0100] rev 1463
merge
Tue, 16 Mar 2010 18:18:08 +0100 The old recursive alpha works fine.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 18:18:08 +0100] rev 1462
The old recursive alpha works fine.
Tue, 16 Mar 2010 18:13:34 +0100 added the final unfolded result
Christian Urban <urbanc@in.tum.de> [Tue, 16 Mar 2010 18:13:34 +0100] rev 1461
added the final unfolded result
Tue, 16 Mar 2010 18:02:08 +0100 merge and proof of support for non-recursive case
Christian Urban <urbanc@in.tum.de> [Tue, 16 Mar 2010 18:02:08 +0100] rev 1460
merge and proof of support for non-recursive case
Tue, 16 Mar 2010 17:20:46 +0100 Added Term5 non-recursive. The bug is there only for the recursive case.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 17:20:46 +0100] rev 1459
Added Term5 non-recursive. The bug is there only for the recursive case.
Tue, 16 Mar 2010 17:11:32 +0100 Alpha is wrong.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 17:11:32 +0100] rev 1458
Alpha is wrong.
Tue, 16 Mar 2010 16:51:06 +0100 alpha_bn doesn't need the permutation in non-recursive case.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 16:51:06 +0100] rev 1457
alpha_bn doesn't need the permutation in non-recursive case.
Tue, 16 Mar 2010 16:17:05 +0100 alpha5_transp and equivp
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 16:17:05 +0100] rev 1456
alpha5_transp and equivp
Tue, 16 Mar 2010 15:38:14 +0100 alpha5_symp proved.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 15:38:14 +0100] rev 1455
alpha5_symp proved.
Tue, 16 Mar 2010 15:27:47 +0100 FV_bn generated for recursive functions as well, and used in main fv for bindings.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 15:27:47 +0100] rev 1454
FV_bn generated for recursive functions as well, and used in main fv for bindings.
Tue, 16 Mar 2010 12:08:37 +0100 The proof in 'Test' gets simpler.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 12:08:37 +0100] rev 1453
The proof in 'Test' gets simpler.
Tue, 16 Mar 2010 12:06:22 +0100 Removed pi o bn = bn' assumption in alpha
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 16 Mar 2010 12:06:22 +0100] rev 1452
Removed pi o bn = bn' assumption in alpha
Mon, 15 Mar 2010 23:42:56 +0100 merged (confirmed to work with Isabelle from 6th March)
Christian Urban <urbanc@in.tum.de> [Mon, 15 Mar 2010 23:42:56 +0100] rev 1451
merged (confirmed to work with Isabelle from 6th March)
Mon, 15 Mar 2010 17:52:31 +0100 another synchronisation
Christian Urban <urbanc@in.tum.de> [Mon, 15 Mar 2010 17:52:31 +0100] rev 1450
another synchronisation
Mon, 15 Mar 2010 17:51:35 +0100 proof for support when bn-function is present, but fb_function is empty
Christian Urban <urbanc@in.tum.de> [Mon, 15 Mar 2010 17:51:35 +0100] rev 1449
proof for support when bn-function is present, but fb_function is empty
Mon, 15 Mar 2010 17:42:17 +0100 fv_eqvt_cheat no longer needed.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 17:42:17 +0100] rev 1448
fv_eqvt_cheat no longer needed.
Mon, 15 Mar 2010 14:32:05 +0100 derive "inducts" from "induct" instead of lifting again is much faster.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 14:32:05 +0100] rev 1447
derive "inducts" from "induct" instead of lifting again is much faster.
Mon, 15 Mar 2010 13:56:17 +0100 build_eqvts works with recursive case if proper induction rule is used.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 13:56:17 +0100] rev 1446
build_eqvts works with recursive case if proper induction rule is used.
Mon, 15 Mar 2010 11:50:12 +0100 cheat_alpha_eqvt no longer needed; the proofs work.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 11:50:12 +0100] rev 1445
cheat_alpha_eqvt no longer needed; the proofs work.
Mon, 15 Mar 2010 10:36:09 +0100 LF works with new alpha...?
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 10:36:09 +0100] rev 1444
LF works with new alpha...?
Mon, 15 Mar 2010 10:07:15 +0100 explicit flag "cheat_equivp"
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 10:07:15 +0100] rev 1443
explicit flag "cheat_equivp"
Mon, 15 Mar 2010 10:02:19 +0100 Prove alpha_gen_compose_eqvt
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 10:02:19 +0100] rev 1442
Prove alpha_gen_compose_eqvt
Mon, 15 Mar 2010 09:27:25 +0100 Use eqvt.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 15 Mar 2010 09:27:25 +0100] rev 1441
Use eqvt.
Mon, 15 Mar 2010 08:39:23 +0100 added preliminary test version....but Test works now
Christian Urban <urbanc@in.tum.de> [Mon, 15 Mar 2010 08:39:23 +0100] rev 1440
added preliminary test version....but Test works now
Mon, 15 Mar 2010 08:28:10 +0100 added an eqvt-proof for bi
Christian Urban <urbanc@in.tum.de> [Mon, 15 Mar 2010 08:28:10 +0100] rev 1439
added an eqvt-proof for bi
Mon, 15 Mar 2010 06:11:35 +0100 synchronised with main hg-repository; used add_typedef_global in nominal_atoms
Christian Urban <urbanc@in.tum.de> [Mon, 15 Mar 2010 06:11:35 +0100] rev 1438
synchronised with main hg-repository; used add_typedef_global in nominal_atoms
Sun, 14 Mar 2010 11:36:15 +0100 localised the typedef in Attic (requires new Isabelle)
Christian Urban <urbanc@in.tum.de> [Sun, 14 Mar 2010 11:36:15 +0100] rev 1437
localised the typedef in Attic (requires new Isabelle)
Sat, 13 Mar 2010 13:49:15 +0100 started supp-fv proofs (is going to work)
Christian Urban <urbanc@in.tum.de> [Sat, 13 Mar 2010 13:49:15 +0100] rev 1436
started supp-fv proofs (is going to work)
Fri, 12 Mar 2010 17:42:31 +0100 Even with pattern simplified to a single clause, the supp equation doesn't seem true.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 12 Mar 2010 17:42:31 +0100] rev 1435
Even with pattern simplified to a single clause, the supp equation doesn't seem true.
Fri, 12 Mar 2010 12:42:35 +0100 Still don't know how to prove supp=fv for simplest Let...
Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 12 Mar 2010 12:42:35 +0100] rev 1434
Still don't know how to prove supp=fv for simplest Let...
Thu, 11 Mar 2010 20:49:31 +0100 Do not fail if the finite support proof fails.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 20:49:31 +0100] rev 1433
Do not fail if the finite support proof fails.
Thu, 11 Mar 2010 19:43:50 +0100 generalised the supp for atoms to all concrete atoms (not just names)
Christian Urban <urbanc@in.tum.de> [Thu, 11 Mar 2010 19:43:50 +0100] rev 1432
generalised the supp for atoms to all concrete atoms (not just names)
Thu, 11 Mar 2010 19:41:11 +0100 support of atoms at the end of Abs.thy
Christian Urban <urbanc@in.tum.de> [Thu, 11 Mar 2010 19:41:11 +0100] rev 1431
support of atoms at the end of Abs.thy
Thu, 11 Mar 2010 19:24:07 +0100 Trying to prove atom_image_fresh_swap
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 19:24:07 +0100] rev 1430
Trying to prove atom_image_fresh_swap
Thu, 11 Mar 2010 17:49:07 +0100 Finite_support proof no longer needed in LF.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 17:49:07 +0100] rev 1429
Finite_support proof no longer needed in LF.
Thu, 11 Mar 2010 17:47:29 +0100 Show that the new types are in finite support typeclass.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 17:47:29 +0100] rev 1428
Show that the new types are in finite support typeclass.
Thu, 11 Mar 2010 16:50:44 +0100 mk_supports_eq and supports_tac.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 16:50:44 +0100] rev 1427
mk_supports_eq and supports_tac.
Thu, 11 Mar 2010 16:16:15 +0100 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 16:16:15 +0100] rev 1426
merge
Thu, 11 Mar 2010 16:15:29 +0100 Fixes for term1 for new alpha. Still not able to show support equations.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 16:15:29 +0100] rev 1425
Fixes for term1 for new alpha. Still not able to show support equations.
Thu, 11 Mar 2010 16:12:15 +0100 merged
Christian Urban <urbanc@in.tum.de> [Thu, 11 Mar 2010 16:12:15 +0100] rev 1424
merged
Thu, 11 Mar 2010 15:10:07 +0100 finally the proof that new and old alpha agree
Christian Urban <urbanc@in.tum.de> [Thu, 11 Mar 2010 15:10:07 +0100] rev 1423
finally the proof that new and old alpha agree
Thu, 11 Mar 2010 15:11:57 +0100 Remove "_raw" from lifted theorems.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 15:11:57 +0100] rev 1422
Remove "_raw" from lifted theorems.
Thu, 11 Mar 2010 14:09:54 +0100 looking at trm5_equivp
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 14:09:54 +0100] rev 1421
looking at trm5_equivp
Thu, 11 Mar 2010 14:05:36 +0100 The cheats described explicitely.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 14:05:36 +0100] rev 1420
The cheats described explicitely.
Thu, 11 Mar 2010 13:44:54 +0100 The alpha5_eqvt tactic works if I manage to build the goal.
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.
Thu, 11 Mar 2010 13:34:45 +0100 With the 4 cheats, all examples fully lift.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 13:34:45 +0100] rev 1418
With the 4 cheats, all examples fully lift.
Thu, 11 Mar 2010 12:30:53 +0100 Lift alpha_bn_constants.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 12:30:53 +0100] rev 1417
Lift alpha_bn_constants.
Thu, 11 Mar 2010 12:26:24 +0100 Lifting constants.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 12:26:24 +0100] rev 1416
Lifting constants.
Thu, 11 Mar 2010 11:41:27 +0100 Proper error message.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 11:41:27 +0100] rev 1415
Proper error message.
Thu, 11 Mar 2010 11:32:37 +0100 Lifting constants works for all examples.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 11:32:37 +0100] rev 1414
Lifting constants works for all examples.
Thu, 11 Mar 2010 11:25:56 +0100 Remove tracing from fv/alpha.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 11:25:56 +0100] rev 1413
Remove tracing from fv/alpha.
Thu, 11 Mar 2010 11:25:18 +0100 Equivp working only on the standard alpha-equivalences.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 11:25:18 +0100] rev 1412
Equivp working only on the standard alpha-equivalences.
Thu, 11 Mar 2010 11:20:50 +0100 explicit cheat_fv_eqvt
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 11:20:50 +0100] rev 1411
explicit cheat_fv_eqvt
Thu, 11 Mar 2010 11:15:14 +0100 extract build_eqvts_tac.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 11:15:14 +0100] rev 1410
extract build_eqvts_tac.
Thu, 11 Mar 2010 10:39:29 +0100 build_eqvts no longer requires permutations.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 10:39:29 +0100] rev 1409
build_eqvts no longer requires permutations.
Thu, 11 Mar 2010 10:22:24 +0100 Add explicit alpha_eqvt_cheat.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 10:22:24 +0100] rev 1408
Add explicit alpha_eqvt_cheat.
Thu, 11 Mar 2010 10:10:23 +0100 Export tactic out of alpha_eqvt.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 11 Mar 2010 10:10:23 +0100] rev 1407
Export tactic out of alpha_eqvt.
Wed, 10 Mar 2010 16:59:08 +0100 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 16:59:08 +0100] rev 1406
merge
Wed, 10 Mar 2010 16:58:14 +0100 More tries about the proofs in trm5
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 16:58:14 +0100] rev 1405
More tries about the proofs in trm5
Wed, 10 Mar 2010 16:51:15 +0100 merged
Christian Urban <urbanc@in.tum.de> [Wed, 10 Mar 2010 16:51:15 +0100] rev 1404
merged
Wed, 10 Mar 2010 16:50:42 +0100 almost done with showing the equivalence between old and new alpha-equivalence (one subgoal remaining)
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)
Wed, 10 Mar 2010 15:40:15 +0100 alpha_equivp for trm5
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 15:40:15 +0100] rev 1402
alpha_equivp for trm5
Wed, 10 Mar 2010 15:34:13 +0100 Undoing mistakenly committed parser experiments.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 15:34:13 +0100] rev 1401
Undoing mistakenly committed parser experiments.
Wed, 10 Mar 2010 15:32:51 +0100 alpha_eqvt for recursive term1.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 15:32:51 +0100] rev 1400
alpha_eqvt for recursive term1.
Wed, 10 Mar 2010 14:47:04 +0100 Looking at alpha_eqvt for term5, not much progress.
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.
Wed, 10 Mar 2010 14:24:27 +0100 Reordered examples in Test.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 14:24:27 +0100] rev 1398
Reordered examples in Test.
Wed, 10 Mar 2010 13:29:12 +0100 Allows multiple bindings with same lhs.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 13:29:12 +0100] rev 1397
Allows multiple bindings with same lhs.
Wed, 10 Mar 2010 13:10:00 +0100 Linked parser to fv and alpha.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 13:10:00 +0100] rev 1396
Linked parser to fv and alpha.
Wed, 10 Mar 2010 12:53:44 +0100 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 12:53:44 +0100] rev 1395
merge
Wed, 10 Mar 2010 12:53:30 +0100 A minor fix for shallow binders. LF works again.
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.
Wed, 10 Mar 2010 12:48:55 +0100 merged
Christian Urban <urbanc@in.tum.de> [Wed, 10 Mar 2010 12:48:55 +0100] rev 1393
merged
Wed, 10 Mar 2010 12:48:38 +0100 parser produces ordered bn-fun information
Christian Urban <urbanc@in.tum.de> [Wed, 10 Mar 2010 12:48:38 +0100] rev 1392
parser produces ordered bn-fun information
Wed, 10 Mar 2010 11:39:28 +0100 Testing equalities in trm5, all seems good.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 11:39:28 +0100] rev 1391
Testing equalities in trm5, all seems good.
Wed, 10 Mar 2010 11:19:59 +0100 Fv&Alpha seem to work.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 11:19:59 +0100] rev 1390
Fv&Alpha seem to work.
Wed, 10 Mar 2010 10:47:21 +0100 include alpha in the definitions.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 10:47:21 +0100] rev 1389
include alpha in the definitions.
Wed, 10 Mar 2010 10:11:20 +0100 Filled the algorithm for alpha_bn_arg
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 10:11:20 +0100] rev 1388
Filled the algorithm for alpha_bn_arg
Wed, 10 Mar 2010 09:58:43 +0100 rhs of alpha_bn, and template for the arguments.
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.
Wed, 10 Mar 2010 09:45:38 +0100 alpha_bn_constr template
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 09:45:38 +0100] rev 1386
alpha_bn_constr template
Wed, 10 Mar 2010 09:36:07 +0100 exported template for alpha_bn
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 09:36:07 +0100] rev 1385
exported template for alpha_bn
Wed, 10 Mar 2010 09:10:11 +0100 merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 09:10:11 +0100] rev 1384
merge
Wed, 10 Mar 2010 09:09:52 +0100 Use alpha_bns in normal alpha defs.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 09:09:52 +0100] rev 1383
Use alpha_bns in normal alpha defs.
Wed, 10 Mar 2010 08:44:19 +0100 alpha_bn_frees
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 10 Mar 2010 08:44:19 +0100] rev 1382
alpha_bn_frees
Tue, 09 Mar 2010 22:10:10 +0100 merged
Christian Urban <urbanc@in.tum.de> [Tue, 09 Mar 2010 22:10:10 +0100] rev 1381
merged
Tue, 09 Mar 2010 22:08:38 +0100 added bn-information, but it is not yet ordered according to the dts
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
Tue, 09 Mar 2010 21:22:22 +0100 Separate lists for separate constructors, to match bn_eqs.
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.
Tue, 09 Mar 2010 17:25:35 +0100 All examples should work.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 17:25:35 +0100] rev 1378
All examples should work.
Tue, 09 Mar 2010 17:02:29 +0100 Fix to get old alpha.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 17:02:29 +0100] rev 1377
Fix to get old alpha.
Tue, 09 Mar 2010 16:57:51 +0100 Separate primrecs in Fv.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 16:57:51 +0100] rev 1376
Separate primrecs in Fv.
Tue, 09 Mar 2010 16:24:39 +0100 A version of Fv that takes into account recursive and non-recursive bindings.
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.
Tue, 09 Mar 2010 11:36:40 +0100 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:36:40 +0100] rev 1374
Trying to prove that old alpha is the same as new recursive one. Lets still to do.
Tue, 09 Mar 2010 11:06:57 +0100 fv_bi and alpha_bi
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 11:06:57 +0100] rev 1373
fv_bi and alpha_bi
Tue, 09 Mar 2010 09:55:19 +0100 merged
Christian Urban <urbanc@in.tum.de> [Tue, 09 Mar 2010 09:55:19 +0100] rev 1372
merged
Tue, 09 Mar 2010 09:54:58 +0100 added first test about new compat
Christian Urban <urbanc@in.tum.de> [Tue, 09 Mar 2010 09:54:58 +0100] rev 1371
added first test about new compat
Tue, 09 Mar 2010 09:38:49 +0100 fv_compat
Cezary Kaliszyk <kaliszyk@in.tum.de> [Tue, 09 Mar 2010 09:38:49 +0100] rev 1370
fv_compat
Tue, 09 Mar 2010 08:46:55 +0100 added another compat example
Christian Urban <urbanc@in.tum.de> [Tue, 09 Mar 2010 08:46:55 +0100] rev 1369
added another compat example
Mon, 08 Mar 2010 20:18:27 +0100 added a test-file for compatibility
Christian Urban <urbanc@in.tum.de> [Mon, 08 Mar 2010 20:18:27 +0100] rev 1368
added a test-file for compatibility
Mon, 08 Mar 2010 16:11:42 +0100 added compat definitions to some examples
Christian Urban <urbanc@in.tum.de> [Mon, 08 Mar 2010 16:11:42 +0100] rev 1367
added compat definitions to some examples
Mon, 08 Mar 2010 15:28:25 +0100 Proper recognition of atoms and atom sets.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Mon, 08 Mar 2010 15:28:25 +0100] rev 1366
Proper recognition of atoms and atom sets.
Mon, 08 Mar 2010 15:06:14 +0100 deleted comments about "weird"
Christian Urban <urbanc@in.tum.de> [Mon, 08 Mar 2010 15:06:14 +0100] rev 1365
deleted comments about "weird"
Mon, 08 Mar 2010 15:01:26 +0100 merged
Christian Urban <urbanc@in.tum.de> [Mon, 08 Mar 2010 15:01:26 +0100] rev 1364
merged
Mon, 08 Mar 2010 15:01:01 +0100 updated to new Isabelle
Christian Urban <urbanc@in.tum.de> [Mon, 08 Mar 2010 15:01:01 +0100] rev 1363
updated to new Isabelle
Mon, 08 Mar 2010 14:31:04 +0100 Term5 written as nominal_datatype is the recursive let.
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.
(0) -1000 -120 +120 +1000 tip