Poly/ML June 2010

polyml@lists.polyml.org

7 participants
9 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

Workshop on ML 2010 - Extended Submission Deadline
by matthew.fluet＠gmail.com 25 Jun '10

25 Jun '10

In response to requests, the submission deadline has been extended by one week until 2 July 2010. The 2010 ACM SIGPLAN Workshop on ML http://www.cs.rit.edu/~mtf/ml2010 Baltimore, Maryland, United States Sunday, September 26, 2010 co-located with ICFP 2010 Call for Content (Extended Deadline) ML is a family of programming languages that includes dialects known as Standard ML, Objective Caml, and F#. The development of these languages has inspired a large amount of computer science research, both practical and theoretical. This workshop aims to provide a forum to encourage discussion and research on ML and related technology (higher-order, typed, or strict languages). The format of the 2010 Workshop on ML will be different than that of recent years, returning to a more informal model: a workshop with presentations selected from submitted abstracts but without published proceedings. We hope that this format will encourage the presentation of more exciting (if unpolished) research and deliver a more lively workshop atmosphere. Invited Speaker ~~~~~~~~~~~~~~~ Luke Hoban (Microsoft) -- Bringing F# to Visual Studio 2010 Important Dates ~~~~~~~~~~~~~~~ Submission: 2 July, 2010 (extended) Notification: 9 August, 2010 Format ~~~~~~ The workshop will consist of presentations by the participants, selected from submitted abstracts. Participants are invited to submit working drafts, source code, and/or extended abstracts for distribution on the workshop homepage and to the attendees, but as the workshop will have no formal proceedings, any contributions may be submitted for publication to other venues. (See the SIGPLAN republication policy for more details.) Scope ~~~~~ We primarily seek research presentations on topics related to ML, including (but not limited to): * applications: case studies, experience reports, pearls, etc. * extensions: higher forms of polymorphism, generic programming, objects, concurrency, distribution and mobility, semi-structured data handling, etc. * type systems: inference, effects, overloading, modules, contracts, specifications and assertions, dynamic typing, error reporting, etc. * implementation: compilers, interpreters, type checkers, partial evaluators, runtime systems, garbage collectors, etc. * environments: libraries, tools, editors, debuggers, cross-language interoperability, functional data structures, etc. * semantics: operational, denotational, program equivalence, parametricity, mechanization, etc. Research presentations should describe new ideas, experimental results, significant advances in ML-related projects, or informed positions regarding proposals for next-generation ML-style languages. We especially encourage presentations that describe work in progress, that outline a future research agenda, or that encourage lively discussion. In addition to research presentations, we seek both Status Reports and Demos that emphasize the practical application of ML research and technology. Status Reports: Status reports are intended as a way of informing others in the ML community about the status of ML-related research or implementation projects, as well as communicating insights gained from such projects. Status reports need not present original research, but should deliver new information. In the abstract submission, describe the project and the specific technical content to be presented. Demos: Live demonstrations or tutorials are intended to show new developments, interesting prototypes, or work in progress, in the form of tools, libraries, or application software built on or related to ML technology. In the abstract submission (which need only be about half a page), describe the demo and its technical content, and be sure to include the demo's title, authors, collaborators, references, and acknowledgments. A demonstration should take 10-15 minutes. The exact time per demo will be decided based on the number of accepted submissions. (Please note that you will need to provide all the hardware and software required for your demo; the workshop organizers are only able provide a projector.) Submission Guidelines and Instructions ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Email submissions to mtf AT cs.rit.edu. Submissions should be at most two pages, in PDF format, and printable on US Letter or A4 sized paper. Persons for whom this poses a hardship should contact the program chair. Submissions longer than a half a page should include a paragraph synopsis suitable for inclusion in the workshop program. Program Chair ~~~~~~~~~~~~~ Matthew Fluet Rochester Institute of Technology Program Committee ~~~~~~~~~~~~~~~~~ Kathleen Fisher AT&T Labs Research Adam Granicz IntelliFactory Daan Leijen Microsoft Research Johan Nordlander Lulea University of Technology Sungwoo Park Pohang University of Science and Technology Daniel Spoonhower Google

