Poly/ML

polyml@lists.polyml.org

698 discussions

building polyml on Alpine Linux
by dtopham＠gmail.com 17 Oct '20

17 Oct '20

I have been trying to get polyml working on Alpine Linux 32-bit Since there is't yet a package to install it, I tried getting the source from github When doing make, I first got error about missing libffi directory. I thought I may bypass that by configuring with option to use system libffi i.e. apk add libffi-dev ./configure --with-system-libffi --with-x Here is result: ---------------- make all-recursive make[1]: Entering directory '/root/vfpub/polyml-master' Making all in libpolyml make[2]: Entering directory '/root/vfpub/polyml-master/libpolyml' make[3]: Entering directory '/root/vfpub/polyml-master/libpolyml' /bin/sh ../libtool --tag=CXX --mode=compile g++ -DHAVE_CONFIG_H -I. -I.. -O3 -Wall -DMODULEDIR=\"/usr/local/lib/polyml/modules\" -O3 -MT arb.lo -MD -MP -MF .deps/arb.Tpo -c -o arb.lo arb.cpp libtool: compile: g++ -DHAVE_CONFIG_H -I. -I.. -O3 -Wall "-DMODULEDIR=\"/usr/local/lib/polyml/modules\"" -O3 -MT arb.lo -MD -MP -MF .deps/arb.Tpo -c arb.cpp -fPIC -DPIC -o .libs/arb.o arb.cpp:87:10: fatal error: globals.h: No such file or directory 87 | #include "globals.h" | ^~~~~~~~~~~ compilation terminated. make[3]: *** [Makefile:800: arb.lo] Error 1 make[3]: Leaving directory '/root/vfpub/polyml-master/libpolyml' make[2]: *** [Makefile:840: all-recursive] Error 1 make[2]: Leaving directory '/root/vfpub/polyml-master/libpolyml' make[1]: *** [Makefile:729: all-recursive] Error 1 make[1]: Leaving directory '/root/vfpub/polyml-master' make: *** [Makefile:488: all] Error 2 --------------------------- Has anyone had luck building on Alpine?

2 1

PolyML REPL
by antonlobach＠uri.edu 17 Oct '20

17 Oct '20

Hi, Does PolyML REPL produce native code or does it work as an interpreter? Regards, Anton Lobach

2 2

polyml sometimes runs out of memory with plenty available
by sorear＠fastmail.com 05 Oct '20

05 Oct '20

Attempting to run the CakeML CI test sequence (a 2-3 day process) on any Poly/ML version newer than 5.7 frequently results in out of memory errors. The probability of any given test failing is low and seems very sensitive to environmental factors, and I am still trying to reliably reproduce the failure in any setting, but I have managed to generate --debug gc --debug heapsize logs from failures (attached). The log file is from v5.8.1 but I have seen the issue on several different HEAD revisions over the past month. The "Run out of store - interrupting threads" message in the middle of a block of GC output makes me suspect a race condition but otherwise I have little to go on here. Any advice would be appreciated. I'll update if I find anything. The machine has 256GB installed and I generally run tests with --maxheap 75000, so a failure with a heap size of only 2GB is quite odd. -s

2 3

Non-blocking sockets
by vijay.the.lisper＠gmail.com 07 Sep '20

07 Sep '20

To use the non-blocking functions like acceptNB and sendVecNB, do I need to explicitly set the socket to non-blocking mode? If that is the case, how can I do it? Are there any documents/examples on how to generally do non-blocking IO in PolyML? Thank you, Vijay

3 2

Updates in master - statistics and support for secure OSs
by David.Matthews＠prolingua.co.uk 11 Aug '20

11 Aug '20

There have been a number of updates in the pipeline that were held off until 5.8.1 was released. I've merged a few into master and there are some more that will come in in due course. Statistics: The statistics have been revisited, particularly the shared statistics. The statistics now include information about garbage-collections and other operations that cause the ML environment to be suspended. Obviously this is only useful if the statistics are being read by another process but the idea is that it would be possible to provide information to a user about why the ML environment is not responding. On Unix Poly/ML only creates the shared memory file for the statistics if --exportstats is given. The file is now created in the directory given in the $POLYSTATSDIR environment variable if that is present, falling back to $HOME/.polyml otherwise. When looking for remote statistics $POLYSTATSDIR is checked first followed by $HOME/.polyml. Secure OSs: There is now support for OpenBSD and SELinux in enforcing mode. There was a problem with these operating systems because they forbid the creation of memory areas with both execute and write permissions. In order to create and garbage collect ML code the RTS needs to be able to write to the code areas and it also needs to be executed. The work-around is to use memory mapped files and create two separate regions mapped to the same file. This is only done if the usual memory allocation with read-write-execute permission fails. I wanted to get this working because I was concerned that at some point more main-stream operating systems, such as Mac OS, might introduce a similar restriction. Note that there is still an issue with text-relocations but this can be got round using either "chcon -t textrel_shlib_t poly" on SELinux or LDFLAGS='-Wl,-z,notext' on OpenBSD. David

2 2

Version 5.8.1 Release
by David.Matthews＠prolingua.co.uk 22 Jul '20

