Poly/ML March 2013

polyml@lists.polyml.org

7 participants
6 discussions

Inspecting structures
by ramana.kumar＠gmail.com 27 Jan '16

27 Jan '16

Is there a way to look at the contents (i.e. signature) of a structure without opening it? (I suppose you could just open it then call a lot of PolyML.Compiler.forgetXXX, but that's quite tedious) Also, is it possible to retrieve the long path of an identifier in scope? Something that will, for example, take the rev in scope and say that it came from List. Finally, what about searching for an identifier that would come into scope if you opened some structures?

3 5

[Fwd: Re: [polyml] Building Poly/ML on MacOS X 10.6]
by rda＠lemma-one.com 29 Dec '14

29 Dec '14

I wrote: > I am completely baffled. I thought I hada solved all my problems on > MacOS X > 10.6 and was just tidying up, when I had to recompile a 32 bit > version of > Poly/ML to test a tidied up make file. This failed because > PolyML.Compiler.printTypesWithStructureName no longer exists. The same > problem happened when i rebuild a 64 bit version. What has happened? but it was a false alarm: my make file was wrong for other reasons and the absence of PolyML.Compiler.printTypesWithStructureName was not relevant. No doubt there are good reasons why this variable has been withdrawn. Regards, Rob.

3 6

Sourceforge and SVN
by David.Matthews＠prolingua.co.uk 24 Jun '13

24 Jun '13

I have "upgraded" the Poly/ML site on SourceForge (there didn't seem to be any choice) and as a consequence the subversion site has changed. Anyone who is following Poly/ML SVN will need to change to the new site. For trunk this is svn checkout svn://svn.code.sf.net/p/polyml/code/trunk polyml and for the 5.5 fixes branch svn co svn://svn.code.sf.net/p/polyml/code/fixes-5.5 polyml I am currently working on the stages of the compiler that process and optimise the intermediate code. These are parts of the compiler that haven't been looked at for a very long time and some of it was obviously translated automatically from my original Poly code back in the 1980s. I tend to commit changes fairly regularly rather than accumulate a long set of changes and commit all at once. This does mean that things could be broken and only fixed by a later commit but it makes it much easier to find a bug if it shows up much later. Season's greetings and best wishes for the New Year, David

3 5

suppressing compiler output
by gbuday＠gmail.com 18 Apr '13

18 Apr '13

Hi, I would like to feed an sml program into poly from standard input: $ cat hello.sml |poly Poly/ML 5.4.1 Release > # Hello World!val it = (): unit Is it possible to use this so that the compiler itself does not print anything? I have found poly -q which does not print the release message but that still prints all the rest. - Gergely

11 41

Heap does not grow up to --maxheap
by cezary.kaliszyk＠uibk.ac.at 26 Mar '13

26 Mar '13

Dear all, I have a PolyML program (below), for which maxheap is ignored: The heap is kept at the minheap size and does not grow automatically. For the three runs below the maxheap is set to the same amount (4GB): If I run: polyml --maxheap 4G --gcthreads 1 --minheap 4G < polybug.ml Terminates in less than 1 sec. If I run: polyml --maxheap 4G --gcthreads 1 --minheap 500M < polybug.ml It does not terminate (at least not in 15 minutes) If I run: polyml --maxheap 4G --gcthreads 1 --minheap 50M < polybug.ml I get 'Run out of store' exception. Does the heap not grow automatically up to maxheap? Is there a way to make PolyML automatically adjust the heap size? Tested both with 64bit polyml-5.5.0 (from Isabelle2013). And with current repository version (r1702). Regards, Cezary -- datatype tree = Node of tree * tree | Leaf of int; fun go acc (Leaf _) = acc + 1 | go acc (Node (l, r)) = go (go (acc + 1) l) r; fun size t = go 0 t; fun build i j = if i <= 0 then Leaf j else Node (build (i-1) (2*j), build (i-2) (2*j+1)); val tim = ref (Timer.startRealTimer ()); fun tim_start () = tim := Timer.startRealTimer (); fun tim_print () = print (Time.toString (Timer.checkRealTimer (!tim)) ^ "\n"); val t = build 0 0; val al = 10000000; val a = Array.array (al, t); tim_start (); fun irep i = if i = al then tim_print () else let val _ = Array.update (a,i,build 0 i) in irep (i + 1) end; irep 0; irep 0; irep 0; irep 0; irep 0; -- Cezary Kaliszyk, University of Innsbruck, http://cl-informatik.uibk.ac.at/~cek/

2 2

Trends in Functional Programming 2013: 3rd Call for Papers
by jay.mccarthy＠gmail.com 06 Mar '13

06 Mar '13

CALL FOR PAPERS 14th International Symposium Trends in Functional Programming 2013 Brigham Young University, Utah, U.S.A. May 14-16, 2013 http://faculty.cs.byu.edu/~jay/conferences/2013-tfp/ The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions (see below), described in draft papers submitted prior to the symposium. A formal post-symposium refereeing process then selects a subset of the articles presented at the symposium and submitted for formal publication. Selected papers will be published as a Springer Lecture Notes in Computer Science (LNCS: http://www.springer.com/lncs) volume. TFP 2013 will be the main event of a pair of functional programming events at Brigham Young University. First will be the International Workshop on Trends in Functional Programming in Education and then TFP. The TFP symposium is the heir of the successful series of Scottish Functional Programming Workshops. Previous TFP symposia were held in Edinburgh (Scotland) in 2003, in Munich (Germany) in 2004, in Tallinn (Estonia) in 2005, in Nottingham (UK) in 2006, in New York (USA) in 2007, in Nijmegen (The Netherlands) in 2008, in Komarno (Slovakia) in 2009, in Oklahoma (USA) in 2010, in Madrid (Spain) in 2011, and in St. Andrews (UK) in 2012. For further general information about TFP please see the TFP homepage at http://www.tifp.org/. SCOPE OF THE SYMPOSIUM The symposium recognises that new trends may arise through various routes. As part of the symposium's focus on trends we therefore identify the following five article categories. High-quality articles are solicited in any of these categories: Research Articles: leading-edge, previously unpublished research work Position Articles: on what new trends should or should not be Project Articles: descriptions of recently started new projects Evaluation Articles: what lessons can be drawn from a finished project Overview Articles: summarising work with respect to a trendy subject Articles must be original and not submitted for simultaneous publication to any other forum. They may consider any aspect of functional programming: theoretical, implementation-oriented, or more experience oriented. Applications of functional programming techniques to other languages are also within the scope of the symposium. Articles on the following subject areas are particularly welcome: . Functional programming and multicore/manycore computing . Functional programming in the cloud . Functional programming in education . High performance functional computing . Extra-functional (behavioural) properties of functional programs . Dependently typed functional programming . Validation and verification of functional programs . Using functional techniques to verify/reason about imperative/object-oriented programs . Debugging for functional languages . Functional programming in different application areas: security, mobility, telecommunications applications, embedded systems, global computing, grids, etc. . Interoperability with imperative programming languages . Novel memory management techniques . Program transformation techniques . Empirical performance studies . Abstract/virtual machines and compilers for functional languages . New implementation strategies . Any new emerging trend in the functional programming area If you are in doubt on whether your article is within the scope of TFP, please contact the TFP 2013 program chair, Jay McCarthy, at tfp2013 at easychair.org BEST STUDENT PAPER AWARD TFP traditionally pays special attention to research students, acknowledging that students are almost by definition part of new subject trends. A student paper is one for which the authors state that the paper is mainly the work of students, the students are listed as first authors, and a student would present the paper. A prize for the best student paper is awarded each year. SUBMISSION AND DRAFT PROCEEDINGS Acceptance of papers for presentation at the symposium is based on a lightweight screening process of extended abstracts (2 to 10 pages in length) or full papers (max 16 pages). Accepted abstracts are to be completed to full papers before the symposium for publication in the draft proceedings. Latex style files are available from Springer's web page (llncs2e.zip), and are linked below. The submission must clearly indicate which category it belongs to: research, position, project, evaluation, or overview paper. It should also indicate whether the main author or authors are research students. Formatting details can be found at the TFP 2013 website. Paper submission is done through TFP13's EasyChair page: https://www.easychair.org/conferences/?conf=tfp2013 Important dates (2013): Full papers/extended abstracts submission: March 2nd to April 2nd, 2013 Notification of acceptance for presentation: Submission + one week Early registration deadline: Tuesday, April 16th, 2013 Late registration deadline: Tuesday, May 14th, 2013 Camera ready for draft proceeding: Monday, April 29th, 2013 The papers of the local proceedings will also be made available on-line under some copyright conditions, with which all authors are asked to agree. POST-SYMPOSIUM REFEREEING AND PUBLICATION In addition to the symposium draft proceedings, we will continue the previous years' decision of publishing a high-quality subset of contributions in the Springer Lecture Notes in Computer Science (LNCS) series. Proceedings of the last three instances of TFP have been published as LNCS 6546 (TFP10), LNCS 7193 (TFP11), and LNCS TBA (TFP12). All TFP authors will be invited to submit revised papers after the symposium. These will be refereed using normal conference standards and a subset of the submitted papers, over all categories, will be selected for publication. Papers will be judged on their contribution to the research area with appropriate criteria applied to each category of paper. Student papers will be given extra feedback by the Program Committee in order to assist those unfamiliar with the publication process and to help in improving the quality of the paper. Important dates (2013): TFP 2013 Symposium: Tuesday, May 14th, 2013 -- Thursday May 16, 2013 Student papers feedback: Friday, May 24th, 2013 Submission for formal review: Friday, June 21st, 2013 Notification of acceptance for LNCS: Friday, August 30th, 2013 Camera ready paper: Friday, September 27th, 2013 REGISTRATION Registration for TFP13, as well as the adjoined workshops, is handled through the on-line registration page below. Note that for guaranteed on-site accommodation, registration must be completed by the early registration deadline. http://ce.byu.edu/cw/tfp/ TFP 2013 ORGANIZATION Steering Committee Chair: Marko van Eekelen, Radboud University Nijmegen and Open University, NL Steering Committee Treasurer: Hans-Wolfgang Loidl, Heriot-Watt University, UK Steering Committee Secretary: Marco T. Moraz?n, Seton Hall University, New Jersey, U.S.A. Symposium Organization Chair: Jay McCarthy, Brigham Young University, Utah, U.S.A Local Arrangements: Jay McCarthy, Brigham Young University, Utah, U.S.A TFP 2013 PROGRAMME COMMITTEE Chair: Jay McCarthy from Brigham Young University Andy Gill from the University of Kansas Arjun Guha from Cornell University Clara Segura from Complutense University of Madrid Henrik Nilsson from University of Nottingham James Caldwell from the University of Wyoming John Clements from California Polytechnic State University Jurriaan Hage from Universiteit Utrecht Keiko Nakata from Institute of Cybernetics at Tallinn University of Technology Marko van Eekelen from Open University of the Netherlands and Radboud University Nijmegen Nikhil Swamy from Microsoft Research Rita Loogen from Philipps-Universit?t Marburg Sergio Antoy from Portland State University Suresh Jagannathan from Purdue University Tom Schrijvers from Ghent University Vikt?ria Zs?k from E?tv?s Lor?nd University, Budapest Wolfgang De Meuter from Vrije Universiteit Brussel SPONSORS TFP 2013 is sponsored by the Brigham Young University Computer Science department. INVITED SPEAKER In this instance of TFP, an invited talk will be given by Jeremy Siek, Assistant Professor at University of Colorado at Boulder. Prof Siek will be talking on the gradual typing approach to mixing static and dynamic typing. LINKS Main TFP13 page: http://faculty.cs.byu.edu/~jay/conferences/2013-tfp/ TFP home page: http://www.tifp.org/ Submission page: https://www.easychair.org/conferences/?conf=tfp2013 Latex style files: ftp://ftp.springer.de/pub/tex/latex/llncs/latex2e/llncs2e.zip Registration page: http://ce.byu.edu/cw/tfp/ -- Jay McCarthy <jay(a)cs.byu.edu> Assistant Professor / Brigham Young University http://faculty.cs.byu.edu/~jay "The glory of God is Intelligence" - D&C 93

1 0

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 March 2013