1 0

Pretty printing singleton tuples
by phil.clayton＠lineone.net 14 Jun '10

14 Jun '10

I've just noticed that singleton tuples don't seem to be pretty printed as valid SML: Poly/ML 5.4 Experimental > {1 = true}; val it = (true): {1: bool} Presumably this should say: val it = {1 = true}: {1: bool} Phil

2 1

SML systems disagreeing on Date.localOffset
by Michael.Norrish＠nicta.com.au 10 Jun '10

10 Jun '10

My machine is Linux michaeln-desktop 2.6.31-22-generic #60-Ubuntu SMP Thu May 27 00:22:23 UTC 2010 i686 GNU/Linux Consider: print (Time.toString (Date.localOffset()) ^ "\n") poly (5.3) gives: ~36000.000 (-10 hours) Moscow ML (2.01) gives: 50400.000 (+14 hours) mlton (20070826) gives: 50400.000 sml/nj (v110.69) gives ~36000.000 Local time (Australian east coast in cold, cold winter) is 10 hours ahead of UTC. The Basis says: The offset from UTC for the local time zone. (Moscow ML's behaviour is consistent with its own documentation, but it doesn't pretend to implement Basis 2002.) It seems to me that the answer should actually be +10 hours, because that is what you add to UTC to get *from* UTC to my local time. Note that the Basis documentation for interpreting the offset field in the record passed to the Date.date function is a whole other story. (I don't know who/what to write to for SML/NJ.) Michael.

2 1

Date.fromTimeLocal off by a day
by Michael.Norrish＠nicta.com.au 09 Jun '10

09 Jun '10

On Linux: Linux michaeln-desktop 2.6.31-22-generic #60-Ubuntu SMP Thu May 27 00:22:23 UTC 2010 i686 GNU/Linux -- michaeln(~) date -R Wed, 09 Jun 2010 09:39:11 +1000 michaeln(~) poly Poly/ML 5.3 Release > Date.toString (Date.fromTimeLocal (Time.now())); val it = "Tue Jun 08 09:39:38 2010" : string > Date.toString (Date.fromTimeUniv (Time.now())); val it = "Tue Jun 08 23:41:21 2010" : string -- Michael

2 1

PASCO 2010: Call for Participation
by Daniel.Cordeiro＠imag.fr 07 Jun '10

07 Jun '10

------------------------------------------------------------------------ CALL FOR PARTICIPATION PASCO 2010 International Workshop on Parallel Symbolic Computation 2010 Grenoble University, INRIA and CNRS Grenoble, France, July 21-23, 2010 http://pasco2010.imag.fr/ ------------------------------------------------------------------------ The "2010 International Workshop on Parallel and Symbolic Computation" (PASCO) is the 4th meeting in a series of workshops dedicated to the promotion and advancement of parallel algorithms and software in all areas of symbolic mathematical computation. Following previous editions, PASCO 2010 will have presentations of accepted research papers and extended abstracts, invited talks, tutorial courses. Moreover, a programming contest will take place during the conference. * PASCO 2010 on-line registration is now available at http://pasco2010.imag.fr/ Early Registration (by June 30th) ACM/SIGSAM Members 190 EUR Non-ACM/SIGSAM Members 210 EUR Students 60 EUR Late and On-Site Registration ACM/SIGSAM Members 230 EUR Non-ACM/SIGSAM Members 250 EUR Students 90 EUR * Invited Lectures Christian Bertin (ST) & Claude-Pierre Jeannerod, (INRIA), France. Techniques and tools for implementing IEEE 754 floating-point arithmetic on VLIW integer processors. Erich L. Kaltofen , North Carolina State University, USA. 15 years after DSC and WLSS2: what parallel computations I do today. Stephen T. Lewin-Berlin, Quanta Research Cambridge, USA. Exploiting Multicore Systems with Cilk * Tutorials Jeremy Johnson , Drexel University, USA. Automatic Performance Tuning. Daniel Kunkle , Northeastern University, USA. Roomy: A System for Space Limited Computations. * Organization General co-Chairs: Marc Moreno-Maza, University of Western Ontario, Canada and Jean-Louis Roch, Grenoble University, France. Local Arrangement Chairs: Jean-Guillaume Dumas, Grenoble University, France and Thierry Gautier, INRIA, France and Clement Pernet, Grenoble University, France. Administration Chair: Daniele Herzog, INRIA France. Publicity Chair: Daniel Cordeiro, Grenoble University, France. ------------------------------------------------------------------------