22 Jul '20

After the recent bug fixes I thought it was time to produce a new release. There are very few new features; it's almost all bug fixes. Thanks to everyone for the patches and bug reports. David

3 4

Compiler (0ad5aa87) raises Option
by Michael.Norrish＠data61.csiro.au 10 Jul '20

10 Jul '20

I don't expect this in isolation will help, but the following HOL function causes the compiler to emit a Fail "Exception- Option unexpectedly raised while compiling" message. ?- - - fun EXISTS_SEP_REWRITE_RULE rw th = let (* possibly fragile *) val (p,q) = dest_eq (concl (SPEC_ALL rw)) val frame = genvar(type_of p) val vs = list_dest dest_sep_exists p val lhs = mk_star(last vs,frame) val vs = butlast vs fun find_exists_match lhs tm = let val (v,t) = dest_sep_exists tm val vs = list_dest dest_sep_exists tm in (butlast vs,last vs,generic_star_match [] lhs (last vs)) end fun find_term_and_apply f tm = f (find_term (can f) tm) fun foo th = let val (ws,tm,s) = find_term_and_apply (find_exists_match lhs) (concl th) val (t,t2) = (dest_eq (concl (SPEC_ALL rw))) val zs = list_dest dest_sep_exists t val (zs,z) = (butlast zs,list_dest dest_star (last zs)) val xs = list_dest dest_star tm val ys = filter (fn y => not (tmem y (map (subst s) z))) xs val t3 = foldr mk_sep_exists (subst s (list_mk_star z (type_of frame))) (map (subst s) zs) val goal = foldr mk_sep_exists (list_mk_star (t3::ys) (type_of frame)) ws val goal = mk_eq(foldr mk_sep_exists tm ws,goal) val lemma = auto_prove "EXISTS_SEP_REWRITE_RULE" (goal, SIMP_TAC std_ss [GSYM rw] THEN SIMP_TAC (std_ss++sep_cond_ss) [SEP_CLAUSES] THEN CONV_TAC (BINOP_CONV SEP_EXISTS_AC_CONV) THEN SIMP_TAC (std_ss++star_ss) [AC CONJ_ASSOC CONJ_COMM]) val lemma = CONV_RULE (RAND_CONV (ONCE_REWRITE_CONV [rw] THENC SIMP_CONV std_ss [SEP_CLAUSES])) lemma in foo (RW1 [lemma] th) end handle HOL_ERR _ => th in foo th end; - - - This comes from HOL4's examples/machine-code/hoare-triple/helperLib.sml (line 667 onwards). I will try to reduce it to a smaller instance. Michael

4 8

Horrific GC(?) behaviour in 5.8 (g44efa473)
by Michael.Norrish＠data61.csiro.au 21 Jun '20

21 Jun '20

I have some HOL code that runs to completion in ~24 seconds user time. On 5.7.1 it runs in about that much wall clock time too. (Unfortunately, this test is running on a different machine, necessarily, but this is an old Linux desktop which is far less powerful than the new Macbook Pro which is running 5.8.) On 5.8 (updated for MacOS Catalina to the SHA above), wall clock time is 8 minutes. The relevant code is the selftest in examples/miller/miller which is a big arithmetic normalisation. On the Mac, memory consumption (as reported by the Activity Monitor) gets as high as 20GB; on the Linux machine running 5.7.1, the consumption remains very slight (top reports 3% in its %MEM column; the machine has 16GB) Michael

4 8

GC followup
by Michael.Norrish＠data61.csiro.au 16 Jun '20

16 Jun '20

I instrumented the test regime to flag test cases where the GC time was more than 20% of the ?user time. I ran the same test on Linux 5.7.1 and the Mac Catalina machine. As per screenshot (Linux on left, Mac on right; user times in parentheses, gc times in seconds in red), the 5.8 GC is definitely worse. (I appreciate that occasionally the GC will kick in with "bad" times during a long series of very quick tests; I expect this explains the "bad" time in the Linux series.) I'm using Timer.getCPUTimer to get these measurements, getting nongc.usr and gc.usr. Michael

1 0

Poly/ML software directory
by David.Matthews＠prolingua.co.uk 04 Jun '20

04 Jun '20

After the discussion about a random number library I've been thinking about how to implement a repository or register of similar things. At the moment a repository containing the actual code seems too much but a directory or register looks like it could be useful. I've set up a database and associated web pages for a directory of software for Poly/ML. Rather than maintain all the data myself I'm asking anyone who has a library, application, sample code or anything else to register with the site and add the appropriate entries. As a starting point I've made an entry for the Windows GUI library that is currently included in the Poly/ML distribution but which I've now pulled out into a separate repository on Github. This is a bit of an experiment and I don't know how useful it will turn out to be. The web pages themselves could do with being improved but they should be in a state for beta-testing. I've selected fields based on what I think would be useful but they can always be changed. The web site is at https://www.polyml.org/software/index.php and is linked from the main Poly/ML website at www.polyml.org. Let me know what you think. David

2 3

← Newer
1
2
3
4
5
6
7
8
9
...
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