Mercurial
Mercurial
>
repos
>
isabelle
/ graph
summary
|
shortlog
|
changelog
| graph |
tags
|
bookmarks
|
branches
|
files
|
gz
|
help
less
more
|
(0)
-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.
timestart - setup bash environment for timing;
2005-12-01, by wenzelm
Improved norm_proof to handle proofs containing term (type) variables
2005-12-01, by berghofe
restoring the old status of subset_refl
2005-12-01, by paulson
oriented pairs theory * 'a to 'a * theory
2005-12-01, by haftmann
initial cleanup to use the new induction method
2005-12-01, by urbanc
cleaned up further the proofs (diamond still needs work);
2005-12-01, by urbanc
changed "fresh:" to "avoiding:" and cleaned up the weakening example
2005-12-01, by urbanc
match_bind(_i): return terms;
2005-11-30, by wenzelm
method 'fact': SIMPLE_METHOD, i.e. insert facts;
2005-11-30, by wenzelm
simulaneous 'def';
2005-11-30, by wenzelm
added facilities to prove the pt and fs instances
2005-11-30, by urbanc
started to change the transitivity/narrowing case:
2005-11-30, by urbanc
changed everything until the interesting transitivity_narrowing
2005-11-30, by urbanc
minor improvements
2005-11-30, by haftmann
modified almost everything for the new nominal_induct
2005-11-30, by urbanc
Changed order of predicate arguments and quantifiers in strong induction rule.
2005-11-30, by berghofe
fixed the lemma where the new names generated by nominal_induct
2005-11-30, by urbanc
added one clause for substitution in the lambda-case and
2005-11-30, by urbanc
added rename_params_rule: recover orginal fresh names in subgoals/cases;
2005-11-30, by wenzelm
changed induction principle and everything to conform with the
2005-11-30, by urbanc
fresh: frees instead of terms, rename corresponding params in rule;
2005-11-30, by wenzelm
adapted to the new nominal_induction
2005-11-30, by urbanc
changed \<sim> of permutation equality to \<triangleq>
2005-11-30, by urbanc
fresh_unit_elim and fresh_prod_elim -- for nominal_induct;
2005-11-30, by wenzelm
reimplement Case expression pattern matching to support lazy patterns
2005-11-30, by huffman
add definitions as defs, not axioms
2005-11-30, by huffman
changed section names
2005-11-30, by huffman
add xsymbol syntax for u type constructor
2005-11-30, by huffman
add constant unit_when
2005-11-30, by huffman
proper treatment of tuple/tuple_fun -- nest to the left!
2005-11-30, by wenzelm
moved nth_list to Pure/library.ML;
2005-11-29, by wenzelm
added nth_list;
2005-11-29, by wenzelm
added mk_split;
2005-11-29, by wenzelm
changed the order of the induction variable and the context
2005-11-29, by urbanc
reworked version with proper support for defs, fixes, fresh specification;
2005-11-29, by wenzelm
added haskell serializer
2005-11-29, by haftmann
exported customized syntax interface
2005-11-29, by haftmann
Corrected atom class constraints in strong induction rule.
2005-11-29, by berghofe
made some of the theorem look-ups static (by using
2005-11-29, by urbanc
added (curried) fold2
2005-11-28, by haftmann
added proof of measure_induct_rule;
2005-11-28, by wenzelm
Added flags for setting and detecting whether a problem needs combinators.
2005-11-28, by mengj
Only output types if !keep_types is true.
2005-11-28, by mengj
Added two functions for CNF translation, used by other files.
2005-11-28, by mengj
Added in four control flags for HOL and FOL translations.
2005-11-28, by mengj
Slight modification to trace information.
2005-11-28, by mengj
Added two methods "vampire" and "eprover" that handle both HOL and FOL proofs.
2005-11-28, by mengj
Only output arities and class relations if !ResClause.keep_types is true.
2005-11-28, by mengj
some small tuning
2005-11-28, by urbanc
ISAR-fied two proofs about equality for abstraction functions.
2005-11-28, by urbanc
* Provers/induct: obtain pattern;
2005-11-27, by wenzelm
added an authors section (please let me know if somebody is left out or unhappy)
2005-11-27, by urbanc
some minor tunings
2005-11-27, by urbanc
added the version of nominal.thy that contains
2005-11-27, by urbanc
cleaned up all examples so that they work with the
2005-11-27, by urbanc
finished cleaning up the parts that collect
2005-11-27, by urbanc
Corrected treatment of non-recursive abstraction types.
2005-11-26, by berghofe
tuned induct proofs;
2005-11-25, by wenzelm
induct: insert defs in object-logic form;
2005-11-25, by wenzelm
tuned induct proofs;
2005-11-25, by wenzelm
tuned induct proofs;
2005-11-25, by wenzelm
consume: unfold defs in all major prems;
2005-11-25, by wenzelm
revert_skolem: fall back on Syntax.deskolem;
2005-11-25, by wenzelm
forall_conv ~1;
2005-11-25, by wenzelm
added dummy_pattern;
2005-11-25, by wenzelm
tuned names;
2005-11-25, by wenzelm
forall_conv: limit prefix;
2005-11-25, by wenzelm
fix_tac: proper treatment of major premises in goal;
2005-11-25, by wenzelm
removed obsolete dummy paragraphs;
2005-11-25, by wenzelm
tuned;
2005-11-25, by wenzelm
code generator: case expressions, improved name resolving
2005-11-25, by haftmann
added fsub.thy (poplmark challenge) to the examples
2005-11-25, by urbanc
Fixed problem with strong induction theorem for datatypes containing
2005-11-25, by berghofe
send more information with test-takes-too-long message
2005-11-25, by kleing
fixed spelling of 'case_conclusion';
2005-11-24, by wenzelm
tuned induct proofs;
2005-11-24, by wenzelm
tuned induction proofs;
2005-11-23, by wenzelm
more robust revert_skolem;
2005-11-23, by wenzelm
tuned;
2005-11-23, by wenzelm
Provers/induct: definitional insts and fixing;
2005-11-23, by wenzelm
consume: proper treatment of defs;
2005-11-23, by wenzelm
added case_conclusion attribute;
2005-11-23, by wenzelm
(co)induct: taking;
2005-11-23, by wenzelm
RuleCases.case_conclusion;
2005-11-23, by wenzelm
tuned;
2005-11-23, by wenzelm
added case_conclusion attribute;
2005-11-23, by wenzelm
improved failure tracking
2005-11-23, by haftmann
Datatype_Universe: hide base names only;
2005-11-22, by wenzelm
added type cases/cases_tactic, and CASES, SUBGOAL_CASES;
2005-11-22, by wenzelm
cases_tactic;
2005-11-22, by wenzelm
moved multi_resolve(s) to drule.ML;
2005-11-22, by wenzelm
find_xxxS: term instead of thm;
2005-11-22, by wenzelm
export map_tags;
2005-11-22, by wenzelm
make coinduct actually work;
2005-11-22, by wenzelm
Drule.multi_resolves;
2005-11-22, by wenzelm
declare coinduct rule;
2005-11-22, by wenzelm
added code generator syntax
2005-11-22, by haftmann
added codegenerator
2005-11-22, by haftmann
added code generator syntax
2005-11-22, by haftmann
new treatment of polymorphic types, using Sign.const_typargs
2005-11-22, by paulson
added codegen package
2005-11-21, by haftmann
added serializer
2005-11-21, by haftmann
tweak
2005-11-21, by paulson
fixed some inconveniencies in website
2005-11-21, by haftmann
CONJUNCTS;
2005-11-19, by wenzelm
tuned;
2005-11-19, by wenzelm
Goal.norm_hhf_protected;
2005-11-19, by wenzelm
added coinduct attribute;
2005-11-19, by wenzelm
added CONJUNCTS: treat conjunction as separate sub-goals;
2005-11-19, by wenzelm
simpset: added reorient field, set_reorient;
2005-11-19, by wenzelm
tuned norm_hhf_protected;
2005-11-19, by wenzelm
removed conj_mono;
2005-11-19, by wenzelm
induct: CONJUNCTS for multiple goals;
2005-11-19, by wenzelm
tuned induct syntax;
2005-11-19, by wenzelm
FOL: -p 2;
2005-11-19, by wenzelm
presburger method updated to deal better with mod and div, tweo lemmas added to Divides.thy
2005-11-18, by chaieb
-- changed the interface of functions vampire_oracle and eprover_oracle.
2005-11-18, by mengj
-- terms are fully typed.
2005-11-18, by mengj
-- before converting axiom and conjecture clauses into ResClause.clause format, perform "check_is_fol_term" first.
2005-11-18, by mengj
-- combined common CNF functions used by HOL and FOL axioms, the difference between conversion of HOL and FOL theorems only comes in when theorems are converted to ResClause.clause or ResHolClause.clause format.
2005-11-18, by mengj
less
more
|
(0)
-10000
-3000
-1000
-120
+120
+1000
+3000
+10000
+30000
tip