1 0

configure script problem on OS X
by philip.weaver＠gmail.com 06 Jun '10

06 Jun '10

Hello. I have noticed that the configure script fails if the CXX environment variable is set on OS X. The error message is (when CXX=/usr/bin/c++): checking for /usr/bin/c++... no configure: error: No C++ compiler found. Unable to build Poly/ML. This happens when CXX is set to any valid CPP compiler. I'm pretty sure it's not user error. The configure script works fine if CXX is unset or if I bypass the check by setting check_cpp=yes, as in the following example: check_cpp=yes CXX=/usr/bin/c++ ./configure I have confirmed that this happens on at least one other colleague's OS X machine. We both have 10.6 Snow Leopard. I have checked both the 5.3 release and the latest commit in SVN, and both of them display this problem. Has anyone else encountered this problem? On other operating systems besides OS X? Thanks - Philip

2 3

Release of version 0.5 of the ULTRA type error slicer for SML
by vincent.rahli＠gmail.com 04 Jun '10

04 Jun '10

We are happy to announce the release of the version 0.5 of our type error slicing software for the SML programming language. Major improvements over the previous release: * Handling of the SML 'open' feature. * Handling of the SML datatype replication feature. * Type error slices can now be displayed in a terminal window or in a web browser. * We supply Ubuntu and Fedora packages. Other less important improvement is: * We improved our minimisation algorithm. Even more changes are documented in the ChangeLog file. The aim of our type error slicer is to provide useful type error reports for pieces of code written in SML: * It identifies all of the program points that contribute to a type error, including the spot with the actual programming error that caused the type error. * It highlights these program points in the original, unchanged source code. * It avoids showing internal details of the operation of the type inference machinery. New Ubuntu (Debian based) and Fedora (Red-Hat based) packages of our type error slicer can be found at this URL: http://www.macs.hw.ac.uk/ultra/compositional-analysis/type-error-slicing/ We will also shortly release a plain archive of our type error slicer. At the time of the release of version 0.4, we forgot to update the web demo. We have now updated our web demo from version 0.3 to version 0.5. Known limitations: * We have not yet built the software for other operating systems than Linux. * The currently supported user interfaces are via a terminal window, GNU Emacs (or our web demo). We are currently developing a Vim interface. * Some type errors are not yet discovered (the user will need to rely on their usual type checker in these cases). Notable spots where the implementation is incomplete are functors (you can work around this by including signatures on functor applications), equality types. * Concerning fixity declarations, programs are parsed as though the declarations were not there, which gives wrong results. * We don't yet handle overloaded constants (for example 1 is always of type int). * The details of the SML basis library are incomplete (fortunately the user can add any additional details they are using). * The software does not currently scale well to very large programs (we are still improving this). It is currently suitable for small programs and use in teaching. * We do not report free identifiers anymore. * We have some known issues ';' that can lead to incorrect constraint generations and so to wrong type error messages. We are currently working on a new version of the slicer that will fix this issue. Best wishes, Vincent Rahli and Joe Wells

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 June 2010