History log of /seL4-l4v-master/HOL4/src/num/numLib.sig
Revision Date Author Comments
# 2cc82a7b 29-Aug-2011 Anthony Fox <anthony.fox@cl.cam.ac.uk>

Add SUC_RULE.


# 7b73c8d7 16-Jul-2010 Konrad Slind <konrad.slind@gmail.com>

src/num/theories/SingleStep.{sig,sml} is gone. The
defininitions of Cases, Cases_on, Induct, Induct_on,
CASE_TAC (and co.) are now in basicProof/BasicProvers.
completeInduct_on and measureInduct_on are now in
numLib. recInduct is now in src/tfl/Induction.sml.
All these are collected in bossLib, so the changes
should be invisible to ordinary users.

SingleStep.*.doc has been changed accordingly.

BasicProvers.NORM_TAC should now automatically perform
all case splits (from if-then-else expressions as
well as case expression) arising anywhere in the goal.


# 4a07589c 31-May-2010 Michael Norrish <Michael.Norrish@nicta.com.au>

Move ARITH_NORM_ss to numSimps.


# 3d22bf31 17-May-2010 Michael Norrish <Michael.Norrish@nicta.com.au>

Add a new arithmetic normalisation simpset fragment to numLib.

Eventual intention is to have this as part of the stateful rewriting simpset
where it will break lots of proofs until I either fix them, or just 'diminish'
the simpset at the head of the broken scripts.


# a1d7def4 05-May-2009 Konrad Slind <konrad.slind@gmail.com>

Additions to multiset and primeFactor
theories. Fixed definition of PRIMES
sequence in dividesTheory. Also added misc.
theorems to arithmetic. Some amount of
meaningless shuffling about.


# 7d90547c 29-Mar-2008 Konrad Slind <konrad.slind@gmail.com>

This check-in mainly fixes a problem with
literals occurring in patterns of TFL-style
definitions. There are a host of other minor
changes as well.


# e2dcedb6 02-Nov-2005 Michael Norrish <Michael.Norrish@nicta.com.au>

New LEAST_ELIM_TAC for dealing with goals that include LEAST-terms.


# 1d82e8b7 01-Jul-2003 Konrad Slind <konrad.slind@gmail.com>

Added new higher order rewrite rule for bounded quantifications. This
addition is for existentials; bounded universals were checked in a while
ago. Conversions have been added to numLib, since the simplifier didn't
seem to do the "right thing" with these theorems.


# bb654e4b 26-Jun-2003 Konrad Slind <konrad.slind@gmail.com>

Many small changes, most associated with boolification or lifting.


# 83f159bc 22-Aug-2002 Michael Norrish <Michael.Norrish@nicta.com.au>

Implement some useful code to transfrom SUC-based definitions into ones
that can be used with numerals easily (no conditional rewrites necessary).


# 18c87632 14-Dec-2001 Michael Norrish <Michael.Norrish@nicta.com.au>

Added new facilities for dropping or preferring certain numeric types
all at once. Documented one of the new functions, and fixed the
documentation for add_numeral_form, which now automatically adds the
appropriate overloading for "&" (I realised that we didn't need to
force the user to do this themselves).


# a7f72098 10-Feb-2001 Konrad Slind <konrad.slind@gmail.com>

Minor changes


# aea5ab0e 27-Dec-2000 Konrad Slind <konrad.slind@gmail.com>

NonRecSize - fixed problem that "bool_case 0 0" is ambiguous depending
on what "0" is resolved to.


# 947bbb16 12-Feb-2000 Konrad Slind <konrad.slind@gmail.com>

Addition of SUC_ELIM_CONV, from arithmeticTheory, where it was
being adjoined.


# 88242741 02-Dec-1999 Konrad Slind <konrad.slind@gmail.com>

Change to structure of numLib so that reduce and arith are incorporated.


# 7d28550d 18-Aug-1999 Konrad Slind <konrad.slind@gmail.com>

Added num_CONV and INDUCT_TAC to numLib for convenience.


# 58841e67 29-Apr-1999 Michael Norrish <Michael.Norrish@nicta.com.au>

Initial revision