Poly/ML

polyml@lists.polyml.org

1 participants
698 discussions

Reproducible Builds
by jrtc27＠jrtc27.com 09 Mar '16

09 Mar '16

Hi, I?ve been working on making Poly/ML build reproducibly (https://reproducible-builds.org), specifically the Debian package, although it should be distro-agnostic. The first step was getting timestamps to be deterministic using SOURCE_DATE_EPOCH (see https://reproducible-builds.org/docs/timestamps/), and I have done this, both for libpolyml?s different export formats, and for PolyML.make. This was sufficient when disabling native code generation. However, using x86 native code generation, ioarea is not reproducible. Specifically, for every defined entry, the first word (which I believe is the length word?) differs, with the rest of the entry zero. An example (ioarea starts at 0x01029010; sizeof(PolyWord) is 8 and IO_SPACING is 8, so 0x01029050 is entry 1): 1 Hex??dump??of??section??'.?data?: ? 1 Hex??dump??of??section??'.?data':? 2 ????0x01029000??00000000??00000000??08900201??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 2 ????0x01029000??00000000??00000000??08900201??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 3 ????0x01029010??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 3 ????0x01029010??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 4 ????0x01029020??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 4 ????0x01029020??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 5 ????0x01029030??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 5 ????0x01029030??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 6 ????0x01029040??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 6 ????0x01029040??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 7 ????0x01029050??cc495964??797f0000??00000000??00000000??.?IYdy.?.?.?.?.?.?.?.?.?.?.? 7 ????0x01029050??cc1944ae??577f0000??00000000??00000000??.?.?D.?W.?.?.?.?.?.?.?.?.?.?.? 8 ????0x01029060??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 8 ????0x01029060??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 9 ????0x01029070??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 9 ????0x01029070??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 10 ????0x01029080??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 10 ????0x01029080??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 11 ????0x01029090??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 11 ????0x01029090??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 12 ????0x010290a0??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 12 ????0x010290a0??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 13 ????0x010290b0??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 13 ????0x010290b0??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 14 ????0x010290c0??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? 14 ????0x010290c0??00000000??00000000??00000000??00000000??.?.?.?.?.?.?.?.?.?.?.?.?.?.?.?.? Where are these coming from, and do you have any ideas for how to make sure they are reproducible? Regards, James

2 2

Echo code as well as output (David Matthews)
by dtopham＠ohlone.edu 06 Mar '16

06 Mar '16

That works perfectly for what I need...thanks David On Sun, Mar 6, 2016 at 4:00 AM, <polyml-request at inf.ed.ac.uk> wrote: > Send polyml mailing list submissions to > polyml at inf.ed.ac.uk > > To subscribe or unsubscribe via the World Wide Web, visit > http://lists.inf.ed.ac.uk/mailman/listinfo/polyml > or, via email, send a message with subject or body 'help' to > polyml-request at inf.ed.ac.uk > > You can reach the person managing the list at > polyml-owner at inf.ed.ac.uk > > When replying, please edit your Subject line so it is more specific > than "Re: Contents of polyml digest..." > > > Today's Topics: > > 1. Echo code as well as output (David Topham) > 2. Re: Echo code as well as output (David Matthews) > > > ---------------------------------------------------------------------- > > Message: 1 > Date: Sat, 5 Mar 2016 09:16:05 -0800 > From: David Topham <dtopham at ohlone.edu> > To: polyml at inf.ed.ac.uk > Subject: [polyml] Echo code as well as output > Message-ID: > <CAD034BEm3Yxrgx1OeZTz-r_sQkowpw51YY8-= > ni7-qaOiTCBQQ at mail.gmail.com> > Content-Type: text/plain; charset="utf-8" > > I am looking for a way to display the code as well as the output when > running SML. > > I believe it might be called "trace" or "log"... I did find this suggestion > online: > > PolyML.startLog > > but that seems to be deprecated? > > Is there another option? > > e.g. > > fun f x = x * x; > f 4; > just displays > val it = 16: int > > and I would like something like: > > f 4 = 16 > or similar to see what code was evaluated to get the 16 >

1 0

Echo code as well as output
by dtopham＠ohlone.edu 06 Mar '16

06 Mar '16

I am looking for a way to display the code as well as the output when running SML. I believe it might be called "trace" or "log"... I did find this suggestion online: PolyML.startLog but that seems to be deprecated? Is there another option? e.g. fun f x = x * x; f 4; just displays val it = 16: int and I would like something like: f 4 = 16 or similar to see what code was evaluated to get the 16

2 1

namespacing a functor in a nested module
by philneaton95＠gmail.com 02 Mar '16

02 Mar '16

Hello list, I am building a library with nested modules. There happen to be certain functors within certain nested modules. Here is an example: mylib/ml_bind.ML ============== structure Mylib = struct structure B = B end mylib/B/C.sml ============== structure C = struct end (* Here so C.sml is discoverable *) signature Sig = sig ... end functor CFunctor (S: Sig) = struct ... end mylib/B/ml_bind.ML ============== structure B = struct local open C in end end I want the CFunctor to be exported both inside the library and to the end-user using the library. This is the only way I could get the library to compile because Poly/ML (and the standard) does not support functors within structs or signatures. This works, but CFunctor is now in the "global" namespace - this is just really ugly. Is there any way to get Poly/ML to export CFunctor within the Mylib.B namespace? On a separate note, is there a namespace to access the Basis namespace? For instance if I redefine a String structure within Mylib and want to reference the basis String structure, I get a circular dependency error. I was able to solve this by explicitly creating a Basis structure with an internal structure String in my "build.sml" script that makes Mylib and the files that depend on it. However, I'd rather do this within the library itself and not rely on the user to provide this namespace. Thank you! -- Phil Eaton

1 0

Fixed precision int and compatibility
by David.Matthews＠prolingua.co.uk 24 Feb '16

24 Feb '16

Thanks for the various comments on fixed precision integer. I've now implemented two different mechanisms for compatibility with arbitrary precision int. There is a configure option --enable-intinf-as-int. This causes polyimport to build the basis library with int as arbitrary precision integer rather than fixed precision. The second mechanism is to build a module. Calling PolyML.loadModule "IntAsIntInf"; loads a module that sets the compiler's default overloading to arbitrary precision and loads replacements for most of the basis library. I added modules to Poly/ML 5.6 as a way of providing extensions to the existing basis library and this is the first example. Note that this assumes that "poly" has been installed using "make install" and the module has been copied to its installation location. If you're testing it within the build tree you need PolyML.loadModule "modules/IntAsIntInf/IntAsIntInf"; There are a few cases that aren't covered but they are only likely to affect a few people. Specifically, when installing pretty printers the "depth" argument is always FixedInt.int. There may be a few other case where functions are tightly integrated into the compiler. The IntAsIntInf module covers most of the basis library but currently excludes socket IO and a few other cases. It can probably be extended as necessary. David

2 2

Poly/ML on Stackoverflow
by makarius＠sketis.net 18 Feb '16

18 Feb '16

Dear friends of the best unknown programming language on the planet. Someone with sufficiently many points on Stackoverflow has recently created a "polyml" tag. I have already brushed up its wiki http://stackoverflow.com/tags/polyml/info and added the tag to some existing questions. Often there is the odd situation that people ask questions about "ml" or "sml" and can only think of "smlnj" as the one and only implementation. People on this mailing list should know better, and are invited to populate the "polyml" section of Stackoverflow further. (It has presently 2 followers and 18 questions.) It is also possible to vote for questions and answers that are relevant for Poly/ML, and thus improve its visibility. Makarius

2 1

Fixed precision int
by David.Matthews＠prolingua.co.uk 10 Feb '16

10 Feb '16

Anthony, I'm copying the mailing list to my replies because this is of general interest. On 10/02/2016 16:02, Anthony Fox wrote: > I just occurred to me that I could have done: > > structure Int :> INTEGER = IntInf > > if I wanted IntInf everywhere (rather than having the choice of fixed ot arbitrary). I still think it would be nice to have a command line option for this? At the very least, this way of getting the old behaviour should be advertised. > That would work if you use the Int structure but there are lots of places that pick up the default "int". For instance, if you have an overloaded function: fun f x y = x+y; that will fall back to the default "int". Also, all the library functions that use "int" e.g. Array.sub, String.size, List.length or TextIO.inputN, will still have the fixed precision int. I'm inclined to think that having a "configure" option would be the answer. David

3 3

Fixed precision int
by David.Matthews＠prolingua.co.uk 10 Feb '16

10 Feb '16

On 10/02/2016 16:18, Anthony Fox wrote: >> Can you provide some more information and try to narrow the problem down? There certainly shouldn't be bus errors or segmentation faults anywhere. > > I removed the files > > $POLYDIR/lib/libpoly* > > before doing an Poly/ML install and that seemed to fix things. OK. The libraries have the same version number as the last release so that may cause problems. I seem to recall reading that one was supposed to increment the version number just before a release but maybe it would be better to increment the version immediately after so that versions from git always have a different version from the last release. David

1 0

Fixed precision int
by David.Matthews＠prolingua.co.uk 10 Feb '16

10 Feb '16

On 10/02/2016 15:41, Anthony Fox wrote: > This is significant change. Would it be possible to make this user selectable? MLton has the command line flag > > -default-type intinf > > when IntInf is preferred for Int. Perhaps there could be a switch to "configure". It's really a question of how the basis library is built. > I had been programming on the basis that Int was arbitrary precision in Poly/ML. I certainly need IntInf in places and it was very convenient to not have to worry about this sort of thing. Having to use ?to? and ?from? functions is a nuisance. I?ve attempted to update my code for this change and the diff was > > 19 files changed, 334 insertions(+), 275 deletions(-) > > In itself this wasn?t too bad. However, after this I have less confidence in the robustness of the code. Poly/ML programmer?s have not needed to insert ?handle Overflow? before now, which is great advantage over ?performance obsessed? compilers. > > Anyhow, HOL4 doesn?t build using the FixedPrecisionInt branch. An early problem was due to Position.int no longer being the same as Int.int. Then I got a > > Segmentation fault: 11 > > error when trying to build a parser. This problem may be related to > > Bus error: 10 > > errors that I?ve been getting. For example, if I use polyc to compile > > val main = PolyML.rootFunction > > then the resulting program gives this bus error when trying to process anything (such as ?val x = 1;?). Can you provide some more information and try to narrow the problem down? There certainly shouldn't be bus errors or segmentation faults anywhere. David

1 0

Fixed precision int
by David.Matthews＠prolingua.co.uk 10 Feb '16

10 Feb '16

From the start int in Poly/ML has been arbitrary precision. After around thirty years I think it's time to make a change. The current plan is to introduce a fixed precision integer type and use that as the default int. Arbitrary precision will remain as LargeInt.int/IntInf.int. The reason for the change is that it is becoming clear that having arbitrary precision int as the only integer type imposes restrictions on the code both as regards the integer type itself but also more widely. The arbitrary precision type in Poly/ML is implemented using a tagged representation. Small values that will fit in 31/63 bits are represented as the value shifted one bit left and with the bottom bit set. Larger values are represented as pointers to arrays of bytes, either in the GMP format or Poly's own format. Since pointers are always word-aligned it's possible to distinguish the two forms by looking at the bottom bit. The "tag-bit" also serves another purpose. The garbage-collector can use it to distinguish pointers from non-pointers so all non-pointer values, e.g. bool, char and word, are represented using the tagged form. Arbitrary precision operations are handled directly by the code-generator. The idea is that when the values are small, as they usually are, the machine can execute the appropriate instruction directly. For example, addition is generated as an add instruction. It is preceded by a test on the tags and followed by a test for overflow. If the arguments were not tagged or the result overflowed there is a call into the run-time system. This emulates the instruction and returns with the result in the correct register. Emulation has limitations. Currently only (in)equality, comparison, addition and subtraction are emulated. Other operations such as multiplication and division involve calls to assembly code. This means that code that makes significant use of arithmetic incurs overheads even if it only ever uses small values. There is also a more subtle cost. Because emulating addition and subtraction could involve allocating memory on the heap for the long-format result every addition and subtraction could result in a garbage-collection. This means that the registers, which could be holding intermediate results, have to be treated as the roots for the GC. That in turn means that they must always contain either valid pointers or tagged values. This sometimes involves adding extra instructions simply to ensure this is the case. It also means that whenever the code returns from the run-time system to ML all the registers have to be loaded with known values, adding to the cost of a RTS call. The plan is to retain the existing arbitrary precision using the current tagged values but remove emulation. All arbitrary precision operations will involve an ML function call to the assembly code. This will compute the result directly if it is short and call into the run-time system if it is long. This is actually likely to faster than the current scheme if the values are long. Some cases, for example equality between an arbitrary precision value and a short constant, can continue to be handled by the code-generator since they do not require emulation. Fixed precision int will be based on the current short format i.e. 31 bits on 32-bit machines, 63 bits on 63-bit machines. Operations on these can be handled directly by the code-generator. These changes are currently being tested in the FixedPrecisionInt branch. This requires at least one, preferably two, calls to "make compiler" to build a version of the compiler that generates fixed precision operations. For backwards compatibility it does not yet gain all the advantages of the change; in particular it still clears all the registers on return from the run-time system.

1 0

← Newer
1
...
16
17
18
19
20
21
22
...
70
Older →

Jump to page:

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

Poly/ML