Poly/ML October 2007

polyml@lists.polyml.org

8 participants
3 discussions

polyml on macbook intel
by cusquinho＠gmail.com 31 Oct '07

31 Oct '07

Hi All, I'm sorry if this is not the proper place to ask, but I'll try to be "short". I've been trying to get Isabelle in my macbook and I've joined their discussion list for support. They told me intel macbooks wont work with the modified polyml_ppc_darwin, and sent me a patch to get it working with Polyml 5.0. I tried both Polyml 5.0 and the one from the top SVN tree, and when I try to compile I get the same error: /bin/sh ../libtool --tag=3DCXX --mode=3Dcompile g++ -DHAVE_CONFIG_H -I. -= I.. -DMACOSX -Wall -I/usr/X11/include -O3 -I/usr/X11/include -MT machoexport.lo -MD -MP -MF .deps/machoexport.Tpo -c -o machoexport.lo machoexport.cpp g++ -DHAVE_CONFIG_H -I. -I.. -DMACOSX -Wall -I/usr/X11/include -O3 -I/usr/X11/include -MT machoexport.lo -MD -MP -MF .deps/machoexport.Tpo -c machoexport.cpp -fno-common -DPIC -o .libs/machoexport.o machoexport.h:49: error: 'uint' has not been declared machoexport.h:49: error: 'uint' has not been declared machoexport.h:49: error: 'uint' has not been declared machoexport.cpp:241: error: 'uint' has not been declared machoexport.cpp:241: error: 'uint' has not been declared machoexport.cpp:241: error: 'uint' has not been declared make[2]: *** [machoexport.lo] Error 1 make[1]: *** [all-recursive] Error 1 make: *** [all] Error 2 sh-3.2# Any idea? thanks, Fernando

4 10

Question about possible compiler optimization
by David.Matthews＠prolingua.co.uk 19 Oct '07

19 Oct '07

Lukas Bulwahn wrote: > I was mistaken that this function is tail recursive. > But I was expecting that the function can be translated to the following > C code (using no stack allocations): > > while (p is not Nil) do > if (value of p == l) then p := p->next; > else break; > od > if (p is Nil) then raise Error... > > So, this program should not allocate any stack. That is a different function. It doesn't return the modified list but merely checks that the item is or is not present. The equivalent, tail-recursive function in ML is: fun test l [] = raise Fail "Not present" | test l (x::xs) = if l = x then () else test l xs; Poly/ML detects this as tail-recursive and turns it into a loop. David

4 11

Question about possible compiler optimization
by bulwahn＠in.tum.de 16 Oct '07

16 Oct '07

Hi all, I use the code export of Isabelle and this will generate (poly)ML source code of the following form: ... fun mem l (x :: xs) = (if ((x : IntInf.int) = l) then xs else let val v = mem l xs; in (x :: v) end) | mem l [] = raise (Fail "Cannot find literal"); ... The function (as many others of that form) can easily be transformed into a tail recursive function. Does PolyML figure out that it is possible to make this function tail-recursive (automatically) by "unfolding the let"? Thanks in advance. Lukas Bulwahn

2 1

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 October 2007