blanchet [Mon, 04 Oct 2010 14:36:18 +0200] rev 39933
instantiate foralls and release exists in the order described by the topological order
blanchet [Mon, 04 Oct 2010 14:34:15 +0200] rev 39932
reverted 0bfaaa81fc62, since "Thm.rename_boundvars" can't be relied upon to give unique names to bound variables
blanchet [Mon, 04 Oct 2010 09:08:46 +0200] rev 39931
renamed internal function
blanchet [Mon, 04 Oct 2010 09:05:15 +0200] rev 39930
hack in MESON to make it less likely that variables (e.g. "x") get renamed (e.g. "xa") when resolving
haftmann [Wed, 06 Oct 2010 13:48:12 +0200] rev 39929
tuned header
krauss [Tue, 05 Oct 2010 18:09:31 +0200] rev 39928
tuned
krauss [Tue, 05 Oct 2010 18:09:29 +0200] rev 39927
force less agressively
krauss [Tue, 05 Oct 2010 16:33:16 +0200] rev 39926
lexicographic_order: replace parallel map with laziness to avoid wasting cycles on proofs that are not needed
krauss [Tue, 05 Oct 2010 14:19:43 +0200] rev 39925
removed complicated (and rarely helpful) error reporting
krauss [Tue, 05 Oct 2010 14:19:40 +0200] rev 39924
discontinued continuations to simplify control flow; dropped optimization in scnp
krauss [Tue, 05 Oct 2010 14:19:38 +0200] rev 39923
use Cache structure instead of passing tables around explicitly
haftmann [Tue, 05 Oct 2010 11:45:16 +0200] rev 39922
merged
haftmann [Tue, 05 Oct 2010 11:37:42 +0200] rev 39921
lemmas fold_commute and fold_commute_apply
krauss [Fri, 07 May 2010 15:36:03 +0200] rev 39920
spelling
haftmann [Mon, 04 Oct 2010 14:46:49 +0200] rev 39919
adjusted to inductive characterization of sorted
haftmann [Mon, 04 Oct 2010 14:46:49 +0200] rev 39918
tuned whitespace
haftmann [Mon, 04 Oct 2010 14:46:48 +0200] rev 39917
turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
haftmann [Mon, 04 Oct 2010 14:46:48 +0200] rev 39916
turned distinct and sorted into inductive predicates: yields nice induction principles for free
haftmann [Mon, 04 Oct 2010 12:22:58 +0200] rev 39915
turned distinct and sorted into inductive predicates: yields nice induction principles for free; more elegant proofs
blanchet [Sat, 02 Oct 2010 12:32:31 +0200] rev 39914
some Poly/ML-specific debugging code escaped in the wild -- comment it out
haftmann [Fri, 01 Oct 2010 22:44:36 +0200] rev 39913
merged
haftmann [Fri, 01 Oct 2010 17:06:49 +0200] rev 39912
avoid antiquotation processing for code_reflect; moved ML_Context.value to Code_Runtime
haftmann [Fri, 01 Oct 2010 17:06:49 +0200] rev 39911
moved ML_Context.value to Code_Runtime
haftmann [Fri, 01 Oct 2010 16:05:25 +0200] rev 39910
constant `contents` renamed to `the_elem`
blanchet [Fri, 01 Oct 2010 18:49:09 +0200] rev 39909
merged
blanchet [Fri, 01 Oct 2010 18:48:37 +0200] rev 39908
tune whitespace
blanchet [Fri, 01 Oct 2010 17:56:32 +0200] rev 39907
rename bound variables after skolemizing, if the axiom of choice is available
blanchet [Fri, 01 Oct 2010 17:52:20 +0200] rev 39906
tuning
blanchet [Fri, 01 Oct 2010 17:41:59 +0200] rev 39905
rename quantified variables earlier in the new skolemizer, to ensure consistent naming later (in the absence of the choice axiom)
blanchet [Fri, 01 Oct 2010 16:58:56 +0200] rev 39904
tune bound names