Sat, 29 Sep 2007 21:39:48 +0200 Sign.the_const_constraint;
wenzelm [Sat, 29 Sep 2007 21:39:48 +0200] rev 24763
Sign.the_const_constraint;
Sat, 29 Sep 2007 21:39:47 +0200 added declare_typ_names;
wenzelm [Sat, 29 Sep 2007 21:39:47 +0200] rev 24762
added declare_typ_names; replace_dummy_patterns: canonical argument order;
Sat, 29 Sep 2007 21:39:46 +0200 removed obsolete external interface add_const_constraint;
wenzelm [Sat, 29 Sep 2007 21:39:46 +0200] rev 24761
removed obsolete external interface add_const_constraint; removed redundant const_constraint; renamed add_const_constraint_i to add_const_constraint;
Sat, 29 Sep 2007 21:39:45 +0200 Sign.add_const_constraint;
wenzelm [Sat, 29 Sep 2007 21:39:45 +0200] rev 24760
Sign.add_const_constraint;
Sat, 29 Sep 2007 21:39:44 +0200 fixed metis proof (Why did it stop working?);
wenzelm [Sat, 29 Sep 2007 21:39:44 +0200] rev 24759
fixed metis proof (Why did it stop working?);
Sat, 29 Sep 2007 10:47:05 +0200 swapped machines for at-sml-dev and at-sml-dev-p
isatest [Sat, 29 Sep 2007 10:47:05 +0200] rev 24758
swapped machines for at-sml-dev and at-sml-dev-p
Sat, 29 Sep 2007 10:45:41 +0200 no proof terms for smlnj
isatest [Sat, 29 Sep 2007 10:45:41 +0200] rev 24757
no proof terms for smlnj
Sat, 29 Sep 2007 10:43:54 +0200 add -p 2 at-sml-dev test for HOL proof terms sessions only
kleing [Sat, 29 Sep 2007 10:43:54 +0200] rev 24756
add -p 2 at-sml-dev test for HOL proof terms sessions only
Sat, 29 Sep 2007 10:41:45 +0200 at-sml-dev session with -p 2
kleing [Sat, 29 Sep 2007 10:41:45 +0200] rev 24755
at-sml-dev session with -p 2
Sat, 29 Sep 2007 10:40:12 +0200 Added target for proof term sessions (those that need -p 2)
kleing [Sat, 29 Sep 2007 10:40:12 +0200] rev 24754
Added target for proof term sessions (those that need -p 2)
Sat, 29 Sep 2007 10:04:52 +0200 accept single logic and target as argument
kleing [Sat, 29 Sep 2007 10:04:52 +0200] rev 24753
accept single logic and target as argument
Sat, 29 Sep 2007 08:58:57 +0200 exported constraint interfaces
haftmann [Sat, 29 Sep 2007 08:58:57 +0200] rev 24752
exported constraint interfaces
Sat, 29 Sep 2007 08:58:56 +0200 exported intern_expr
haftmann [Sat, 29 Sep 2007 08:58:56 +0200] rev 24751
exported intern_expr
Sat, 29 Sep 2007 08:58:55 +0200 added ocaml strings
haftmann [Sat, 29 Sep 2007 08:58:55 +0200] rev 24750
added ocaml strings
Sat, 29 Sep 2007 08:58:54 +0200 further localization
haftmann [Sat, 29 Sep 2007 08:58:54 +0200] rev 24749
further localization
Sat, 29 Sep 2007 08:58:51 +0200 proper syntax during class specification
haftmann [Sat, 29 Sep 2007 08:58:51 +0200] rev 24748
proper syntax during class specification
Fri, 28 Sep 2007 10:35:53 +0200 prove_strong_ind now uses InductivePackage.rulify.
berghofe [Fri, 28 Sep 2007 10:35:53 +0200] rev 24747
prove_strong_ind now uses InductivePackage.rulify.
Fri, 28 Sep 2007 10:32:38 +0200 Adapted to changes in interface of add_inductive_i.
berghofe [Fri, 28 Sep 2007 10:32:38 +0200] rev 24746
Adapted to changes in interface of add_inductive_i.
Fri, 28 Sep 2007 10:30:51 +0200 add_inductive_i now takes typ instead of typ option as argument.
berghofe [Fri, 28 Sep 2007 10:30:51 +0200] rev 24745
add_inductive_i now takes typ instead of typ option as argument.
Fri, 28 Sep 2007 10:29:35 +0200 - add_inductive_i now takes typ instead of typ option as argument
berghofe [Fri, 28 Sep 2007 10:29:35 +0200] rev 24744
- add_inductive_i now takes typ instead of typ option as argument - close_rule is now applied before expanding abbreviations - rulify applies norm_hhf again
Thu, 27 Sep 2007 17:57:12 +0200 proper handling of chained facts;
wenzelm [Thu, 27 Sep 2007 17:57:12 +0200] rev 24743
proper handling of chained facts;
Thu, 27 Sep 2007 17:55:28 +0200 removal of some "ref"s from res_axioms.ML; a side-effect is that the ordering
paulson [Thu, 27 Sep 2007 17:55:28 +0200] rev 24742
removal of some "ref"s from res_axioms.ML; a side-effect is that the ordering theorems of Nat.thy are hidden by the Ordering.thy versions
Thu, 27 Sep 2007 17:28:05 +0200 Fixed setup of transitivity reasoner (function decomp).
ballarin [Thu, 27 Sep 2007 17:28:05 +0200] rev 24741
Fixed setup of transitivity reasoner (function decomp).
Thu, 27 Sep 2007 17:22:15 +0200 some more simultaneous use_thys;
wenzelm [Thu, 27 Sep 2007 17:22:15 +0200] rev 24740
some more simultaneous use_thys;
Thu, 27 Sep 2007 11:46:05 +0200 read: explicit treatment of scanner failure;
wenzelm [Thu, 27 Sep 2007 11:46:05 +0200] rev 24739
read: explicit treatment of scanner failure;
Wed, 26 Sep 2007 22:38:11 +0200 tuned;
wenzelm [Wed, 26 Sep 2007 22:38:11 +0200] rev 24738
tuned;
Wed, 26 Sep 2007 22:28:00 +0200 tuned;
wenzelm [Wed, 26 Sep 2007 22:28:00 +0200] rev 24737
tuned;
Wed, 26 Sep 2007 22:27:44 +0200 tuned;
wenzelm [Wed, 26 Sep 2007 22:27:44 +0200] rev 24736
tuned;
Wed, 26 Sep 2007 22:21:05 +0200 * Pure/Isar: unified specification syntax admits type inference and dummy patterns;
wenzelm [Wed, 26 Sep 2007 22:21:05 +0200] rev 24735
* Pure/Isar: unified specification syntax admits type inference and dummy patterns; print mode: no_abbrevs;
Wed, 26 Sep 2007 22:21:02 +0200 read/check_specification: free_dummy_patterns;
wenzelm [Wed, 26 Sep 2007 22:21:02 +0200] rev 24734
read/check_specification: free_dummy_patterns;
Wed, 26 Sep 2007 22:20:59 +0200 added free_dummy_patterns;
wenzelm [Wed, 26 Sep 2007 22:20:59 +0200] rev 24733
added free_dummy_patterns;
Wed, 26 Sep 2007 20:50:34 +0200 added minimize_sort, complete_sort;
wenzelm [Wed, 26 Sep 2007 20:50:34 +0200] rev 24732
added minimize_sort, complete_sort;
Wed, 26 Sep 2007 20:50:33 +0200 Sign.minimize/complete_sort;
wenzelm [Wed, 26 Sep 2007 20:50:33 +0200] rev 24731
Sign.minimize/complete_sort;
Wed, 26 Sep 2007 20:27:58 +0200 convenient obtain rule for sets
haftmann [Wed, 26 Sep 2007 20:27:58 +0200] rev 24730
convenient obtain rule for sets
Wed, 26 Sep 2007 20:27:57 +0200 added code lemma for 1
haftmann [Wed, 26 Sep 2007 20:27:57 +0200] rev 24729
added code lemma for 1
Wed, 26 Sep 2007 20:27:55 +0200 moved Finite_Set before Datatype
haftmann [Wed, 26 Sep 2007 20:27:55 +0200] rev 24728
moved Finite_Set before Datatype
Wed, 26 Sep 2007 19:19:38 +0200 adapted variable order for inductive cases (determined by read_specification *before* expanding abbreviations);
wenzelm [Wed, 26 Sep 2007 19:19:38 +0200] rev 24727
adapted variable order for inductive cases (determined by read_specification *before* expanding abbreviations);
Wed, 26 Sep 2007 19:18:01 +0200 Attrib.eval_thms;
wenzelm [Wed, 26 Sep 2007 19:18:01 +0200] rev 24726
Attrib.eval_thms; Syntax.parse/check;
Wed, 26 Sep 2007 19:18:00 +0200 Attrib.eval_thms;
wenzelm [Wed, 26 Sep 2007 19:18:00 +0200] rev 24725
Attrib.eval_thms;
Wed, 26 Sep 2007 19:17:59 +0200 read/check_specification: proper type inference across multiple sections, result is in closed form;
wenzelm [Wed, 26 Sep 2007 19:17:59 +0200] rev 24724
read/check_specification: proper type inference across multiple sections, result is in closed form; added read/check_free_specification for single section, non-closed form;
Wed, 26 Sep 2007 19:17:58 +0200 added eval_thms;
wenzelm [Wed, 26 Sep 2007 19:17:58 +0200] rev 24723
added eval_thms;
Wed, 26 Sep 2007 19:17:57 +0200 minimal adaptions for Specification.read/check_specification;
wenzelm [Wed, 26 Sep 2007 19:17:57 +0200] rev 24722
minimal adaptions for Specification.read/check_specification;
Wed, 26 Sep 2007 19:17:56 +0200 proper Specification.read_specification;
wenzelm [Wed, 26 Sep 2007 19:17:56 +0200] rev 24721
proper Specification.read_specification; Attrib.eval_thms;
Wed, 26 Sep 2007 19:17:55 +0200 removed dead code;
wenzelm [Wed, 26 Sep 2007 19:17:55 +0200] rev 24720
removed dead code;
Wed, 26 Sep 2007 11:27:46 +0200 declare_constraints: declare (fix) type variables within constraints, but not terms themselves;
wenzelm [Wed, 26 Sep 2007 11:27:46 +0200] rev 24719
declare_constraints: declare (fix) type variables within constraints, but not terms themselves;
Wed, 26 Sep 2007 09:05:58 +0200 made SML/NJ happy
haftmann [Wed, 26 Sep 2007 09:05:58 +0200] rev 24718
made SML/NJ happy
Tue, 25 Sep 2007 21:08:36 +0200 rudimentary support for Haskell
haftmann [Tue, 25 Sep 2007 21:08:36 +0200] rev 24717
rudimentary support for Haskell
Tue, 25 Sep 2007 21:08:35 +0200 added support for Haskell, OCaml
haftmann [Tue, 25 Sep 2007 21:08:35 +0200] rev 24716
added support for Haskell, OCaml
Tue, 25 Sep 2007 21:08:34 +0200 Efficient_Nat and Pretty_Int integrated with ML_Int
haftmann [Tue, 25 Sep 2007 21:08:34 +0200] rev 24715
Efficient_Nat and Pretty_Int integrated with ML_Int
Tue, 25 Sep 2007 17:06:19 +0200 proper Sign operations instead of Theory aliases;
wenzelm [Tue, 25 Sep 2007 17:06:19 +0200] rev 24714
proper Sign operations instead of Theory aliases; tuned functor application;
Tue, 25 Sep 2007 17:06:18 +0200 tuned functor application;
wenzelm [Tue, 25 Sep 2007 17:06:18 +0200] rev 24713
tuned functor application;
Tue, 25 Sep 2007 17:06:14 +0200 proper Sign operations instead of Theory aliases;
wenzelm [Tue, 25 Sep 2007 17:06:14 +0200] rev 24712
proper Sign operations instead of Theory aliases;
Tue, 25 Sep 2007 15:34:35 +0200 simplified interpretation setup;
wenzelm [Tue, 25 Sep 2007 15:34:35 +0200] rev 24711
simplified interpretation setup;
Tue, 25 Sep 2007 13:42:59 +0200 size hook
haftmann [Tue, 25 Sep 2007 13:42:59 +0200] rev 24710
size hook
Tue, 25 Sep 2007 13:28:42 +0200 removed redundant global_parse operations;
wenzelm [Tue, 25 Sep 2007 13:28:42 +0200] rev 24709
removed redundant global_parse operations; renamed global_XXX to XXX_global;
Tue, 25 Sep 2007 13:28:41 +0200 Syntax.parse/check/read;
wenzelm [Tue, 25 Sep 2007 13:28:41 +0200] rev 24708
Syntax.parse/check/read; no export of read/cert_axm;
Tue, 25 Sep 2007 13:28:37 +0200 Syntax.parse/check/read;
wenzelm [Tue, 25 Sep 2007 13:28:37 +0200] rev 24707
Syntax.parse/check/read;
Tue, 25 Sep 2007 13:28:35 +0200 * Pure/Syntax: generic interfaces for parsing and type checking;
wenzelm [Tue, 25 Sep 2007 13:28:35 +0200] rev 24706
* Pure/Syntax: generic interfaces for parsing and type checking; tuned;
Tue, 25 Sep 2007 12:59:24 +0200 Simplified proof due to improved integration of order_tac and simp.
ballarin [Tue, 25 Sep 2007 12:59:24 +0200] rev 24705
Simplified proof due to improved integration of order_tac and simp.
Tue, 25 Sep 2007 12:56:27 +0200 Transitivity reasoner gets additional argument of premises to improve integration with simplifier.
ballarin [Tue, 25 Sep 2007 12:56:27 +0200] rev 24704
Transitivity reasoner gets additional argument of premises to improve integration with simplifier.
(0) -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 +30000 tip