Poly/ML

polyml@lists.polyml.org

2 participants
698 discussions

Pretty printing of functor arguments
by phil.clayton＠lineone.net 03 Sep '11

03 Sep '11

Just a minor observation: when I enter e.g. functor F () = struct end; Poly/ML prints back functor F (sig end) : sig end Generally, when Functor_Arguments is a Specification, it prints back with an enclosing sig ... end. Even if the whole response is not a valid piece of syntax, it would seem nice to have a valid Functor_Arguments printed back. (I made exactly the same mistake initially!) Phil

1 0

Order of evaluation of arguments to a function
by ivan.tomac＠gmail.com 20 Aug '11

20 Aug '11

Is the following code supposed to print 1 followed by 2 or 2 followed by 1? val _ = (fn () => (print "1\n"; fn x => x)) () (print "2\n"; ()) In SML/NJ, MLton and PolyML it does the former, while in Moscow ML it does the latter. Is this specified somewhere in the standard? I noticed equivalent code in OCaml behaves the way Moscow ML does which is not very surprising seeing how Moscow ML was based on Caml Light. Could this be a bug in Moscow ML? The following code works the same in all 4 SML compilers (but different in OCaml): val _ = (print "1\n"; 1) + (print "2\n"; 2) It seems to me like SML/NJ, MLton and PolyML evaluate all function arguments left to right, OCaml evaluates them right to left, and Moscow ML seems inconsistent.

6 6

Re: [MLton-user] Order of evaluation of arguments to a function
by ivan.tomac＠gmail.com 19 Aug '11

19 Aug '11

On Fri, Aug 19, 2011 at 1:32 AM, <rossberg(a)mpi-sws.org> wrote: >> Is the following code supposed to print 1 followed by 2 or 2 followed by 1? >> >> val _ = (fn () => (print "1\n"; fn x => x)) () (print "2\n"; ()) >> >> In SML/NJ, MLton and PolyML it does the former, while in Moscow ML it >> does the latter. Is this specified somewhere in the standard? I >> noticed equivalent code in OCaml behaves the way Moscow ML does which >> is not very surprising seeing how Moscow ML was based on Caml Light. >> Could this be a bug in Moscow ML? > > It is specified, and the deviation a (known) bug/limitation of Moscow ML. > It's due to its implementation being based on the Caml VM, which chose this > semantics in order to be able to implement curried functions more > efficiently. > Interesting and very useful to know. > (Note that in OCaml, evaluation order actually depends on whether you are > using byte code or native code compilation.) > That sounds bad.

1 0

PolyML with OS X 10.7 Lion?
by palantir＠trustworthytools.com 13 Aug '11

13 Aug '11

I have just recently updated my MacBook Pro from Snow Leopard to Lion (Mac OS X 10.7), and now I am regretting it. Poly/ML has stopped working for building the HOL theorem prover. When I try to run the configuration script for HOL using my current version of Poly/ML, I see . . . Making tools/mllex/mllex.exe. Poly/ML 5.3 Release > # ld: library not found for -lcrt1.10.6.o collect2: ld returned 1 exit status Failed to build mllex. In fact this library was present in prior versions of Mac OS X, like 10.6, but is not present in 10.7. So I tried downloading and building the current version of Poly/ML, 5.4.1. I have the current version of the Developer tools, Xcode version 4.1 for Lion. When trying ./configure I see -bash-3.2$ ./configure checking for a BSD-compatible install... /usr/bin/install -c checking whether build environment is sane... yes checking for a thread-safe mkdir -p... ./install-sh -c -d checking for gawk... no checking for mawk... no checking for nawk... no checking for awk... awk checking whether make sets $(MAKE)... yes checking build system type... x86_64-apple-darwin11.0.0 checking host system type... x86_64-apple-darwin11.0.0 checking for style of include used by make... GNU checking for gcc... gcc checking whether the C compiler works... no configure: error: in `/Users/palantir/sml/polyml/polyml.5.4.1': configure: error: C compiler cannot create executables See `config.log' for more details When I look at the end of the config.log file, I see ## ----------- ## ## confdefs.h. ## ## ----------- ## /* confdefs.h */ #define PACKAGE_NAME "Poly/ML" #define PACKAGE_TARNAME "polyml" #define PACKAGE_VERSION "5.4" #define PACKAGE_STRING "Poly/ML 5.4" #define PACKAGE_BUGREPORT "polyml AT polyml DOT org" #define PACKAGE_URL "" #define PACKAGE "polyml" #define VERSION "5.4" configure: exit 77 Are there any suggestions on how to get Poly/ML working under Lion? Thanks. Peter V. Homeier -- "In Your majesty ride prosperously because of truth, humility, and righteousness; and Your right hand shall teach You awesome things." (Psalm 45:4)

1 0

Experiences with Lion
by aleks0＠gmail.com 24 Jul '11

24 Jul '11

Hi folks, I'm considering updating my system to OS X 10.7, though I'm wondering if it will torpedo poly (cf. Snow leopard). Has anyone had success/struggles running poly/ML under Lion? Aleks

1 0

Bug fixes and 5.4.1
by David.Matthews＠prolingua.co.uk 14 Jul '11

14 Jul '11

There have been a few bugs fixed since the release of 5.4. I've now back-ported the fixes to the 5.4-fixes branch and updated the pre-built compilers for all the architectures. The two issues that seem to have caused particular problems are the divide instruction bug that caused an assertion fault in the garbage collector and the failure to pass floating point rounding control that meant that IEEEReal.setRoundingMode didn't have any effect. I'm planning to release this as a bug-fix release in the next week or so unless anyone reports any problems. Because the pre-built compilers have been updated it should only be necessary to run ./configure make in the fixes branch. Run "make distclean" if necessary to get a clean directory. David

