History log of /seL4-l4v-master/HOL4/examples/acl2/examples/testEncode.sml
Revision Date Author Comments
# 8d83067c 21-Oct-2018 Michael Norrish <Michael.Norrish@nicta.com.au>

Remove TABs from examples


# 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!


# 7839c3ab 24-Nov-2008 Konrad Slind <konrad.slind@gmail.com>

Fix for a Define bug spotted by mjcg. When
dealing with recursive calls under a case,
if variables with certain names (those
starting with v) are bound in the case
pattern then it can happen that variables
generated during pattern matching can be
the same, leading to failed proofs. Totally
obscure, and dealt with properly (I think)
in normal pattern matching. So, a difference
between Pmatch and Functional. The fix is
to invent a class of variables not accepted
by the parser (i.e. starting *v) and to later eliminate
the weird names from any theorems coming out of Hol_defn.

Some other trivial mods made in passing also, plus
tests for the new behaviour.

Also a new conversional, MAP_THM, which applies the
given conversion to the assumptions and conclusion
of the given theorem.


# 0513ac47 11-Nov-2006 James Reynolds <jr291@cam.ac.uk>

encodeLib: Major rewrite to allow encoding of functions with partial specifications.
translateScript: Extra theorems added for better resolution of natural numbers
testEncode: Updated to test partial specifications and some extra red-black tree examples added.


# f50c77cf 26-Sep-2006 James Reynolds <jr291@cam.ac.uk>

testEncode: Tests for native let handling added


# 748648d3 08-Sep-2006 James Reynolds <jr291@cam.ac.uk>

testEncode: Added some tests for the HO function encoding


# c3915e03 13-Aug-2006 James Reynolds <jr291@cam.ac.uk>

testEncode: Added examples of encoding with an added recursion theorem (log2) and a restricted input domain (modexp)


# 7dabebc1 04-Aug-2006 James Reynolds <jr291@cam.ac.uk>

testEncode.sml Added a test for converting a theorem, DIVISION.


# 3f47eeca 26-Jul-2006 James Reynolds <jr291@cam.ac.uk>

testEncode: Modifed to use the new encodeLib, Matt's example is now the original example, and hences uses polytypism. Some tests of encoding types have also been included, as well as some more interesting encodings, eg. Red-Black trees.


# 3b81e730 25-May-2006 James Reynolds <jr291@cam.ac.uk>

encodeLib.sml: Now includes a short pre-processing step to remove lambda abstractions and let expressions
testEncode.sml: Removed the simplification as its included in the above


# 023302da 24-May-2006 James Reynolds <jr291@cam.ac.uk>

testEncode.sml: Tests encoding of some simple arithmetic functions, and some load / store definitions due to Matt Kaufmann.