src/HOL/List.ML
2002-05-08 wenzelm oops;
2002-05-07 wenzelm converted;
2002-04-29 nipkow added rev_take and rev_drop
2002-02-14 nipkow nodups -> distinct
2002-01-08 nipkow added filter_filter
2001-12-15 kleing list_all2_rev
2001-12-13 wenzelm isatool expandshort;
2001-10-22 paulson Numerals now work for the integers: the binary numerals for 0 and 1 rewrite
2001-10-14 wenzelm moved rulify to ObjectLogic;
2001-10-05 wenzelm sane numerals (stage 1): added generic 1, removed 1' and 2 on nat,
2001-05-31 oheimb added list_all2_trans
2001-05-08 paulson new takeWhile lemma
2001-04-24 paulson removal of image_Collect as a default simprule
2001-01-09 nipkow `` -> and ``` -> ``
2000-12-20 paulson tidying, removing obsolete lemmas about 0=...
2000-11-03 wenzelm rev_exhaust: rulify;
2000-09-05 wenzelm removed Add_recdef_congs [map_cong] (see Main.thy);
2000-08-31 nipkow *** empty log message ***
2000-08-30 nipkow introduced induct_thm_tac
2000-08-28 nipkow Removed map_compose from simpset.
2000-08-17 nipkow added map_cong to recdef
2000-07-24 wenzelm avoid referencing thy value;
2000-07-14 paulson moved sublist from UNITY/AllocBase to List
2000-07-06 nipkow Deleted list_case thms no subsumed by case_tac
2000-06-29 paulson fixed proof to cope with the default of equalityCE instead of equalityE
2000-06-22 wenzelm bind_thm(s);
2000-06-01 paulson simplified the proof of nth_upt
2000-05-31 paulson added new proofs and simplified an old one
2000-05-26 paulson renamed upt_Suc, since that name is needed for its primrec rule
2000-05-23 paulson added type constraint ::nat because 0 is now overloaded
2000-04-19 paulson removal of less_SucI, le_SucI from default simpset
2000-03-13 wenzelm case_tac now subsumes both boolean and datatype cases;
2000-03-13 nipkow exhaust_tac -> cases_tac
2000-02-24 nipkow Added and renamed a lemma.
2000-02-18 paulson expandshort
2000-01-26 nipkow optimized xs[i:=x]!j lemmas.
2000-01-12 nipkow More lemmas.
2000-01-10 nipkow Forgot to "call" MicroJava in makefile.
1999-12-13 paulson expandshort
1999-11-11 nipkow Imported Conny's lemmas from MicroJava
1999-09-21 nipkow Mod because of new solver interface.
1999-08-18 nipkow Added take_all and drop_all to simpset.
1999-08-16 wenzelm 'a list: Nil, Cons;
1999-07-19 paulson NatBin: binary arithmetic for the naturals
1999-07-18 nipkow Modifid length_tl
1999-06-17 paulson expandshort
1999-06-11 nipkow rev=rev lemma.
1999-06-10 paulson many new lemmas about take & drop, incl the famous take-lemma
1999-06-07 nipkow Added lots of 'replicate' lemmas.
1999-04-20 paulson tidied
1999-04-15 nipkow Added new thms.
1999-04-01 pusch new definition for nth.
1999-03-17 wenzelm Theory.sign_of;
1999-03-08 nipkow modified zip
1999-01-29 paulson expandshort
1999-01-19 paulson removal of the (thm list) argument of mk_cases
1999-01-09 nipkow Refined arith tactic.
1999-01-04 nipkow Shortened a proof.
1999-01-04 nipkow Version 1.0 of linear nat arithmetic.
1998-11-27 nipkow At last: linear arithmetic for nat!
less more (0) -100 -60 tip