src/HOL/Partial_Function.thy
2018-01-10 nipkow ran isabelle update_op on all sources
2017-11-26 wenzelm more symbols;
2017-08-07 blanchet tuning imports
2016-12-22 haftmann proper logical constants
2016-07-29 Andreas Lochbihler add lemmas contributed by Peter Gammie
2016-02-23 nipkow more canonical names
2015-12-13 wenzelm more general types Proof.method / context_tactic;
2015-11-09 wenzelm qualifier is mandatory by default;
2015-11-04 ballarin Keyword 'rewrites' identifies rewrite morphisms.
2015-07-18 wenzelm isabelle update_cartouches;
2015-04-14 Andreas Lochbihler move lemma from AFP/Coinductive
2015-03-07 wenzelm clarified Drule.gen_all: observe context more carefully;
2015-02-11 Andreas Lochbihler add lemmas about flat_ord
2014-11-02 wenzelm modernized header uniformly as section;
2014-08-16 wenzelm updated to named_theorems;
2014-01-20 blanchet moved 'fundef_cong' attribute (and other basic 'fun' stuff) up the dependency chain
2013-12-05 Andreas Lochbihler restrict admissibility to non-empty chains to allow more syntax-directed proof rules
2013-09-27 Andreas Lochbihler generalise lemma
2013-09-02 Andreas Lochbihler move admissible out of class ccpo to avoid unnecessary class predicate in foundational theorems
2013-07-24 krauss derive specialized version of full fixpoint induction (with admissibility)
2013-03-21 krauss added rudimentary induction rule for partial_function (heap)
2013-03-19 Andreas Lochbihler add induction rule for partial_function (tailrec)
2012-08-22 wenzelm prefer ML_file over old uses;
2012-03-15 wenzelm declare command keywords via theory header, including strict checking outside Pure;
2011-12-29 huffman remove constant 'ccpo.lub', re-use constant 'Sup' instead
2011-10-29 wenzelm tuned;
2011-05-31 krauss generic fixpoint induction (with explicit curry/uncurry predicates) and instance for option type
2011-05-31 krauss admissibility on option type
2011-05-23 krauss also manage induction rule;
2011-05-23 krauss separate initializations for different modes of partial_function -- generation of induction rules will be non-uniform
less more (0) -30 tip