Cezary Kaliszyk <kaliszyk@in.tum.de> [Fri, 26 Feb 2010 10:34:04 +0100] rev 1276
To call quotient it is enough to export the alpha frees to proper constants and their respective equivp theorems.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Feb 2010 15:41:23 +0100] rev 1275
merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Feb 2010 15:40:09 +0100] rev 1274
Preparing the generalized lifting procedure
Christian Urban <urbanc@in.tum.de> [Thu, 25 Feb 2010 14:20:40 +0100] rev 1273
merged
Christian Urban <urbanc@in.tum.de> [Thu, 25 Feb 2010 14:20:10 +0100] rev 1272
added ott-example about Leroy96
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Feb 2010 14:14:40 +0100] rev 1271
Forgot to add one file.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Feb 2010 14:14:08 +0100] rev 1270
Split Terms into separate files and add them to tests.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Feb 2010 12:32:15 +0100] rev 1269
merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Feb 2010 12:30:50 +0100] rev 1268
Move the eqvt code out of Terms and fixed induction for single-rule examples.
Christian Urban <urbanc@in.tum.de> [Thu, 25 Feb 2010 12:24:37 +0100] rev 1267
merged
Christian Urban <urbanc@in.tum.de> [Thu, 25 Feb 2010 11:51:34 +0100] rev 1266
a few simplifications
Christian Urban <urbanc@in.tum.de> [Thu, 25 Feb 2010 11:30:00 +0100] rev 1265
first attempt to make sense out of the core-haskell definition
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Feb 2010 12:15:11 +0100] rev 1264
Code for proving eqvt, still in Terms.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Feb 2010 09:41:14 +0100] rev 1263
Use eqvt infrastructure.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Feb 2010 09:22:29 +0100] rev 1262
Simple function eqvt code.
Christian Urban <urbanc@in.tum.de> [Thu, 25 Feb 2010 08:40:52 +0100] rev 1261
added IsaMakefile...but so far included only a test for the parser
Christian Urban <urbanc@in.tum.de> [Thu, 25 Feb 2010 07:57:17 +0100] rev 1260
moved Quot package to Attic (still compiles there with "isabelle make")
Christian Urban <urbanc@in.tum.de> [Thu, 25 Feb 2010 07:48:57 +0100] rev 1259
merged
Christian Urban <urbanc@in.tum.de> [Thu, 25 Feb 2010 07:48:33 +0100] rev 1258
moved Nominal to "toplevel"
Cezary Kaliszyk <kaliszyk@in.tum.de> [Thu, 25 Feb 2010 07:05:52 +0100] rev 1257
Export perm_frees.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 23:25:30 +0100] rev 1256
Restructuring the code in Perm
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 18:38:49 +0100] rev 1255
Simplified and finised eqvt proofs for t1 and t5
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 17:42:52 +0100] rev 1254
merge
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 17:42:37 +0100] rev 1253
Define lifted perms.
Christian Urban <urbanc@in.tum.de> [Wed, 24 Feb 2010 17:32:43 +0100] rev 1252
merged
Christian Urban <urbanc@in.tum.de> [Wed, 24 Feb 2010 17:32:22 +0100] rev 1251
parsing and definition of raw datatype and bv-function work (not very beautiful)
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 15:39:17 +0100] rev 1250
With permute_rsp we can lift the instance proofs :).
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 15:36:07 +0100] rev 1249
Note the instance proofs, since they can be easily lifted.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 15:13:22 +0100] rev 1248
More refactoring and removed references to the global simpset in Perm.
Cezary Kaliszyk <kaliszyk@in.tum.de> [Wed, 24 Feb 2010 14:55:09 +0100] rev 1247
Factor-out 'prove_perm_empty'; I plan to use it in defining permutations on the lifted type.