isabelle: Graph

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 tip

tuned whitespace;
2013-12-30, by wenzelm
simplified
2013-12-29, by haftmann
more compact representation of different situations for interpretation
2013-12-29, by haftmann
more succint formulation of special case
2013-12-29, by haftmann
tuned whitespace
2013-12-29, by haftmann
move instantiation here from AFP/Native_Word
2013-12-28, by haftmann
dropped junk
2013-12-28, by haftmann
postpone dis"useful" lemmas
2013-12-28, by haftmann
cleanup
2013-12-28, by haftmann
prefix disambiguation
2013-12-28, by haftmann
tuned proofs and declarations
2013-12-27, by haftmann
prefer target-style syntaxx for sublocale
2013-12-27, by haftmann
prefer ephemeral interpretation over interpretation in proof contexts;
2013-12-26, by haftmann
self-contained formulation of subclass command, avoiding hard-wired Named_Target.init
2013-12-25, by haftmann
ephemeral interpretation also formally works on theory level
2013-12-25, by haftmann
abolished slightly odd global lattice interpretation for min/max
2013-12-25, by haftmann
prefer more canonical names for lemmas on min/max
2013-12-25, by haftmann
explicit distributivity facts on min/max
2013-12-25, by haftmann
postponed min/max lemmas until abstract lattice is available
2013-12-25, by haftmann
tuned structure of min/max lemmas
2013-12-25, by haftmann
prefer abstract simp rule
2013-12-25, by haftmann
more lemmas on abstract lattices
2013-12-25, by haftmann
tuning and augmentation of min/max lemmas;
2013-12-24, by haftmann
more general induction rule;
2013-12-24, by haftmann
convenient printing of polynomial values
2013-12-23, by haftmann
prefer "Bits" as theory name for abstract bit operations, similar to "Orderings", "Lattices", "Groups" etc.
2013-12-23, by haftmann
prefer Y_of_X over X_to_Y;
2013-12-23, by haftmann
merge
2013-12-23, by panny
prevent ambiguity when mutual recursion maps a datatype to itself, which yielded wrong definitions in some cases (e.g. nat)
2013-12-23, by panny
NEWS
2013-12-23, by haftmann
dropped redundant lemma
2013-12-23, by haftmann
syntactically tuned
2013-12-23, by haftmann
prefer plain bool over dedicated type for binary digits
2013-12-23, by haftmann
tuned
2013-12-23, by nipkow
compile + reduce problem size by a notch
2013-12-21, by blanchet
generate exhaust from nchotomy
2013-12-21, by blanchet
made tactic work with theorems with multiple assumptions
2013-12-21, by blanchet
renamed 'exhaust' to 'nchotomy' since it's expressed in the object logic (cf. datatype package)
2013-12-21, by blanchet
express weak pullback property of bnfs only in terms of the relator
2013-12-18, by traytel
merged
2013-12-20, by nipkow
tuned
2013-12-20, by nipkow
reconstruct SPASS-Pirate steps of the form 'x ~= C x' (or more complicated)
2013-12-20, by blanchet
tuning whitespace
2013-12-20, by blanchet
recognize datatype reasoning in SPASS-Pirate
2013-12-20, by blanchet
note manually proved exclusiveness property
2013-12-20, by blanchet
note exhaust proof obligation
2013-12-20, by blanchet
compile
2013-12-20, by blanchet
implemented 'exhaustive' option in tactic
2013-12-19, by blanchet
tuning
2013-12-19, by blanchet
tuning
2013-12-19, by blanchet
tuning 'case' expressions
2013-12-19, by blanchet
don't do 'isar_try0' if preplaying is off
2013-12-19, by blanchet
more data structure refactoring
2013-12-19, by blanchet
data structure rationalization
2013-12-19, by blanchet
tuning
2013-12-19, by blanchet
refactored preplaying outcome data structure
2013-12-19, by blanchet
distinguish not preplayed & timed out
2013-12-19, by blanchet
pick up tfree/tvar type from SPASS-Pirate proof
2013-12-19, by blanchet
tuning
2013-12-19, by blanchet
extended ATP types with sorts
2013-12-19, by blanchet

less more | (0) -30000 -10000 -3000 -1000 -300 -100 -60 +60 +100 +300 +1000 +3000 +10000 tip

isabelle