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
+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.
explicitly revoke delay, to avoid spurious timer events after deactivation of related components;
2012-03-01, by wenzelm
clarified document nodes (full import graph) vs. node_status (non-preloaded theories);
2012-03-01, by wenzelm
more defensive node_header;
2012-02-29, by wenzelm
clarified module Thy_Load;
2012-02-29, by wenzelm
SMT fails if the chosen SMT solver is not installed
2012-02-29, by boehmes
merged
2012-02-28, by wenzelm
speed up Sledgehammer's clasimpset lookup a bit
2012-02-28, by blanchet
use SPASS instead of E for Metis examples -- it's seems faster for these small problems
2012-02-28, by blanchet
spelling
2012-02-28, by blanchet
avoid undeclared variables in let bindings;
2012-02-28, by wenzelm
tuned proofs;
2012-02-28, by wenzelm
more release tests;
2012-02-28, by wenzelm
display proof results as "state", to suppress odd squiggles in the Prover IDE (see also 9240be8c8c69);
2012-02-28, by wenzelm
Finish localizing the quotient package.
2012-02-28, by Cezary Kaliszyk
merged
2012-02-28, by berghofe
Added infrastructure for mapping SPARK field / constructor names
2012-02-28, by berghofe
Use long prefix rather than short package name to disambiguate constant names
2012-02-27, by berghofe
more explicit development graph;
2012-02-27, by wenzelm
removed dead code (cf. a34d89ce6097);
2012-02-27, by wenzelm
tuned proofs;
2012-02-27, by wenzelm
tuned proofs;
2012-02-27, by wenzelm
removed introiff (cf. b09afce1e54f);
2012-02-27, by wenzelm
tuned;
2012-02-27, by wenzelm
removed broken/unused introiff (cf. d452117ba564);
2012-02-27, by wenzelm
discontinued slightly odd built-in timing (cf. 53fd5cc685b4) -- the Isar toplevel does that already (e.g. via Toplevel.timing or Toplevel.profiling);
2012-02-27, by wenzelm
tuned;
2012-02-27, by wenzelm
tuned proofs;
2012-02-27, by wenzelm
prefer uniform Timing.message -- avoid assumption about sequential execution;
2012-02-27, by wenzelm
prefer final ADTs -- prevent ooddities;
2012-02-27, by wenzelm
more explicit Long_Name operations (NB: analyzing qualifiers is inherently fragile);
2012-02-27, by wenzelm
more standard settings -- refer to COMPONENT at most once;
2012-02-27, by wenzelm
clarified prems_lin_arith_tac, with subtle change of semantics: structured prems are inserted as well;
2012-02-27, by wenzelm
prefer cut_tac, where it is clear that the special variants cut_rules_tac or cut_facts_tac are not required;
2012-02-27, by wenzelm
eliminated odd comment from distant past;
2012-02-27, by wenzelm
updated cut_tac, without loose references to implementation manual;
2012-02-27, by wenzelm
updated generated file;
2012-02-27, by wenzelm
simplified cut_tac (cf. d549b5b0f344);
2012-02-27, by wenzelm
merged
2012-02-27, by huffman
avoid using constant Int.neg
2012-02-27, by huffman
reactivated Find_Unused_Assms_Examples to avoid untested / dead stuff in the repository;
2012-02-27, by wenzelm
merged
2012-02-27, by nipkow
added lemma
2012-02-27, by nipkow
converting "set [...]" to "{...}" in evaluation results
2012-02-27, by nipkow
removing Find_Unused_Assms_Examples from session as it requires much time
2012-02-27, by bulwahn
restored accidental omission
2012-02-26, by haftmann
dropped dead code
2012-02-26, by haftmann
tuned structure
2012-02-26, by haftmann
retain syntax here
2012-02-26, by haftmann
tuned structure; dropped already existing syntax declarations
2012-02-26, by haftmann
tuned syntax declarations; tuned structure
2012-02-26, by haftmann
merged
2012-02-26, by wenzelm
marked candidates for rule declarations
2012-02-26, by haftmann
include warning messages in node status;
2012-02-26, by wenzelm
tuned signature (in accordance with ML);
2012-02-26, by wenzelm
more PIDE modules;
2012-02-26, by wenzelm
tuned proofs;
2012-02-26, by wenzelm
more abstract class Document.State;
2012-02-26, by wenzelm
more abstract class Document.State.Assignment;
2012-02-26, by wenzelm
tuned signature;
2012-02-26, by wenzelm
more abstract class Document.Version;
2012-02-26, by wenzelm
more abstract class Document.Node;
2012-02-26, by wenzelm
more abstract class Document.History;
2012-02-26, by wenzelm
more abstract class Document.Change;
2012-02-26, by wenzelm
tuned;
2012-02-26, by wenzelm
tuned signature;
2012-02-26, by wenzelm
merged
2012-02-25, by wenzelm
slightly changing the enumeration scheme
2012-02-25, by bulwahn
adding some more test invocations of find_unused_assms
2012-02-25, by bulwahn
adding an example where random beats exhaustive testing
2012-02-25, by bulwahn
removing unnecessary assumptions in RComplete;
2012-02-25, by bulwahn
removing unnecessary assumptions in RealDef;
2012-02-25, by bulwahn
one general list_all2_update_cong instead of two special ones
2012-02-25, by bulwahn
tuned comments;
2012-02-25, by wenzelm
standard Graph instances;
2012-02-25, by wenzelm
clarified signature -- avoid oddities of Iterable like Iterator.map;
2012-02-25, by wenzelm
discontinued slightly odd Graph.del_nodes (inefficient due to full Table.map);
2012-02-25, by wenzelm
moved predicate relations and conversion rules between set and predicate relations from Predicate.thy to Relation.thy; moved Predicate.thy upwards in theory hierarchy
2012-02-24, by haftmann
explicit is better than implicit
2012-02-24, by haftmann
dropped dead code
2012-02-24, by haftmann
prefer sorted Map/Set for canonical order of results -- pass ordering via fresh copy of empty;
2012-02-24, by wenzelm
tuned imports;
2012-02-24, by wenzelm
tuned signature;
2012-02-24, by wenzelm
discontinued obsolete Graph.all_paths (last seen in 1524d69783d3 and AFP/80bbbdbfec62);
2012-02-24, by wenzelm
merged
2012-02-24, by wenzelm
remove ill-formed lemmas word_0_wi_Pls and word_m1_wi_Min
2012-02-24, by huffman
avoid using Int.succ_def in proofs
2012-02-24, by huffman
avoid using Int.succ or Int.pred in proofs
2012-02-24, by huffman
avoid using BIT_simps in proofs;
2012-02-24, by huffman
avoid using BIT_simps in proofs
2012-02-24, by huffman
updated stats according to src/HOL/IsaMakefile;
2012-02-24, by wenzelm
more precise clean target;
2012-02-24, by wenzelm
clarifed name space "type name", which covers logical and non-logical types, and often occurs inside outer syntax "type" markup;
2012-02-24, by wenzelm
avoid using Int.Pls_def in proofs
2012-02-24, by huffman
remove ill-formed lemmas word_pred_0_Min and word_m1_Min
2012-02-24, by huffman
remove ill-formed lemma of_bl_no; adapt proofs
2012-02-24, by huffman
adapt lemma mask_lem to respect int/bin distinction
2012-02-24, by huffman
rephrase some slow "metis" calls
2012-02-24, by blanchet
added support for Alt-Ergo through Why3 (mostly for experimental purposes, e.g. polymorphism vs. monomorphization)
2012-02-24, by blanchet
general solution to the arity bug that occasionally plagues Sledgehammer -- short story, lots of things go kaputt when a polymorphic symbol's arity in the translation is higher than the arity of the fully polymorphic HOL constant
2012-02-24, by blanchet
renamed 'try_methods' to 'try0'
2012-02-24, by blanchet
doc fixes (thanks to Nik)
2012-02-24, by blanchet
fixed arity bug with "If" helpers for "If" that returns a function
2012-02-24, by blanchet
given up disfruitful branch
2012-02-24, by haftmann
explicit remove of lattice notation
2012-02-24, by haftmann
moved predicate relations and conversion rules between set and predicate relations from Predicate.thy to Relation.thy; moved Predicate.thy upwards in theory hierarchy
2012-02-24, by haftmann
moved predicate relations and conversion rules between set and predicate relations from Predicate.thy to Relation.thy; moved Predicate.thy upwards in theory hierarchy
2012-02-23, by haftmann
dropped dead code
2012-02-23, by haftmann
tuned isatest settings;
2012-02-23, by wenzelm
merged
2012-02-23, by wenzelm
moved lemmas for orderings and lattices on predicates to corresponding theories, retaining declaration order of classical rules; tuned headings; tuned syntax
2012-02-23, by haftmann
tuned whitespace
2012-02-23, by haftmann
tuned proof
2012-02-23, by haftmann
prefer actual syntax categories;
2012-02-23, by wenzelm
avoid trait Addable, which is deprecated in scala-2.9.x;
2012-02-23, by wenzelm
streamlined abstract datatype;
2012-02-23, by wenzelm
tuned;
2012-02-23, by wenzelm
streamlined abstract datatype;
2012-02-23, by wenzelm
tuned -- avoid copy of empty value;
2012-02-23, by wenzelm
tuned;
2012-02-23, by wenzelm
streamlined abstract datatype, eliminating odd representation class;
2012-02-23, by wenzelm
less
more
|
(0)
-30000
-10000
-3000
-1000
-120
+120
+1000
+3000
+10000
+30000
tip