Poly/ML

polyml@lists.polyml.org

2 participants
698 discussions

Questions on the code trees of functors
by xyly781＠gmail.com 14 Sep '10

14 Sep '10

Dear David, I'm trying to understand the IR of functors in Poly/ML, and I got a few questions here: 1. I tried the following example: signature A = sig type element end signature B = sig type element end functor myfctor(s: A) :> B = struct type element = s.element end which corresponds to the following code tree: BLOCK(DECL #1{0 uses} = LAMBDAONLYINLINE( myfctor CL=false CR=0 LEV=0 LOCALS=0 ARGS=G ARGLIVES= RES=G CLOS=() BLOCK(DECL #1{0 uses} = BLOCK(DECL #2{0 uses} = INDIRECT(0, PARAM(0,1)); RECCONSTR(INDIRECT(0, LOCAL(0,2)), POLY_SYS_alloc_store G $(LIT1 G, LIT40 G, POLY_SYS_load_word G $(INDIRECT(1, LOCAL(0,2)) G, LIT0 G) G ), INDIRECT(2, LOCAL(0,2)), INDIRECT(3, LOCAL(0,2)) ) ); BLOCK(RECCONSTR(LOCAL(0,1))) )){LAMBDA}; RECCONSTR(LOCAL(0,1)) ) >From above, I understand that functor is compiled to a lambda expression. But I don't quite see what the body of the lambda expression does. From my understanding, here PARAM(0, 1) refers to the input structure s which is a tuple. However, what does the values of INDIRECT(0, LOCAL(0,2)) INDIRECT(1, LOCAL(0,2)) INDIRECT(2, LOCAL(0,2)) INDIRECT(3, LOCAL(0,2)) represent? For example, from the printing of the IR of a structure whose type is A is the following: > structure foo : A = # struct # type element = int # end; BLOCK(DECL #1{0 uses} = LIT0; RECCONSTR(LOCAL(0,1))) structure foo : A Since the tuple returned in the last statement only contains only one local variable whose value is LIT0, why we could use index 1, 2, 3 above to access other elements in the tuple? And may I also ask you what does the following code in the above codetree do, and why it does that? POLY_SYS_alloc_store G $(LIT1 G, LIT40 G, POLY_SYS_load_word G $(INDIRECT(1, LOCAL(0,2)) G, LIT0 G) G ) 2. Later I tried to add more content which is a type implemented by a list: signature A = sig type element end signature B = sig type element type set end functor myfctor(s: A) :> B = struct type element = s.element type set = element list end The printed codetree looks similar to the one given in 1, except the corresponding IR for type set = element list, which is: DECL #3{0 uses} = BLOCK(RECCONSTR(LIT0, POLY_SYS_alloc_store G $(LIT1 G, LIT40 G, LAMBDA( print-list CL=false CR=0 LEV=0 LOCALS=0 ARGS=G ARGLIVES= RES=G CLOS=() POLY_SYS_load_word G $(GLOBAL (LIT <long>, NIL ) (*GLOBAL*) G, LIT0 G) G $(RECCONSTR(LIT0, LAMBDA( print-element CL=false CR=0 LEV=0 LOCALS=0 ARGS=G ARGLIVES= RES=G CLOS=() POLY_SYS_load_word G $(INDIRECT(1, INDIRECT(0, PARAM(2,1))) G, LIT0 G ) G $(PARAM(0,1) G)){LAMBDA}, INDIRECT(2, INDIRECT(0, PARAM(1,1))), INDIRECT(3, INDIRECT(0, PARAM(1,1))) ) G ) G $(PARAM(0,1) G)){LAMBDA} G ), GLOBAL (FUN "boxed-list", LAMBDAINLINE( boxed-list CL=false CR=0 LEV=0 LOCALS=0 ARGS=G ARGLIVES= RES=G CLOS=() LIT3){LAMBDA} ) (*GLOBAL*){early} G $(RECCONSTR(LIT0, LIT0, INDIRECT(2, INDIRECT(0, PARAM(0,1))), LIT1) G ), GLOBAL (FUN "size-list", LAMBDAINLINE( size-list CL=false CR=0 LEV=0 LOCALS=0 ARGS=G ARGLIVES= RES=G CLOS=() LIT1){LAMBDA} ) (*GLOBAL*){early} G $(RECCONSTR(LIT0, LIT0, LIT0, INDIRECT(3, INDIRECT(0, PARAM(0,1)))) G ) ) ); Here why there are two more functions "size-list" and "boxed-list" appended to the end of code tree? Sorry for making this email too long, and thank you very much for your help! -- Yue

2 1

