Mercurial
Mercurial
>
repos
>
isabelle
/ graph
summary
|
shortlog
|
changelog
| graph |
tags
|
bookmarks
|
branches
|
files
|
gz
|
help
less
more
|
(0)
-30000
-10000
-3000
-1000
-120
+120
+1000
+3000
+10000
tip
Find changesets by keywords (author, files, the commit message), revision number or hash, or
revset expression
.
The revision graph only works with JavaScript-enabled browsers.
got rid of dynamic scoping the easy way
2014-02-12, by blanchet
removed trivial 'rec' examples for nonrecursive types (I could also have added the 'old.' prefix in front of the constant names)
2014-02-12, by blanchet
more liberal merging of BNFs and constructor sugar
2014-02-12, by blanchet
se 'wrap_free_constructors' to register 'sum' , 'prod', 'unit', 'bool' with their discriminators/selectors
2014-02-12, by blanchet
have the same no-update semantics for 'case' as for 'Ctr_Sugar' and BNF data (this might not be the final word on the matter, but using a consistent policy seems like a good idea)
2014-02-12, by blanchet
Mac OS X Lion (macbroy6) is baseline for portable executables;
2014-02-11, by wenzelm
"no_memory" option for the simplifier trace to bypass memoization
2014-02-11, by Lars Hupel
tuned
2014-02-11, by nipkow
merged
2014-02-10, by wenzelm
seal system channels at end of Pure bootstrap -- Isabelle/Scala provides official interfaces;
2014-02-10, by wenzelm
make triple-sure that the future scheduler is properly shutdown (see also 702278df3b57);
2014-02-10, by wenzelm
discontinued axiomatic 'classes', 'classrel', 'arities';
2014-02-10, by wenzelm
updated keywords;
2014-02-10, by wenzelm
more explicit axiomatization;
2014-02-10, by wenzelm
prefer vacuous definitional type classes over axiomatic ones;
2014-02-10, by wenzelm
more explicit axiomatization;
2014-02-10, by wenzelm
prefer vacuous definitional type classes over axiomatic ones;
2014-02-10, by wenzelm
comments;
2014-02-10, by wenzelm
removed rotten code;
2014-02-10, by wenzelm
more elementary put_simpset: exchange the simplifier configuration outright, which is particularly relevant concerning cumulative depth, e.g. for Product_Type.split_beta in the subsequent example:
2014-02-10, by wenzelm
merged
2014-02-10, by nipkow
improved lin.arith. for terms involving division
2014-02-10, by nipkow
restoring ancient string_classes option
2014-02-09, by haftmann
method names in instance declarations are always unqualified
2014-02-09, by haftmann
dropped legacy finally
2014-02-09, by haftmann
tidied messy proofs
2014-02-09, by paulson
minimal document;
2014-02-09, by wenzelm
removed junk;
2014-02-09, by wenzelm
merged
2014-02-09, by wenzelm
check scalable fonts;
2014-02-09, by wenzelm
do *not* enforce scalable fonts for T1 encoding, instead rely on cm-super fonts, which also provide underscore for non-tt font;
2014-02-09, by wenzelm
yet another attempt at actual underscore;
2014-02-09, by wenzelm
build up preprocessing context only once
2014-02-09, by haftmann
tuned
2014-02-09, by haftmann
disabled counterexample output for now; confusing because often incorrect
2014-02-09, by nipkow
more indexing
2014-02-08, by nipkow
merged
2014-02-07, by nipkow
indexed document
2014-02-07, by nipkow
Simplified some proofs, deleting a lot of strange unused material at the end of the theory.
2014-02-07, by paulson
fight spurious nitpick timeouts
2014-02-07, by nipkow
reverted a87e49f4336d -- overwriting of data entries yields to merge problems later
2014-02-07, by blanchet
more docs
2014-02-07, by blanchet
more docs
2014-02-07, by blanchet
docs
2014-02-07, by blanchet
tidied
2014-02-06, by paulson
docs
2014-02-06, by blanchet
docs about registering a BNF
2014-02-06, by blanchet
merged
2014-02-06, by nipkow
indexed document
2014-02-06, by nipkow
allow multiple registration of the same type, the last wins
2014-02-06, by blanchet
fixed problem (?) by deleting "thm" line
2014-02-06, by paulson
try right bunch of methods
2014-02-06, by blanchet
don't waste time with old-style 'case's that don't have the required theorems
2014-02-06, by blanchet
expand 'split' in direct corecursion as well
2014-02-06, by blanchet
tuning
2014-02-06, by blanchet
adapted tactic to correctly handle 'if ... then ...' and 'case ...' under lambdas
2014-02-05, by blanchet
merge
2014-02-05, by blanchet
properly massage 'if's / 'case's etc. under lambdas
2014-02-05, by blanchet
Merge
2014-02-05, by paulson
Number_Theory no longer introduces One_nat_def as a simprule. Tidied some proofs.
2014-02-05, by paulson
fixed handling of 'split'
2014-02-05, by blanchet
made SML/NJ happy
2014-02-05, by Lars Hupel
agsyHOL is also called AgsyHOL by Lindblad himself, so let's follow this convention
2014-02-05, by blanchet
more exception cleanup + more liberal compressions of steps that timed out
2014-02-05, by blanchet
tuned code to avoid noncanonical (and risky) exception handling
2014-02-05, by blanchet
got rid of indices
2014-02-05, by blanchet
corrected wrong 'meth :: _' pattern maching + tuned code
2014-02-05, by blanchet
more generous Isar proof compression -- try to remove failing steps
2014-02-04, by blanchet
tweaked handling of 'hopeless' methods
2014-02-04, by blanchet
do a second phase of proof compression after minimization
2014-02-04, by blanchet
don't give up on hopeless proof methods -- they can become hopeful again
2014-02-04, by blanchet
tuned code
2014-02-04, by blanchet
tuned slack
2014-02-04, by blanchet
split 'linarith' and 'presburger' (to avoid annoying warnings + to speed up reconstruction when 'presburger' is needed)
2014-02-04, by blanchet
removal of "back", etc.
2014-02-04, by paulson
Restoration of Pocklington.thy. Tidying.
2014-02-04, by paulson
tuned latex
2014-02-04, by nipkow
tuned latex
2014-02-04, by nipkow
tuned
2014-02-04, by nipkow
started index
2014-02-04, by nipkow
interactive simplifier trace: new panel in Isabelle/jEdit to inspect and modify simplification state
2014-02-04, by Lars Hupel
removed legacy 'metisFT' method
2014-02-04, by blanchet
tuning
2014-02-04, by blanchet
tuning
2014-02-04, by blanchet
more liberal step merging
2014-02-04, by blanchet
rationalized lists of methods
2014-02-03, by blanchet
extended method list
2014-02-03, by blanchet
don't lose additional outcomes
2014-02-03, by blanchet
properly overwrite replay data from one compression iteration to another
2014-02-03, by blanchet
tuning
2014-02-03, by blanchet
merged;
2014-02-03, by wenzelm
unused;
2014-02-03, by wenzelm
more formal markup;
2014-02-03, by wenzelm
clarified error messages: Pretty.str is for atomic/unformatted strings only, accumulate buffer of formatted strings instead;
2014-02-03, by wenzelm
just error, not a failed attempt to raise an exception;
2014-02-03, by wenzelm
tuned whitespace;
2014-02-03, by wenzelm
tuned;
2014-02-03, by wenzelm
generate comments in Isar proofs
2014-02-03, by blanchet
allow merging of steps with subproofs
2014-02-03, by blanchet
renamed 'smt' option 'smt_proofs' to avoid clash with 'smt' prover
2014-02-03, by blanchet
tuned behavior of 'smt' option
2014-02-03, by blanchet
keep all proof methods in data structure until the end, to enhance debugging output
2014-02-03, by blanchet
proper fresh name generation
2014-02-03, by blanchet
code generation: explicitly declared identifiers gain predence over implicit ones
2014-02-03, by haftmann
tuned
2014-02-03, by haftmann
tuned storage of code identifiers
2014-02-03, by haftmann
searchable underscores
2014-02-03, by blanchet
added new option to documentation
2014-02-03, by blanchet
added 'smt' option to control generation of 'by smt' proofs
2014-02-03, by blanchet
renamed ML file
2014-02-03, by blanchet
tuning
2014-02-03, by blanchet
merged 'reconstructors' and 'proof methods'
2014-02-03, by blanchet
added 'smt' as a proof method
2014-02-03, by blanchet
when merging, don't try methods that failed or timed out for either of the steps for the combined step
2014-02-03, by blanchet
tuning
2014-02-03, by blanchet
refactor relabeling code
2014-02-03, by blanchet
tuned data structure
2014-02-03, by blanchet
tuned data structure
2014-02-03, by blanchet
more flexible compression, choosing whichever proof method works
2014-02-03, by blanchet
reduced preplaying timeout, since (1) Isar proofs are getting better and better as alternatives; (2) the same timeout is used for each step in an Isar proof, where a lower timeout makes more sense
2014-02-03, by blanchet
less
more
|
(0)
-30000
-10000
-3000
-1000
-120
+120
+1000
+3000
+10000
tip