Mercurial
Mercurial
>
repos
>
isabelle
/ graph
summary
|
shortlog
|
changelog
| graph |
tags
|
bookmarks
|
branches
|
files
|
gz
|
help
less
more
|
(0)
-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 JavaScript-enabled browsers.
converted to new-style theories, and combined numbered files
2005-03-04, by huffman
document generation for HOLCF
2005-03-04, by huffman
Removed practically all references to Library.foldr.
2005-03-04, by skalberg
new first_order test
2005-03-04, by paulson
removed dead code
2005-03-04, by paulson
interpreter for Finite_Set.Finites added
2005-03-03, by webertj
Move towards standard functions.
2005-03-03, by skalberg
fixed proof
2005-03-03, by nipkow
converted to new-style theory
2005-03-03, by huffman
converted to new-style theory
2005-03-03, by huffman
converted to new-style theory
2005-03-02, by huffman
converted to new-style theory
2005-03-02, by huffman
converted to new-style theory
2005-03-02, by huffman
converted to new-style theory
2005-03-02, by huffman
converted to new-style theory
2005-03-02, by huffman
another reorganization of setsums and intervals
2005-03-02, by nipkow
lucas - fixed bug with name capture variables bound outside redex could (previously)conflict with scheme variables that occur in the conditions of an equation, and which were renamed to avoid conflict with another instantiation. This has now been fixed.
2005-03-02, by dixon
obscured the e-mail address lcp@cl
2005-03-02, by paulson
new lemmas int_diff_cases
2005-03-02, by paulson
eliminated deps for removed files
2005-03-02, by huffman
merged into Discrete.thy
2005-03-02, by huffman
converted to new-style theory
2005-03-02, by huffman
integrated Jeremy's FiniteLib
2005-03-01, by nipkow
spider dogding
2005-03-01, by kleing
added setsum_diff1' which holds in more general cases than setsum_diff1
2005-02-28, by obua
unfold theorems for trancl and rtrancl
2005-02-28, by paulson
lucas - added more comments and an extra type to clarify the code.
2005-02-27, by dixon
Modified node_trans to avoid duplication of signature stamps
2005-02-23, by berghofe
exception SAME removed
2005-02-23, by webertj
major code change: refute can now handle recursion and axiomatic type classes; 3-valued logic with two kinds of equality; some bugfixes
2005-02-23, by webertj
suminf -> \<Sum>
2005-02-23, by nipkow
Lucas - fixed bug in zero_var_indexes: it was ignoring vars in the flex-flex pairs. These are now taken into account.
2005-02-22, by dixon
removed redundant lemmas and simprules
2005-02-22, by paulson
more setsum tuning
2005-02-22, by nipkow
more fine tuniung
2005-02-21, by nipkow
fixed proof
2005-02-21, by nipkow
removed superfluous setsum_constant
2005-02-21, by nipkow
comprehensive cleanup, replacing sumr by setsum
2005-02-21, by nipkow
lucas - re-arranged code and added comments. Also added check to make sure the subgoal that we are being applied to exists. If it does not, empty seq is returned.
2005-02-19, by dixon
continued eliminating sumr
2005-02-18, by nipkow
starting to get rid of sumr
2005-02-18, by nipkow
tuning
2005-02-18, by nipkow
*** empty log message ***
2005-02-16, by nipkow
refine now provides specific cases "goal1" ... "goaln" for addressing
2005-02-15, by berghofe
simplified a proof
2005-02-14, by paulson
Deleted Library.option type.
2005-02-13, by skalberg
Fully qualified refl and trans to avoid confusion with theorems
2005-02-11, by berghofe
Optimized present_tokens to produce fewer newlines when hiding proofs.
2005-02-11, by berghofe
New reference Toplevel.debug for verbose printing of exns.
2005-02-11, by ballarin
update from Larry
2005-02-11, by kleing
some stuff is now redundant.
2005-02-10, by nipkow
HOL.order -> Orderings.order due to restructering
2005-02-10, by nipkow
Moved oderings from HOL into the new Orderings.thy
2005-02-10, by nipkow
Added paper by M. Takahashi.
2005-02-10, by berghofe
Added proof of eta-postponement theorem (using parallel eta-reduction).
2005-02-10, by berghofe
non-inductive fold1Set proofs
2005-02-10, by paulson
simplified a key lemma for foldSet
2005-02-10, by paulson
Toplevel.debug for debugging in Isar.
2005-02-10, by ballarin
Fixed bug in select_thm.
2005-02-10, by berghofe
Subscripts for theorem lists now start at 1.
2005-02-10, by berghofe
less
more
|
(0)
-10000
-3000
-1000
-300
-100
-60
+60
+100
+300
+1000
+3000
+10000
+30000
tip