2 1

measuring/profiling memory consumption
by kleing＠cse.unsw.edu.au 07 Jul '11

07 Jul '11

What is the best way to measure memory consumption in polyml? Background: we're running out of memory after porting some of our tools and proofs to Isabelle-2011. It seems that the main problem is that we are now producing more objects that can later be shared, i.e. we think we were able to get memory consumption down by sharing more often (using PolyML.shareCommonData PolyML.rootFunction, not sure if this is the sane thing to do). It's still too much for saving the state at the end of the session on a 32bit system, though. On 64bit systems, we seem to need about 12GB for something that fit into about 2G on 32bit before. We tried various measurements and tried to bisect where in Isabelle or our code the problem was introduced, but we're only getting strange results - seemingly completely unrelated changes. My guess is that we didn't measure right. We used PolyML.objSize PolyML.rootFunction as an approximation of the overall memory consumption, but that doesn't always seem to correspond. What is the best way to figure out more precisely what is going? More specifically, I'd like to figure out: - maximum total memory consumption of the polyml process in a complete program run - current non-garbage heap consumption at a given point in the program - more detailed view of which type of object is how big and occurs how often at a given point Does anyone have more experience with this kind of thing? Cheers, Gerwin

2 1

Assertion `val.IsDataPtr()' failed
by alex.merry＠cs.ox.ac.uk 01 Jul '11

01 Jul '11

I think Lucas has probably mentioned this problem that we keep running into with quantomatic. I'm using Poly/ML 5.4 (ie: the lastest version of the 5.4 branch from subversion). Occasionally (or, in my case, frequently) we get the following error: poly: scanaddrs.cpp:107: PolyWord ScanAddress::ScanStackAddress(PolyWord, StackObject*, bool): Assertion `val.IsDataPtr()' failed. There appears to be no rhyme or reason to it. Re-running poly with the same code another time will not necessarily produce this assertion, or may produce it in a different place. It happens regardless of compiler optimisations (I've tried -O3, -O2 and -O0). I managed to get a backtrace: #0 0x0000003ff54330c5 in raise () from /lib64/libc.so.6 #1 0x0000003ff5434a76 in abort () from /lib64/libc.so.6 #2 0x0000003ff542b905 in __assert_fail () from /lib64/libc.so.6 #3 0x00007ffff7dc357e in ScanAddress::ScanStackAddress (this=0x7fffffffde10, val=..., base=0x7fffed6b56c0, isCode=false) at scanaddrs.cpp:107 #4 0x00007ffff7dc3811 in ScanAddress::ScanAddressesInObject (this=0x7fffffffde10, obj=0x7fffed6b56c0, lengthWord=4827858800541175088) at scanaddrs.cpp:146 #5 0x00007ffff7d9b4e2 in ProcessMarkPointers::ScanAddressesInObject (this=0x7fffffffde10, base=0x7fffed6b56c0, L=4827858800541175088) at gc.cpp:509 #6 0x00007ffff7dc42c8 in ScanAddress::ScanAddressesInObject (this=0x7fffffffde10, base=0x7fffed6b56c0) at scanaddrs.h:86 #7 0x00007ffff7dc3d48 in ScanAddress::ScanAddressesInRegion (this=0x7fffffffde10, region=0x7fffed6a3af0, end=0x7fffed6c3000) at scanaddrs.cpp:252 #8 0x00007ffff7d9ad12 in OpMutables (process=0x7fffffffde10) at gc.cpp:348 #9 0x00007ffff7d9d2cc in doGC (doFullGC=false, wordsRequiredToAllocate=3) at gc.cpp:1341 #10 0x00007ffff7d9f473 in QuickGCRequest::Perform (this=0x7fffeaa10cc0) at gc.cpp:1955 #11 0x00007ffff7da732c in Processes::BeginRootThread (this=0x7ffff7ffa8e0, rootFunction=0x605278) at processes.cpp:1253 #12 0x00007ffff7d9a472 in polymain (argc=3, argv=0x7fffffffe218, exports=0xf72a00) at mpoly.cpp:205 #13 0x0000000000400659 in main (argc=3, argv=0x7fffffffe218) at polystub.c:43 I don't know how useful that is, though. Alex

2 4

Repeated ascriptions
by aleks0＠gmail.com 28 Jun '11

28 Jun '11

Why are repeated signature ascriptions slow? Suppose Foo is a pretty big structure, which has already been ascribed the signature FOO: > structure X = Foo; (* fast, note that poly already knows Foo, and thus X, is a FOO *) structure X : FOO > structure X = Foo : FOO (* slow *) structure X : FOO > structure X : FOO = Foo (* slow *) structure X : FOO Poly already knows that Foo is a FOO, so surely this should return instantly, but it acts like its typechecking the whole struct again. While it's not necessary to do the ascriptions above (poly is smart enough to figure out X is a FOO, even in the first case), this same issue seems to be seriously slowing down functor evaluation, where you can't avoid ascription. I thought using opaque ascription might skirt the issue, but the same thing happens. Is poly just being silly, or this this a consequence of how the type system works? a

2 1

Nice parallelisation examples in poly/ML
by aleks0＠gmail.com 23 Jun '11

23 Jun '11

Hello polyglots, I was wondering, do any of you have some little examples or chunks of code that do some parallel computation, possibly using some of the code in Isabelle's "Pure/Concurrent" dir? Say, for instance, I have a stack of names and an (expensive) function from names to bools. I'd like to spawn a handful of workers and wait for them to finish. The workers then pop names off, compute the boolean function and push the names back on to "true" and "false" stacks. This kind of setup should be pretty straightforward to implement, but a few pointers as far as what structs to use and how to use them would be useful. Thanks! Aleks

2 4

← Newer
1
...
37
38
39
40
41
42
43
...
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