Mercurial
Mercurial
>
repos
>
isabelle
/ graph
summary

shortlog

changelog
 graph 
tags

bookmarks

branches

files

gz

help
less
more

(0)
30000
10000
3000
1000
300
100
60
+60
+100
+300
+1000
+3000
+10000
+30000
tip
Find changesets by keywords (author, files, the commit message), revision number or hash, or
revset expression
.
The revision graph only works with JavaScriptenabled browsers.
lemma restrict_complement_singleton_eq
20100306, by haftmann
some lemma refinements
20100306, by haftmann
added Table.thy
20100306, by haftmann
provide ProofContext.def_type depending on "pattern" mode;
20100306, by wenzelm
record_type_tr': more robust strip_fields (printed types are not necessarily wellformed, e.g. in Syntax.pretty_arity);
20100306, by wenzelm
record_type_abbr_tr': removed obsolete workaround for decode_type, which now retains syntactic categories of variables vs. constructors (authentic syntax);
20100306, by wenzelm
eliminated Args.bang_facts (legacy feature);
20100306, by wenzelm
eliminated oldstyle prems;
20100306, by wenzelm
removed unused term_lift_inst_rule (superceded by Subgoal.FOCUS etc.);
20100306, by wenzelm
Some notes on platform support of Isabelle.
20100306, by wenzelm
"private" map_of_map lemma
20100306, by haftmann
added insort_insert
20100306, by haftmann
added dom_option_map, map_of_map_keys
20100306, by haftmann
added bulkload; tuned document
20100306, by haftmann
merged
20100306, by haftmann
merged
20100305, by haftmann
moved lemma map_sorted_distinct_set_unique
20100305, by haftmann
various refinements
20100305, by haftmann
print message when finiteness of domain definition is detected
20100305, by huffman
merged
20100305, by huffman
skip coinduction proofs for indirectrecursive domain definitions
20100305, by huffman
merged
20100306, by wenzelm
introduce notion of 'decisive' deflations; use them to simplify proof script for rule 'finites'
20100305, by huffman
add comment
20100305, by huffman
move take_proofsrelated stuff to a new section
20100305, by huffman
remove dead code
20100305, by huffman
tuned dead code;
20100305, by wenzelm
use regular Proof.goal (which is what methods usually see) and prevent sledgehammer from crashing;
20100305, by wenzelm
merged
20100305, by wenzelm
fix proof script so 'domain foo = Foo foo' works
20100305, by huffman
fix proof script so qdomain_isomorphism foo = foo' works
20100305, by huffman
finish browser_info: invoke isabelle browser b to ensure that the jar really exists;
20100305, by wenzelm
isabelle browser b: Admin/build only;
20100305, by wenzelm
merged
20100305, by huffman
skip proof of induction rule for indirectrecursive domain definitions
20100305, by huffman
generalized inj_uminus; added strict_mono_imp_inj_on
20100305, by hoelzl
merged
20100305, by hoelzl
Add Lebesgue integral and probability space.
20100304, by hoelzl
Supremum and Infimum on real intervals
20100304, by hoelzl
Rewrite rules for images of minus of intervals
20100304, by hoelzl
Add dense_le, dense_le_bounded, field_le_mult_one_interval.
20100304, by hoelzl
Added natfloor and floor rules for multiplication and power.
20100304, by hoelzl
Generalized setsum_cases
20100304, by hoelzl
Added vimage_inter_cong
20100304, by hoelzl
merged
20100304, by huffman
move coinductionrelated stuff into function prove_coindunction
20100304, by huffman
add function add_qualified_simp_thm
20100304, by huffman
generate lemma take_below, declare chain_take [simp]
20100303, by huffman
switch to polymlsvn;
20100304, by wenzelm
basic simplification of external_prover signature;
20100304, by wenzelm
tuned;
20100304, by wenzelm
renamed type_has_empty_sort to type_has_topsort  {} is the full universal sort;
20100304, by wenzelm
point to http://hginit.com/
20100304, by wenzelm
Simplified a couple of proofs and corrected a comment
20100304, by paulson
lemmas set_map_of_compr, map_of_inject_set
20100304, by haftmann
merged
20100303, by huffman
merged
20100303, by huffman
remove dead code
20100303, by huffman
add infix declarations
20100303, by huffman
remove unnecessary theorem references
20100303, by huffman
less
more

(0)
30000
10000
3000
1000
300
100
60
+60
+100
+300
+1000
+3000
+10000
+30000
tip