Poly/ML

polyml@lists.polyml.org

704 discussions

Memory leak? Poly/ML SVN 1307
by aleks0＠gmail.com 07 Jun '11

07 Jun '11

I've just updated to the latest SVN of poly, and my compile times have ballooned up. Prodding it a bit, it looks to me like there's a memory leak in the interpreter. Here's what I do to get it to happen: 1. Fire up poly and load a modest heap (59 megs) containing about 100 structures and functors. top shows poly's RAM usage goes to a little over 59 megs. 2. Run some pretty functor-heavy code, including some code that looks (essentially) like this: structure Structure1 = Functor1(....); structure Structure2 = Functor2(structure Foo = Structure1); structure Structure3 = struct open Structure1; Structure2; end structure Structure4 = Structure3 : SIG Admittedly, these are some pretty big structs, and poly's RAM usage hits over a gig, and doesn't go back down once execution is finished. "PolyML.fullGC ();" seems to have no effect. 3. Save the heap, still < 70 megs. 4. Close and open poly w new heap, RAM usage still < 70 megs So, the compile-time slowness seems to be poly filling the system's RAM and starts swapping pages. I included the code above on the off chance there's some cyclic dependency between the structs that keeps some junk from being garbage collected. I can give SVN links if you want to see the offending code itself, but its part of a pretty large project, so I don't know how helpful that would be. Thanks! Aleks

2 1

Re: [MLton] bug to do with as-binding masking datatype constructor name
by matthew.fluet＠gmail.com 13 Apr '11

13 Apr '11

On Wed, Apr 13, 2011 at 2:49 AM, Andreas Rossberg <rossberg(a)mpi-sws.org> wrote: > On Apr 13, 2011, at 01:49, Michael Norrish wrote: >> >> Poly 5.3 rejects >> >> ?datatype foo = bar of string >> >> ?fun f x = let >> ? val bar as y = 3 >> ?in >> ? bar + x >> ?end >> >> MLton 20091212~svn accepts it. >> >> Who's right? > > Mlton, although this is arguably a design bug of the language. I was going to conclude that Poly/ML is right. I don't see why rule (43) applies to the "bar as y" pattern; it is not the case that "bar \notin Dom(C)" (because "bar" is in scope) and it is not the case that "is of C(vid) = v" (because "bar" has constructor status). MLton omits those two antecedents in its implementation of "as"-pattern elaboration. (Similarly, HaMLet omits them.) On the other hand, "val rec bar as y = fn() => 3" would allow changing the identifier status of "bar" (rule (26) and comment).

1 1

bug to do with as-binding masking datatype constructor name
by Michael.Norrish＠nicta.com.au 13 Apr '11

13 Apr '11

Poly 5.3 rejects datatype foo = bar of string fun f x = let val bar as y = 3 in bar + x end MLton 20091212~svn accepts it. Who's right? Best, Michael

1 0

Fwd: creating heterogeneous array in the Poly/ML codetree
by yli＠cse.tamu.edu 15 Mar '11

15 Mar '11

To the list. -------- Original Message -------- Subject: creating heterogeneous array in the Poly/ML codetree Date: Thu, 10 Mar 2011 16:07:50 -0600 From: Yue Li <yli(a)cse.tamu.edu> Organization: CSE Department, Texas A&M To: David Matthews <David.Matthews(a)prolingua.co.uk> CC: Gabriel Dos Reis <gdr(a)cs.tamu.edu> Dear David, Is there any way to create a heterogeneous array in the Poly/ML codetree with known size, but whose elements can be values of any type and I don't necessarily want to use ML-style datatype. For instance, elements in the array can be integer values, or function values or arrays? Best, Yue

4 4

Re: creating heterogeneous array in the Poly/ML codetree
by David.Matthews＠prolingua.co.uk 12 Mar '11

12 Mar '11

This sounds like an ML tuple but tuples are always immutable i.e. the fields cannot be updated. In ML "array" is used for an updatable data-structure. Is that what you mean? By "known size" do you mean a size specified at compile-time? Are the index values always compile-time constants or can they be calculated at run-time? Regards, David On 10/03/2011 22:07, Yue Li wrote: > Dear David, > > Is there any way to create a heterogeneous array in the Poly/ML codetree > with known size, but whose elements can be values of any type and I don't > necessarily want to use ML-style datatype. For instance, elements in the > array can be integer values, or function values or arrays? > > Best, > > > Yue

1 0

Infinite loop when forcing GC after creating a weak pointer
by ivan.tomac＠gmail.com 03 Mar '11

