History log of /seL4-l4v-10.1.1/HOL4/src/pred_set/src/PFset_conv.sml
Revision Date Author Comments
# 6a81a039 21-May-2018 Michael Norrish <Michael.Norrish@nicta.com.au>

Remove TABs from src

Will also make selftest to check that they aren't introduced


# 1e48d44b 04-Oct-2017 Michael Norrish <Michael.Norrish@nicta.com.au>

Add syntax/ops to make set manipulations easier


# 14370ca2 24-Sep-2014 Michael Norrish <michael.norrish@nicta.com.au>

Fixed implementation of PFset_conv.MAX_SET_CONV

Thanks to Konrad for the fix. With some regression tests.


# ad0c7787 22-Jul-2012 Michael Norrish <michael.norrish@nicta.com.au>

Fix PFset_conv to not quote terms in one of its internal proofs.

The problem with this is that later theories may overload "SIGMA" or
other constants, thereby changing the meaning of this code when it's
evaluated. (Indeed, this is exactly what code in src/probability did
do.) Good practice, thus, is not to use the parser in library code, or
to rebind the parser so that it is not using the global grammar.


# 4761143b 10-Aug-2009 Tjark Weber <Tjark.Weber@cl.cam.ac.uk>

Removed trailing whitespace from all .sml and .sig files.

This affects over 900 files and was done using emacs's delete-trailing-whitespace
function in batch mode. Building the system with Poly/ML and Moscow ML seems to
work, so I'm hoping these changes don't break anything. Please complain if
they do!


# 6971535d 27-Aug-2008 Konrad Slind <konrad.slind@gmail.com>

Getting rid of some pattern-matching complaints,
as Anthony suggested.


# 532d6d9a 28-Dec-2007 Konrad Slind <konrad.slind@gmail.com>

hanges to upgrade EVAL on BIGUNION {}.



M src/parse/term_grammar.sig
M src/pred_set/src/pred_setScript.sml
M src/pred_set/src/pred_setLib.sml
M src/pred_set/src/PFset_conv.sml


# 02c42174 22-Oct-2005 Konrad Slind <konrad.slind@gmail.com>

Added powerset operator and simple theorems (finiteness, cardinality).
EVAL has been taught about it, etc.


# 835459f2 27-Sep-2005 Konrad Slind <konrad.slind@gmail.com>

EVAL now works for set expressions. Almost the full language of
sets is accepted, e.g., equality between finite sets, membership,
set comprehension, union, intersection, difference, deletion,
image, cardinality, finiteness, etc. Generally, the actual sets
have to be finite enumerations. Occasionally, variables for
the elements may be used. Some of the underlying algorithms
are quadratic, so not everything will scale up.

Also, there's now a full pred_setSyntax.sml.


# d5f87de0 17-Feb-2005 Michael Norrish <Michael.Norrish@nicta.com.au>

Fix for IMAGE_CONV (provided by Peter Homeier), and selftest examples
to help it not happen again.


# d810a63a 23-Jun-2002 Konrad Slind <konrad.slind@gmail.com>

Fixed Lockwood Morris' problem with UNION_CONV.


# 17397522 02-May-2002 Konrad Slind <konrad.slind@gmail.com>

Fixed bug in set conversions: the constant IN is no longer defined in
pred_setTheory, but in boolTheory, for some reason.

Also added rudimentary syntax support for sets.


# 857eaf01 22-Nov-2000 Konrad Slind <konrad.slind@gmail.com>

Now builds in Kan.0.


# 97555632 14-Nov-2000 Michael Norrish <Michael.Norrish@nicta.com.au>

Kananaskis compatibility.


# dae8376f 25-Apr-2000 Konrad Slind <konrad.slind@gmail.com>

Minor typographical changes.


# d1705ac7 20-Apr-2000 Michael Norrish <Michael.Norrish@nicta.com.au>

Attempt to parse (--`\/`--) failed, and needed to be replaced by
(--`$\/`--).


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

Initial revision