#
3f252166 |
|
13-Mar-2018 |
Michael Norrish <Michael.Norrish@nicta.com.au> |
Work towards use of PolyML.pretty type for most pretty-printing Compiles up to src/parse under Poly/ML
|
#
08d7a558 |
|
23-Oct-2014 |
Piotr Trojanek <piotr.trojanek@gmail.com> |
trailing newlines in *.{sml,sig} files from src/ removed Trailing newlines from SML files in src/ were rendered in HTML documentation.
|
#
8d5fa7fe |
|
26-Jul-2012 |
Anthony Fox <anthony.fox@cl.cam.ac.uk> |
More assorted code tidying.
|
#
4e9bbfa3 |
|
18-Dec-2009 |
Scott Owens <Scott.Owens@cl.cam.ac.uk> |
Splitting Arbnum and Arbint to work around the dependency on HOLPP before moving into the mosml and poly directories.
|
#
ea7bf382 |
|
01-Oct-2009 |
Michael Norrish <Michael.Norrish@nicta.com.au> |
Implement more of Basis2002 for Moscow ML (adding Vector, Array, ArraySlice and VectorSlice), simplifying what Poly/ML has to emulate. Haven't done full rebuild test, but have got as far as integerTheory and Omega, which makes heavy uses of Vector etc.
|
#
3683cb2f |
|
28-Aug-2009 |
Michael Norrish <Michael.Norrish@nicta.com.au> |
Move the pretty-printing facilities around a bit so that both SML implementations use our own version of the PP structure. This implementation is called HOLPP in src/portableML. After the kernel's Overlay.sml is loaded, it is also available under the name PP. This retains fairly good backwards incompatibility. The one deliberate incompatibility is to make references to General.ppstream invalid. This makes us better conform with Basis 2002. The advantage of this manoeuvre is to allow me to better control what our pretty-printers do at a low level.
|
#
b2e4630e |
|
15-Aug-2008 |
Anthony Fox <anthony.fox@cl.cam.ac.uk> |
Support pretty-printing with different bases.
|
#
605e3911 |
|
11-Aug-2008 |
Anthony Fox <anthony.fox@cl.cam.ac.uk> |
Add compare to Arbnum.
|
#
da7e2df1 |
|
05-Jun-2005 |
Anthony Fox <anthony.fox@cl.cam.ac.uk> |
* Added bitsLib - this can be used for evaluating the functions in bitsTheory. * Added LOG2 (log base 2) to bitsTheory (it's introduced with new_specification). * log2 has been added to Arbnum - this provides fast evaluation for LOG2.
|
#
7626c2ef |
|
24-Jan-2005 |
Michael Norrish <Michael.Norrish@nicta.com.au> |
Fix string-to-arbnum conversion problems.
|
#
cf0aa16c |
|
23-Jan-2005 |
Michael Norrish <Michael.Norrish@nicta.com.au> |
Support for turning strings of differently based digits into numbers.
|
#
c1d224e6 |
|
23-Feb-2004 |
Anthony Fox <anthony.fox@cl.cam.ac.uk> |
* Added documentation. * The pretty printing is now more flexible (off by default). * Also added the function SIGN_EXTEND to bitsTheory and have included a few more theorems.
|
#
8941e75e |
|
11-Jan-2004 |
Michael Norrish <Michael.Norrish@nicta.com.au> |
Rewrote both kernels to cope with Overflow in Time.toSeconds by instead going via a real, and using Arbnum. Also simplified the thyid type in Theory.sml so that the representation was a pair of nums rather than a time value that was being converted into and out of.
|
#
553f8b78 |
|
17-Jul-2003 |
Anthony Fox <anthony.fox@cl.cam.ac.uk> |
Moved toHexString to Arbnum. + Removed unnecessary renaming of MOD_1 and DIV_1 to MOD1 and DIV1 in bitsTheory.
|
#
20b963b7 |
|
16-Jul-2003 |
Anthony Fox <anthony.fox@cl.cam.ac.uk> |
* Added exponentiation (pow) to Arbnum. * Added n_bit/Arbnum_ext.sml which contains toHexString : Arbnum.num -> string . I guess this function could be added to Arbnum? * Few minor tweaks to some proofs. * Added theorems SBIT_MULT and WORD_BITS_COMP_THM2.
|
#
668574a2 |
|
30-Jun-2003 |
Michael Norrish <Michael.Norrish@nicta.com.au> |
Provide gcd for arbitrary precision natural numbers.
|
#
bb654e4b |
|
26-Jun-2003 |
Konrad Slind <konrad.slind@gmail.com> |
Many small changes, most associated with boolification or lifting.
|
#
3c0a43c5 |
|
02-Nov-2000 |
Konrad Slind <konrad.slind@gmail.com> |
Added signature to Portable. Trivial changes to Arbnum.
|
#
7e0e4193 |
|
22-Jul-1999 |
Konrad Slind <konrad.slind@gmail.com> |
General cleanup in view of the fact that we now have the Standard Basis library. Hol98 assumes the existence of this!
|