03 Mar '11

Entering this from the REPL appears to make Poly/ML go into an infinite loop: $ rlwrap poly Poly/ML 5.4 Release > val w = let val x = SOME (ref 3) in Weak.weak x end; val w = ref (SOME (ref 3)): int ref option ref > PolyML.fullGC ();

2 1

Poly/ML codetree generation
by yli＠cse.tamu.edu 01 Mar '11

01 Mar '11

Dear David, So far I've been able to generate Poly/ML style codetree for a subset of Spad language used in OpenAxiom. The codetree is written into a text file. As an example, for the following spad function: foo (a : Integer) : Integer == a := a + 1 a I currently generate the following intermediate code: DECL #1{0 uses} = LAMBDA( foo(2) CL=false CR=0 LEV=0 LOCALS=0 ARGS=G ARGLIVES= RES=G CLOS=() BLOCK(BLOCK(DECL #2{0 uses} = RECCONSTR(PARAM(0,1), PARAM(0,2)); BLOCK(DECL #3{0 uses} = GLOBAL (FUN "run_call2(1)", LAMBDAINLINE( runcall2(1) CL=false CR=0 LEV=0 LOCALS=0 ARGS=G ARGLIVES= RES=G CLOS=() LOCAL(1,1) G $(INDIRECT(0, PARAM(0,1)) G, INDIRECT(1, PARAM(0,1)) G)){LAMBDA} ) (*GLOBAL*){early} G $(INDIRECT(0, LOCAL(0, 2)), LIT1 G); DECL #4{0 uses} = LOCAL(0, 3); LOCAL(0, 4) ) ) )){LAMBDA}" I also wrote a ML library which reads in and parses the codetree string. Does my current approach look sensible to you? What would you suggest if improvements are needed? I'm thinking that the next step for me is to call Poly/ML middle functions that would take the codetree and evaluate the entire codetree for a Spad function (and then hopefully a Spad domain.) I've read the code and the documentation in the codetree source code files. Is there any way for me to call the codetree functions as a library in my ML code? Thanks, Yue

2 4

Type abbreviations and pretty-printing of function types
by rda＠lemma-one.com 24 Feb '11

24 Feb '11

In the following, the result type of the function add_abs gets printed out as {a : int, b : string} rather than as AB: type AB = {a : int, b : string}; fun add_abs ({a = a1, b = b1} : AB) ({a = a2, b = b2} : AB) : AB = ( {a = a1 + a2, b = b1 ^ b2} ); structure S1 = struct type AB = {a : int, b : string}; fun add_abs ({a = a1, b = b1} : AB) ({a = a2, b = b2} : AB) : AB = ( {a = a1 + a2, b = b1 ^ b2} ); end; open S1; To get it to print as AB, you have to do something like the following: val (add_abs : AB -> AB -> AB) = fn {a = a1, b = b1} => fn {a = a2, b = b2} => {a = a1 + a2, b = b1 ^ b2}; (which generates less efficient code, doesn't it?), or: signature S2 = sig type AB = {a : int, b : string}; val add_abs : AB -> AB -> AB; end; structure S2 : S2 = S1; This can be quite distracting if you have a structure type with lots of fields or some other complex type with a familiar name (like the type of tactics in an LCF-style theorem-prover). Regards, Rob.

1 0

InternalError: jump too large raised while compiling
by David.Matthews＠prolingua.co.uk 21 Feb '11

21 Feb '11

Thanks. That enabled me to see what was going wrong. I've committed a fix to SVN and the file compiles, at least as far as complaining about some missing declarations, on X86-32 and X86-64. You will need to run make compiler if you want to use the SVN version. Regards, David On 21/02/2011 06:55, Andreas Lochbihler wrote: > Dear David, > > please find attached the ML file that reproduces the error. I ran > Poly/ML on x86, Ubuntu GNU/LInux, both 32-bit and 64-bit. > > Andreas

1 0

Building MS Windows applications
by rda＠lemma-one.com 19 Feb '11

19 Feb '11

I have installed Poly/ML on MS Windows using the precompiled binary. Now I want to start building my own applications. What do I need for the equivalent in MS Windows of the following command line that I would use on UNIX? cc -o hello hello.o -lpolymain -lpolyml I.e., where do I find the polymain and polyml DLLs and what developer kits can I use? E.g., will MinGW work? And which developer kits are recommended? Regards, Rob.

2 4

← Newer
1
...
39
40
41
42
43
44
45
...
71
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