Pretty-printing of infix constructors
by rda＠lemma-one.com 08 Sep '10

08 Sep '10

I have a small issue with the Poly/ML pretty-printer. If you run: datatype FOO = D of (int * int); infix D; 1 D 2; Poly/ML prints: val it = D (1, 2) : FOO Poly/ML will parse D(1, 2) but only because of a non-standard extension that lets you omit the keyword "op" that the Standard ML definition requires before infix operator names used with ordinary function application syntax. Regards, Rob.

3 3

Names in initial top-level environment
by phil.clayton＠lineone.net 07 Sep '10

07 Sep '10

I've just noticed that the Poly/ML top-level initially has the names it unused bound to (). However unlikely, this could be accidentally exploited resulting in less portable code. Otherwise, all top-level value names are as per http://www.standardml.org/Basis/top-level-chapter.html (I suspect the basis library source just needs a few more 'val ()' bindings.) Phil

2 1

Poly/ML 5.4 Released
by David.Matthews＠prolingua.co.uk 05 Sep '10

05 Sep '10

I've uploaded version 5.4 to SourceForge and updated the web site. Thanks to everyone for your bug reports and comments. David

1 1

Interfaces for printing IR and generated code
by xyly781＠gmail.com 05 Sep '10

05 Sep '10

Dear David, As you mentioned previously, Poly/ML first compiles ML program into the IR, which is further passed to a code generator to produce low level code. I was trying to understand and document the semantics of the opcode set used by Poly/ML's interpreter, and I'm wondering whether inside Poly/ML's compiler, there are such debugging functions which could print out the IR tree as well as the generated op code for an input ML program? These functions would help me a lot to test my understanding on Poly's IR data structure and code generation. Thank you very much! Best, Yue

2 7

function for input from stdin
by johan＠hanwei.xs4all.nl 01 Sep '10

01 Sep '10

Hello, I am trying to learn SML, but drowning in its streams. The following function does what I want in SML/NJ, but not in PolySML. Is the function wrong, but SML/NJ lenient and PolySML not? If the function is wrong, what is the best way to get input from stdin without a newline? fun askName () = let val a = TextIO.inputLine TextIO.stdIn val b = String.translate (fn x => case x of #"\n" => ""|_ => str(x)) in case a of SOME("\n") => NONE | SOME(s) => SOME (b s) | NONE => NONE end Thanks Johan

2 1

function for input from stdin
by jgvdt＠xs4all.nl 01 Sep '10

01 Sep '10

1 0

PolyML memory parameters
by ldixon＠inf.ed.ac.uk 31 Aug '10

31 Aug '10

I have a couple of quick questions, mostly based on observing that http://www.polyml.org/docs/HeapParms9.html could do with being updated. Looking at the poly man page, I feel it is a little brief on the descriptions, these are the questions that came to mind when I was about to explain it to someone else... "man poly" tells me: -H size Set the initial heap size, in MB. --heap size Set the initial heap size, in MB. is this then the same as -H? Given that the heap size is described as being initial, does it increase as PolyML is running? I was under the (probably wrong) impression that PolyML has a fixed heap size. --immutable size Set the size of the immutables buffer, in MB. --mutable size Set the size of the mutables buffer, in MB. Are these limits? Can they be edited while PolyML is running? --timeslice timeslice Set the timeslice. Can someone remind me what this is? I was also curious if there a way to get PolyML to print/edit out it's current memory parameters while it is running? cheers, lucas -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336.

2 1

Source code overview
by David.Matthews＠prolingua.co.uk 25 Aug '10

25 Aug '10

Following a suggestion from Lucas I've gone through the Poly/ML source code and produced an overview that describes where each file fits into the overall structure. It still needs work both on the text and on the layout but at least it's a start. It's in the documentation directory in SVN as documentation/Overview.html and on the web site as http://www.polyml.org/docs/Overview.html . Comments welcome and if anyone with experience with style sheets wants to improve the appearance I'd be happy to include the changes. Ultimately it would be nice to be able to make use of some sort of integrated source/documentation system such as doxygen. David

1 0

Poly/ML 5.4
by David.Matthews＠prolingua.co.uk 23 Aug '10

23 Aug '10

I'm planning to release Poly/ML 5.4 by the end of this month unless there are any show-stoppers. I've had a couple of bug reports from Phil Clayton and fixed those. I've also fixed a few minor bugs so that it will build on the PowerPC and Sparc. Now is the time to check that your software will run in the current version and let me know if there are problems. Don't forget to run make compiler twice to build the current version (SVN 1189). David

4 15

← Newer
1
...
41
42
43
44
45
46
47
...
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