Wed, 20 Feb 2013 14:44:00 +0100 added case taken out by mistake
blanchet [Wed, 20 Feb 2013 14:44:00 +0100] rev 51202
added case taken out by mistake
Wed, 20 Feb 2013 14:21:17 +0100 tuning (removed redundant datatype)
blanchet [Wed, 20 Feb 2013 14:21:17 +0100] rev 51201
tuning (removed redundant datatype)
Wed, 20 Feb 2013 14:10:51 +0100 minimize SMT proofs with E if Isar proofs are desired and Metis managed to preplay
blanchet [Wed, 20 Feb 2013 14:10:51 +0100] rev 51200
minimize SMT proofs with E if Isar proofs are desired and Metis managed to preplay
Wed, 20 Feb 2013 13:04:03 +0100 honor linearization option also in the evaluation driver
blanchet [Wed, 20 Feb 2013 13:04:03 +0100] rev 51199
honor linearization option also in the evaluation driver
Wed, 20 Feb 2013 10:54:13 +0100 got rid of rump support for Vampire definitions
blanchet [Wed, 20 Feb 2013 10:54:13 +0100] rev 51198
got rid of rump support for Vampire definitions
Wed, 20 Feb 2013 10:45:23 +0100 optimize Isar output some more
blanchet [Wed, 20 Feb 2013 10:45:23 +0100] rev 51197
optimize Isar output some more
Wed, 20 Feb 2013 10:45:01 +0100 turn off more evil Vampire options to facilitate Isar proof generation
blanchet [Wed, 20 Feb 2013 10:45:01 +0100] rev 51196
turn off more evil Vampire options to facilitate Isar proof generation
Wed, 20 Feb 2013 09:58:28 +0100 fixed typo in option name
blanchet [Wed, 20 Feb 2013 09:58:28 +0100] rev 51195
fixed typo in option name
Wed, 20 Feb 2013 08:56:34 +0100 tuning
blanchet [Wed, 20 Feb 2013 08:56:34 +0100] rev 51194
tuning
Wed, 20 Feb 2013 08:44:24 +0100 use new skolemizer only if some skolems have two or more arguments -- otherwise the old skolemizer cannot get the arg order wrong
blanchet [Wed, 20 Feb 2013 08:44:24 +0100] rev 51193
use new skolemizer only if some skolems have two or more arguments -- otherwise the old skolemizer cannot get the arg order wrong
Wed, 20 Feb 2013 08:44:24 +0100 slacker comparison for Skolems, to avoid trivial equations
blanchet [Wed, 20 Feb 2013 08:44:24 +0100] rev 51192
slacker comparison for Skolems, to avoid trivial equations
Wed, 20 Feb 2013 08:44:24 +0100 auto-minimizer should respect "isar_proofs = true"
blanchet [Wed, 20 Feb 2013 08:44:24 +0100] rev 51191
auto-minimizer should respect "isar_proofs = true"
Wed, 20 Feb 2013 08:44:24 +0100 made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
blanchet [Wed, 20 Feb 2013 08:44:24 +0100] rev 51190
made "isar_proofs" a 3-way option, to provide a way to totally disable isar_proofs if desired
Wed, 20 Feb 2013 08:44:24 +0100 alias for people like me
blanchet [Wed, 20 Feb 2013 08:44:24 +0100] rev 51189
alias for people like me
Tue, 19 Feb 2013 19:44:10 +0100 dropped spurious left-over from 0a2371e7ced3
haftmann [Tue, 19 Feb 2013 19:44:10 +0100] rev 51188
dropped spurious left-over from 0a2371e7ced3
Tue, 19 Feb 2013 17:01:06 +0100 avoid using "smt" for minimization -- better use the prover itself, since then Sledgehammer gets to try metis again and gives the opportunity to output an Isar proof -- and show Isar proof as fallback for SMT proofs
blanchet [Tue, 19 Feb 2013 17:01:06 +0100] rev 51187
avoid using "smt" for minimization -- better use the prover itself, since then Sledgehammer gets to try metis again and gives the opportunity to output an Isar proof -- and show Isar proof as fallback for SMT proofs
Tue, 19 Feb 2013 15:37:42 +0100 interpret "max_facts" argument in a slice-dependent fashion, instead of forcing the same number of facts to all slices
blanchet [Tue, 19 Feb 2013 15:37:42 +0100] rev 51186
interpret "max_facts" argument in a slice-dependent fashion, instead of forcing the same number of facts to all slices
Tue, 19 Feb 2013 15:03:36 +0100 delete also predicates on relations when hiding an implementation of an abstract type
kuncar [Tue, 19 Feb 2013 15:03:36 +0100] rev 51185
delete also predicates on relations when hiding an implementation of an abstract type
Tue, 19 Feb 2013 13:37:07 +0100 reintroduced crucial sorting accidentally lost in 962190eab40d
blanchet [Tue, 19 Feb 2013 13:37:07 +0100] rev 51184
reintroduced crucial sorting accidentally lost in 962190eab40d
Tue, 19 Feb 2013 13:27:33 +0100 compile
blanchet [Tue, 19 Feb 2013 13:27:33 +0100] rev 51183
compile
Tue, 19 Feb 2013 13:21:49 +0100 provide two modes for MaSh driver: linearized or real visibility
blanchet [Tue, 19 Feb 2013 13:21:49 +0100] rev 51182
provide two modes for MaSh driver: linearized or real visibility
Mon, 18 Feb 2013 18:34:55 +0100 implement (more) accurate computation of parents
blanchet [Mon, 18 Feb 2013 18:34:55 +0100] rev 51181
implement (more) accurate computation of parents
Mon, 18 Feb 2013 18:34:54 +0100 tuning
blanchet [Mon, 18 Feb 2013 18:34:54 +0100] rev 51180
tuning
Mon, 18 Feb 2013 12:16:27 +0100 split isar_step into isar_step, fix, assms; made isar_proof explicit; register fixed variables in ctxt and auto_fix terms to avoid superfluous annotations
smolkas [Mon, 18 Feb 2013 12:16:27 +0100] rev 51179
split isar_step into isar_step, fix, assms; made isar_proof explicit; register fixed variables in ctxt and auto_fix terms to avoid superfluous annotations
Mon, 18 Feb 2013 12:16:02 +0100 simplified byline, isar_qualifier
smolkas [Mon, 18 Feb 2013 12:16:02 +0100] rev 51178
simplified byline, isar_qualifier
Mon, 18 Feb 2013 11:33:43 +0100 tuned code: factored out parent computation
blanchet [Mon, 18 Feb 2013 11:33:43 +0100] rev 51177
tuned code: factored out parent computation
Mon, 18 Feb 2013 10:43:36 +0100 tuned code
blanchet [Mon, 18 Feb 2013 10:43:36 +0100] rev 51176
tuned code
Mon, 18 Feb 2013 08:52:23 +0100 simplify definition as sort constraints ensure finiteness (thanks to Jesus Aransay)
Andreas Lochbihler [Mon, 18 Feb 2013 08:52:23 +0100] rev 51175
simplify definition as sort constraints ensure finiteness (thanks to Jesus Aransay)
Sun, 17 Feb 2013 22:56:54 +0100 fundamentals about discrete logarithm and square root
haftmann [Sun, 17 Feb 2013 22:56:54 +0100] rev 51174
fundamentals about discrete logarithm and square root
Sun, 17 Feb 2013 21:29:30 +0100 Sieve of Eratosthenes
haftmann [Sun, 17 Feb 2013 21:29:30 +0100] rev 51173
Sieve of Eratosthenes
Sun, 17 Feb 2013 20:45:49 +0100 note on parallel computation
haftmann [Sun, 17 Feb 2013 20:45:49 +0100] rev 51172
note on parallel computation
Sun, 17 Feb 2013 19:39:00 +0100 corrected and clarified Code_Binary_Nat vs. Code_Target_Nat
haftmann [Sun, 17 Feb 2013 19:39:00 +0100] rev 51171
corrected and clarified Code_Binary_Nat vs. Code_Target_Nat
Sun, 17 Feb 2013 11:34:40 +0100 simplified construction of upto_aux
haftmann [Sun, 17 Feb 2013 11:34:40 +0100] rev 51170
simplified construction of upto_aux
Sun, 17 Feb 2013 11:06:10 +0100 merged
haftmann [Sun, 17 Feb 2013 11:06:10 +0100] rev 51169
merged
Sat, 16 Feb 2013 08:21:08 +0100 restored proper order of NEWS entries (lost due too long-waiting patches)
haftmann [Sat, 16 Feb 2013 08:21:08 +0100] rev 51168
restored proper order of NEWS entries (lost due too long-waiting patches)
Sun, 17 Feb 2013 10:40:53 +0100 CONTRIBUTORS
haftmann [Sun, 17 Feb 2013 10:40:53 +0100] rev 51167
CONTRIBUTORS
Sat, 16 Feb 2013 15:27:10 +0100 tail recursive code for function "upto"
nipkow [Sat, 16 Feb 2013 15:27:10 +0100] rev 51166
tail recursive code for function "upto"
Fri, 15 Feb 2013 16:53:39 +0100 tuning
blanchet [Fri, 15 Feb 2013 16:53:39 +0100] rev 51165
tuning
Fri, 15 Feb 2013 16:40:39 +0100 repaired collateral damage from 4f0147ed8bcb
blanchet [Fri, 15 Feb 2013 16:40:39 +0100] rev 51164
repaired collateral damage from 4f0147ed8bcb
Fri, 15 Feb 2013 16:17:05 +0100 Backed out changeset: 3fe7242f8346,
traytel [Fri, 15 Feb 2013 16:17:05 +0100] rev 51163
Backed out changeset: 3fe7242f8346, many proofs (e.g. in Extended_Real and Approximation) rely on coercions not being lifted over sets
Fri, 15 Feb 2013 12:48:20 +0100 dropped now obsolete hint;
haftmann [Fri, 15 Feb 2013 12:48:20 +0100] rev 51162
dropped now obsolete hint; a few words on theory IArray; dropped reference to obsolete theory Efficient_Nat
Fri, 15 Feb 2013 11:47:34 +0100 attempt to re-establish conventions which theories are loaded into the grand unified library theory;
haftmann [Fri, 15 Feb 2013 11:47:34 +0100] rev 51161
attempt to re-establish conventions which theories are loaded into the grand unified library theory; four different code generation tests for different code setup constellations; augment code generation setup where necessary
Fri, 15 Feb 2013 11:47:33 +0100 systematic conversions between nat and nibble/char;
haftmann [Fri, 15 Feb 2013 11:47:33 +0100] rev 51160
systematic conversions between nat and nibble/char; more uniform approaches to execute operations on nibble/char
Fri, 15 Feb 2013 15:22:16 +0100 coercions between base types can be lifted to sets
traytel [Fri, 15 Feb 2013 15:22:16 +0100] rev 51159
coercions between base types can be lifted to sets
Fri, 15 Feb 2013 13:54:54 +0100 annotate obtains with types
blanchet [Fri, 15 Feb 2013 13:54:54 +0100] rev 51158
annotate obtains with types
Fri, 15 Feb 2013 13:43:06 +0100 merge
blanchet [Fri, 15 Feb 2013 13:43:06 +0100] rev 51157
merge
Fri, 15 Feb 2013 13:37:37 +0100 made check for conjecture skolemization sound
blanchet [Fri, 15 Feb 2013 13:37:37 +0100] rev 51156
made check for conjecture skolemization sound
Fri, 15 Feb 2013 13:29:37 +0100 use safe var index
smolkas [Fri, 15 Feb 2013 13:29:37 +0100] rev 51155
use safe var index
Fri, 15 Feb 2013 12:16:24 +0100 merged
Andreas Lochbihler [Fri, 15 Feb 2013 12:16:24 +0100] rev 51154
merged
Fri, 15 Feb 2013 11:02:34 +0100 more type class instances for Numeral_Type (contributed by Jesus Aransay)
Andreas Lochbihler [Fri, 15 Feb 2013 11:02:34 +0100] rev 51153
more type class instances for Numeral_Type (contributed by Jesus Aransay)
Fri, 15 Feb 2013 10:52:47 +0100 added lemma
Andreas Lochbihler [Fri, 15 Feb 2013 10:52:47 +0100] rev 51152
added lemma
Fri, 15 Feb 2013 12:10:09 +0100 merge
blanchet [Fri, 15 Feb 2013 12:10:09 +0100] rev 51151
merge
Fri, 15 Feb 2013 11:36:34 +0100 merge
blanchet [Fri, 15 Feb 2013 11:36:34 +0100] rev 51150
merge
Fri, 15 Feb 2013 11:27:15 +0100 skolemize conjecture properly in Isar proof
blanchet [Fri, 15 Feb 2013 11:27:15 +0100] rev 51149
skolemize conjecture properly in Isar proof
Fri, 15 Feb 2013 10:48:06 +0100 tuning -- refactoring in preparation for handling skolemization of conjecture
blanchet [Fri, 15 Feb 2013 10:48:06 +0100] rev 51148
tuning -- refactoring in preparation for handling skolemization of conjecture
Fri, 15 Feb 2013 10:18:44 +0100 removed dead weight from data structure
blanchet [Fri, 15 Feb 2013 10:18:44 +0100] rev 51147
removed dead weight from data structure
Fri, 15 Feb 2013 10:13:04 +0100 tuned code
blanchet [Fri, 15 Feb 2013 10:13:04 +0100] rev 51146
tuned code
Fri, 15 Feb 2013 10:00:25 +0100 tuned code
blanchet [Fri, 15 Feb 2013 10:00:25 +0100] rev 51145
tuned code
Fri, 15 Feb 2013 08:31:31 +0100 less customary term_of conversions;
haftmann [Fri, 15 Feb 2013 08:31:31 +0100] rev 51144
less customary term_of conversions; spurious side effect on method reflection
Fri, 15 Feb 2013 08:31:31 +0100 two target language numeral types: integer and natural, as replacement for code_numeral;
haftmann [Fri, 15 Feb 2013 08:31:31 +0100] rev 51143
two target language numeral types: integer and natural, as replacement for code_numeral; former theory HOL/Library/Code_Numeral_Types replaces HOL/Code_Numeral; refined stack of theories implementing int and/or nat by target language numerals; reduced number of target language numeral types to exactly one
Fri, 15 Feb 2013 08:31:30 +0100 explicit code equation for integer_of_nat
haftmann [Fri, 15 Feb 2013 08:31:30 +0100] rev 51142
explicit code equation for integer_of_nat
Fri, 15 Feb 2013 11:31:59 +0100 extended stream library
traytel [Fri, 15 Feb 2013 11:31:59 +0100] rev 51141
extended stream library
Fri, 15 Feb 2013 09:59:46 +0100 merged
Andreas Lochbihler [Fri, 15 Feb 2013 09:59:46 +0100] rev 51140
merged
Fri, 15 Feb 2013 09:41:25 +0100 partially revert 0dac0158b8d4 as it too aggressively spreads card_UNIV type class whose dictionary constructions can slow down generated code;
Andreas Lochbihler [Fri, 15 Feb 2013 09:41:25 +0100] rev 51139
partially revert 0dac0158b8d4 as it too aggressively spreads card_UNIV type class whose dictionary constructions can slow down generated code; provide better error messages instead for card and subseteq
Fri, 15 Feb 2013 09:17:26 +0100 killed legacy alias
blanchet [Fri, 15 Feb 2013 09:17:26 +0100] rev 51138
killed legacy alias
Fri, 15 Feb 2013 09:17:20 +0100 updated news
blanchet [Fri, 15 Feb 2013 09:17:20 +0100] rev 51137
updated news
Fri, 15 Feb 2013 09:17:20 +0100 avoid crude/wrong theorem comparision
blanchet [Fri, 15 Feb 2013 09:17:20 +0100] rev 51136
avoid crude/wrong theorem comparision
Fri, 15 Feb 2013 09:17:20 +0100 tuned code
blanchet [Fri, 15 Feb 2013 09:17:20 +0100] rev 51135
tuned code
Fri, 15 Feb 2013 09:17:20 +0100 more MaSh tracing
blanchet [Fri, 15 Feb 2013 09:17:20 +0100] rev 51134
more MaSh tracing
Fri, 15 Feb 2013 09:17:20 +0100 tuning
blanchet [Fri, 15 Feb 2013 09:17:20 +0100] rev 51133
tuning
Thu, 14 Feb 2013 23:54:46 +0100 fixed metis_steps_total - was off by one
smolkas [Thu, 14 Feb 2013 23:54:46 +0100] rev 51132
fixed metis_steps_total - was off by one
Thu, 14 Feb 2013 22:49:22 +0100 preplay subblocks
smolkas [Thu, 14 Feb 2013 22:49:22 +0100] rev 51131
preplay subblocks
Thu, 14 Feb 2013 22:49:22 +0100 renamed sledgehammer_shrink to sledgehammer_compress
smolkas [Thu, 14 Feb 2013 22:49:22 +0100] rev 51130
renamed sledgehammer_shrink to sledgehammer_compress
Thu, 14 Feb 2013 22:49:22 +0100 dont skolemize conjecture
smolkas [Thu, 14 Feb 2013 22:49:22 +0100] rev 51129
dont skolemize conjecture
Thu, 14 Feb 2013 22:49:22 +0100 introduced subblock in isar_step datatype for conjecture herbrandization
smolkas [Thu, 14 Feb 2013 22:49:22 +0100] rev 51128
introduced subblock in isar_step datatype for conjecture herbrandization
Thu, 14 Feb 2013 21:31:25 +0100 write_pdf for JFreeChart;
wenzelm [Thu, 14 Feb 2013 21:31:25 +0100] rev 51127
write_pdf for JFreeChart;
Thu, 14 Feb 2013 15:27:10 +0100 reform of predicate compiler / quickcheck theories:
haftmann [Thu, 14 Feb 2013 15:27:10 +0100] rev 51126
reform of predicate compiler / quickcheck theories: implement yieldn operations uniformly on the ML level -- predicate compiler uses negative integers as parameter to yieldn, whereas code_numeral represents natural numbers! avoid odd New_ prefix by joining related theories; avoid overcompact name DSequence; separated predicate inside random monad into separate theory; consolidated name of theory Quickcheck
Thu, 14 Feb 2013 17:58:28 +0100 merged
Andreas Lochbihler [Thu, 14 Feb 2013 17:58:28 +0100] rev 51125
merged
Thu, 14 Feb 2013 17:58:13 +0100 instantiate finite_UNIV and card_UNIV for finfun type
Andreas Lochbihler [Thu, 14 Feb 2013 17:58:13 +0100] rev 51124
instantiate finite_UNIV and card_UNIV for finfun type
Thu, 14 Feb 2013 17:06:15 +0100 merged
wenzelm [Thu, 14 Feb 2013 17:06:15 +0100] rev 51123
merged
Thu, 14 Feb 2013 16:36:21 +0100 more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
wenzelm [Thu, 14 Feb 2013 16:36:21 +0100] rev 51122
more parallel proofs in 'nominal_datatype', although sequential dark matter remains;
Thu, 14 Feb 2013 16:35:32 +0100 tuned proof;
wenzelm [Thu, 14 Feb 2013 16:35:32 +0100] rev 51121
tuned proof;
Thu, 14 Feb 2013 16:25:13 +0100 obsolete;
wenzelm [Thu, 14 Feb 2013 16:25:13 +0100] rev 51120
obsolete;
Thu, 14 Feb 2013 16:17:36 +0100 tuned proofs;
wenzelm [Thu, 14 Feb 2013 16:17:36 +0100] rev 51119
tuned proofs;
Thu, 14 Feb 2013 15:34:33 +0100 tuned signature -- legacy packages might want to fork proofs as well;
wenzelm [Thu, 14 Feb 2013 15:34:33 +0100] rev 51118
tuned signature -- legacy packages might want to fork proofs as well;
Thu, 14 Feb 2013 16:01:59 +0100 merged
Andreas Lochbihler [Thu, 14 Feb 2013 16:01:59 +0100] rev 51117
merged
Thu, 14 Feb 2013 16:01:28 +0100 implement code generation for finite, card, op = and op <= for sets always via finite_UNIV and card_UNIV, as fragile rewrites based on sorts are hard to find and debug
Andreas Lochbihler [Thu, 14 Feb 2013 16:01:28 +0100] rev 51116
implement code generation for finite, card, op = and op <= for sets always via finite_UNIV and card_UNIV, as fragile rewrites based on sorts are hard to find and debug
Thu, 14 Feb 2013 14:14:55 +0100 consolidation of library theories on product orders
haftmann [Thu, 14 Feb 2013 14:14:55 +0100] rev 51115
consolidation of library theories on product orders
Thu, 14 Feb 2013 12:24:56 +0100 type lifting setup for code numeral types
haftmann [Thu, 14 Feb 2013 12:24:56 +0100] rev 51114
type lifting setup for code numeral types
Thu, 14 Feb 2013 12:24:56 +0100 factored out shared preprocessor setup into theory Code_Abstract_Nat, tuning descriptions
haftmann [Thu, 14 Feb 2013 12:24:56 +0100] rev 51113
factored out shared preprocessor setup into theory Code_Abstract_Nat, tuning descriptions
Thu, 14 Feb 2013 12:24:42 +0100 abandoned theory Plain
haftmann [Thu, 14 Feb 2013 12:24:42 +0100] rev 51112
abandoned theory Plain
Thu, 14 Feb 2013 13:16:47 +0100 tuned;
wenzelm [Thu, 14 Feb 2013 13:16:47 +0100] rev 51111
tuned;
Wed, 13 Feb 2013 21:53:02 +0100 clarified default according to etc/options;
wenzelm [Wed, 13 Feb 2013 21:53:02 +0100] rev 51110
clarified default according to etc/options;
Wed, 13 Feb 2013 19:52:58 +0100 Java assumes regular "re-parenting" window manager;
wenzelm [Wed, 13 Feb 2013 19:52:58 +0100] rev 51109
Java assumes regular "re-parenting" window manager;
Wed, 13 Feb 2013 17:41:27 +0100 merged
immler [Wed, 13 Feb 2013 17:41:27 +0100] rev 51108
merged
Wed, 13 Feb 2013 16:35:07 +0100 complete metric for formal power series
immler [Wed, 13 Feb 2013 16:35:07 +0100] rev 51107
complete metric for formal power series
Wed, 13 Feb 2013 16:35:07 +0100 eliminated union_closed_basis; cleanup Fin_Map
immler [Wed, 13 Feb 2013 16:35:07 +0100] rev 51106
eliminated union_closed_basis; cleanup Fin_Map
Wed, 13 Feb 2013 16:35:07 +0100 fine grained instantiations
immler [Wed, 13 Feb 2013 16:35:07 +0100] rev 51105
fine grained instantiations
Wed, 13 Feb 2013 16:35:07 +0100 use maximum norm for type finmap
immler [Wed, 13 Feb 2013 16:35:07 +0100] rev 51104
use maximum norm for type finmap
Wed, 13 Feb 2013 16:35:07 +0100 generalized
immler [Wed, 13 Feb 2013 16:35:07 +0100] rev 51103
generalized
Wed, 13 Feb 2013 16:35:07 +0100 generalized
immler [Wed, 13 Feb 2013 16:35:07 +0100] rev 51102
generalized
Wed, 13 Feb 2013 16:30:34 +0100 merged
wenzelm [Wed, 13 Feb 2013 16:30:34 +0100] rev 51101
merged
Wed, 13 Feb 2013 15:40:59 +0100 discontinued home-made sharing for proof terms -- leave memory management to the Poly/ML RTS;
wenzelm [Wed, 13 Feb 2013 15:40:59 +0100] rev 51100
discontinued home-made sharing for proof terms -- leave memory management to the Poly/ML RTS;
Wed, 13 Feb 2013 13:52:06 +0100 more thorough error handling of load/save (see also c1be3072ea8f);
wenzelm [Wed, 13 Feb 2013 13:52:06 +0100] rev 51099
more thorough error handling of load/save (see also c1be3072ea8f);
Wed, 13 Feb 2013 13:31:38 +0100 file system operations for Graphics2D output;
wenzelm [Wed, 13 Feb 2013 13:31:38 +0100] rev 51098
file system operations for Graphics2D output;
Wed, 13 Feb 2013 12:42:59 +0100 updated isabelle-release URLs;
wenzelm [Wed, 13 Feb 2013 12:42:59 +0100] rev 51097
updated isabelle-release URLs;
Wed, 13 Feb 2013 13:38:52 +0100 combinator List.those;
haftmann [Wed, 13 Feb 2013 13:38:52 +0100] rev 51096
combinator List.those; simprule for case distinction on Option.map expression
Wed, 13 Feb 2013 13:38:52 +0100 explicit conversion integer_of_nat already in Code_Numeral_Types;
haftmann [Wed, 13 Feb 2013 13:38:52 +0100] rev 51095
explicit conversion integer_of_nat already in Code_Numeral_Types; tuned code postprocessor setup: present arithmetic results as plain numerals without conversions
Wed, 13 Feb 2013 13:38:52 +0100 IArray ignorant of particular representation of nat
haftmann [Wed, 13 Feb 2013 13:38:52 +0100] rev 51094
IArray ignorant of particular representation of nat
Wed, 13 Feb 2013 13:38:52 +0100 tuned, particulary name
haftmann [Wed, 13 Feb 2013 13:38:52 +0100] rev 51093
tuned, particulary name
Wed, 13 Feb 2013 13:38:52 +0100 formal cleanup of sources
haftmann [Wed, 13 Feb 2013 13:38:52 +0100] rev 51092
formal cleanup of sources
Wed, 13 Feb 2013 13:38:52 +0100 another attempt for a uniform abort on code generation errors
haftmann [Wed, 13 Feb 2013 13:38:52 +0100] rev 51091
another attempt for a uniform abort on code generation errors
Wed, 13 Feb 2013 13:38:52 +0100 tuned spelling
haftmann [Wed, 13 Feb 2013 13:38:52 +0100] rev 51090
tuned spelling
Wed, 13 Feb 2013 12:06:21 +0100 removed obsolete RC tags;
wenzelm [Wed, 13 Feb 2013 12:06:21 +0100] rev 51089
removed obsolete RC tags;
Wed, 13 Feb 2013 11:46:48 +0100 merged;
wenzelm [Wed, 13 Feb 2013 11:46:48 +0100] rev 51088
merged;
Tue, 12 Feb 2013 17:39:45 +0100 detect more hosts;
wenzelm [Tue, 12 Feb 2013 17:39:45 +0100] rev 51087
detect more hosts;
Tue, 12 Feb 2013 14:27:14 +0100 Added tag Isabelle2013 for changeset d90218288d51
wenzelm [Tue, 12 Feb 2013 14:27:14 +0100] rev 51086
Added tag Isabelle2013 for changeset d90218288d51
Mon, 11 Feb 2013 14:39:04 +0100 make WWW_Find work again, now that its ML modules reside within a theory context (cf. bf5b45870110) -- patch by Rafal Kolanski; Isabelle2013
wenzelm [Mon, 11 Feb 2013 14:39:04 +0100] rev 51085
make WWW_Find work again, now that its ML modules reside within a theory context (cf. bf5b45870110) -- patch by Rafal Kolanski;
Sun, 10 Feb 2013 22:07:56 +0100 merged
wenzelm [Sun, 10 Feb 2013 22:07:56 +0100] rev 51084
merged
Sun, 10 Feb 2013 22:03:21 +0100 avoid crash (NPE) when properties are changed during prover startup (e.g. by font scaling);
wenzelm [Sun, 10 Feb 2013 22:03:21 +0100] rev 51083
avoid crash (NPE) when properties are changed during prover startup (e.g. by font scaling);
(0) -30000 -10000 -3000 -1000 -120 +120 +1000 +3000 +10000 +30000 tip