Tue, 24 Apr 2007 17:16:55 +0200 narboux fixes last commit
Tue, 24 Apr 2007 16:44:11 +0200 narboux add two lemmas dealing with freshness on permutations.
Tue, 24 Apr 2007 15:19:33 +0200 berghofe Added datatype_case.ML and nominal_fresh_fun.ML.
Tue, 24 Apr 2007 15:18:42 +0200 berghofe Added datatype_case.
Tue, 24 Apr 2007 15:18:09 +0200 berghofe Added intro / elim rules for prod_case.
Tue, 24 Apr 2007 15:17:22 +0200 berghofe sum_case is now authentic.
Tue, 24 Apr 2007 15:15:52 +0200 berghofe Adapted to new parse translation for case expressions.
Tue, 24 Apr 2007 15:14:31 +0200 berghofe Parse / print translations for nested case expressions, taken
Tue, 24 Apr 2007 15:13:19 +0200 berghofe Streamlined datatype_codegen function using new datatype_of_case
Tue, 24 Apr 2007 15:11:07 +0200 berghofe - Moved parse / print translations for case to datatype_case.ML
Tue, 24 Apr 2007 15:07:27 +0200 berghofe case constants are now authentic.
Tue, 24 Apr 2007 14:02:16 +0200 narboux oups : wrong commit
Tue, 24 Apr 2007 14:01:23 +0200 narboux adds op in front of an infix to fix SML compilation
Mon, 23 Apr 2007 20:44:12 +0200 wenzelm sane version of read_termTs (proper freeze);
Mon, 23 Apr 2007 20:44:11 +0200 wenzelm read_instantiations: proper type-inference with fixed variables, infer parameter types as well;
Mon, 23 Apr 2007 20:44:10 +0200 wenzelm added paramify_vars;
Mon, 23 Apr 2007 20:44:09 +0200 wenzelm def_simproc(_i): proper ProofContext.read/cert_terms;
Mon, 23 Apr 2007 20:44:08 +0200 wenzelm simplified ProofContext.read_termTs;
Mon, 23 Apr 2007 18:38:42 +0200 urbanc simplified the proof of pt_set_eqvt (as suggested by Randy Pollack)
Mon, 23 Apr 2007 16:38:40 +0200 haftmann initial commit
Sat, 21 Apr 2007 19:32:32 +0200 huffman faster proof of wf_eq_minimal
Sat, 21 Apr 2007 11:07:45 +0200 wenzelm export get_sort (belongs to Syntax module);
Sat, 21 Apr 2007 11:07:44 +0200 wenzelm TypeExt.decode_term;
Sat, 21 Apr 2007 11:07:42 +0200 wenzelm added decode_term (belongs to Syntax module);
Sat, 21 Apr 2007 01:34:15 +0200 urbanc tuned the setup of fresh_fun
Fri, 20 Apr 2007 17:58:27 +0200 haftmann defs are added to code data
Fri, 20 Apr 2007 17:58:26 +0200 haftmann repaired value restriction problem
Fri, 20 Apr 2007 17:58:25 +0200 haftmann reverted to classical syntax for K_record
Fri, 20 Apr 2007 17:58:24 +0200 haftmann tuned
Fri, 20 Apr 2007 16:55:38 +0200 ballarin Interpretation equations applied to attributes
Fri, 20 Apr 2007 16:54:57 +0200 ballarin Interpretation equations applied to attributes;
Fri, 20 Apr 2007 16:11:17 +0200 berghofe Modified eqvt_tac to avoid failure due to introduction rules
Fri, 20 Apr 2007 15:13:06 +0200 haftmann clarifed
Fri, 20 Apr 2007 14:30:35 +0200 narboux modify fresh_fun_simp to ease debugging
Fri, 20 Apr 2007 13:30:51 +0200 haftmann updated code generator
Fri, 20 Apr 2007 13:11:47 +0200 haftmann updated
Fri, 20 Apr 2007 11:21:53 +0200 haftmann adds extracted program to code theorem table
Fri, 20 Apr 2007 11:21:52 +0200 haftmann unfold attribute now also accepts HOL equations
Fri, 20 Apr 2007 11:21:50 +0200 haftmann added more stuff
Fri, 20 Apr 2007 11:21:49 +0200 haftmann add definitions explicitly to code generator table
Fri, 20 Apr 2007 11:21:48 +0200 haftmann cleared dead code
Fri, 20 Apr 2007 11:21:47 +0200 haftmann moved axclass module closer to core system
Fri, 20 Apr 2007 11:21:42 +0200 haftmann Isar definitions are now added explicitly to code theorem table
Fri, 20 Apr 2007 11:21:41 +0200 haftmann improved case unfolding
Fri, 20 Apr 2007 11:21:40 +0200 haftmann switched from recdef to function package; constants add, mul, pow now curried; infix syntax for algebraic operations.
Fri, 20 Apr 2007 11:21:39 +0200 haftmann tuned syntax: K_record is now an authentic constant
Fri, 20 Apr 2007 11:21:38 +0200 haftmann tuned: now using function package
Fri, 20 Apr 2007 11:21:37 +0200 haftmann transfer_tac accepts also HOL equations as theorems
Fri, 20 Apr 2007 11:21:36 +0200 haftmann shifted min/max to class order
Fri, 20 Apr 2007 11:21:35 +0200 haftmann tuned
Fri, 20 Apr 2007 11:21:34 +0200 haftmann added class tutorial
Fri, 20 Apr 2007 11:21:33 +0200 haftmann code generator changes
Fri, 20 Apr 2007 10:09:32 +0200 krauss generate page labels
Fri, 20 Apr 2007 10:06:11 +0200 krauss definition lookup via terms, not names. Methods "relation" and "lexicographic_order"
Fri, 20 Apr 2007 00:28:07 +0200 urbanc declared lemmas true_eqvt and false_eqvt to be equivariant (suggested by samth at ccs.neu.edu)
Thu, 19 Apr 2007 18:23:11 +0200 paulson trying to make single-step proofs work better, especially if they contain
Thu, 19 Apr 2007 16:38:59 +0200 berghofe nominal_inductive no longer proves equivariance.
Thu, 19 Apr 2007 16:27:53 +0200 narboux add a tactic to generate fresh names
Wed, 18 Apr 2007 21:30:14 +0200 wenzelm simplified ProofContext.infer_types(_pats);
Wed, 18 Apr 2007 16:23:31 +0200 dixon Improved comments.
(0) -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip