Poly/ML August 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

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

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

ULTRA type error slicer for SML: version 0.6 and TECHNICAL REPORT
by vincent.rahli＠gmail.com 19 Aug '10

19 Aug '10

We are happy to announce the release of two things: * Technical report HW-MACS-TR-0079 "A constraint system for a SML type error slicer" which explains how our type error slicing software works. * The new version 0.6 of our type error slicing software for the SML programming language. The abstract of the technical report is: Existing compilers for many languages have confusing type error messages. Type error slicing (TES) helps the programmer by isolating the part of a program contributing to a type error, but unfortunately TES was initially done for a tiny toy language. Extending TES to a full programming language is extremely challenging, and for SML we needed a number of innovations and generalisations. Some issues would be faced for any language, and some are SML-specific but representative of the complexity of language-specific issues likely to be faced for other languages. We solve both kinds of issues and present a simple, general constraint system for providing type error slices for ill-typed programs. Our constraint system elegantly and efficiently handles features like the intricate "open" SML feature. We show how the simple clarity of type error slices can demystify language features known to confuse users. We also provide in an appendix a case study on how to use TES to help modifying user data types, and extend the core language presented in the main body of this report to handle more of the implementation of our system. These extensions allow handling local declarations, type declarations and some uses of signatures. Regarding the software, major improvements over the previous release include: * The slicer is 10 to 100 times faster in many cases, and can reasonably be used on programs containing 10 thousand lines of code. * We support some uses of functors (that is, we report some type errors involving functors). * We report more kinds of errors and the error messages have been improved. * We provide a source archive (that is, a .tar.gz file which you unpack and run ?./configure; make; make install? in the unpacked directory). Other less important improvement is: * The slicer now quickly sends non-minimal error slices to the user interface and then sends a minimal replacement error slice after doing more time-consuming work. * We partially support fixity declarations in that we parse and type check programs using them correctly. Highlighting of infix declarations and identifiers in error slices is not yet correct. 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. A new source archive and 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/ The technical report can be found at this URL: http://www.macs.hw.ac.uk:8080/techreps/view_record.jsp?id=0079 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 equality types and sharing constraints. * The details of the SML basis library are incomplete (fortunately the user can add any additional details they are using). Best wishes, Vincent Rahli and Joe Wells

1 0

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

14 Aug '10

There was an error in the default handler that is supposed to kill a thread that raises an uncaught exception. Now fixed. David Ramana Kumar wrote: > This code segfaults in 5.4 but runs fine in 5.3: > > open Thread Unix > val tail = ref (execute("/usr/bin/env",["sleep","0"])) > fun stopTail () = (kill(!tail,Posix.Signal.term); reap (!tail); ()) > fun restartTail () = (stopTail() handle OS.SysErr _ => ()) > val () = Thread.interrupt (Thread.fork(restartTail,[])) > > On Fri, Aug 13, 2010 at 1:36 AM, David Matthews > <David.Matthews(a)prolingua.co.uk> wrote: >> 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 >> >> _______________________________________________ >> polyml mailing list >> polyml(a)inf.ed.ac.uk >> http://lists.inf.ed.ac.uk/mailman/listinfo/polyml >>

1 0

Workshop on ML 2010 - Call for Participation
by matthew.fluet＠gmail.com 10 Aug '10

10 Aug '10

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 Participation 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 Program ~~~~~~~ 9:00 Invited Talk Visual F#: Bringing F# to Visual Studio 2010 Luke Hoban (Microsoft Research) 10:00 Break 10:30 Probabilistic programming using first-class stores and first-class continuations Oleg Kiselyov (FNMOC); Chung-chieh Shan (Rutgers University) 10:55 Effective progamming in ML Daan Leijen (Microsoft Research); Ross Tate (University of California, San Diego) 11:20 Discussion 11:30 First-class modules and composable signatures in Objective Caml 3.12 Alain Frisch (LexiFi); Jacques Garrigue (Nagoya University Graduate School of Mathematics) 11:55 First-class modules: hidden power and tantalizing promises Jeremy Yallop (Applicative Ltd); Oleg Kiselyov (FNMOC) 12:20 Discussion 12:30 Lunch break 14:00 Deriving a Typed Implementation for Coroutines in ML Konrad Anton (Universitat Freiburg); Peter Thiemann (Universitat Freiburg) 14:25 The Design Rationale for Multi-MLton Suresh Jagannathan (Purdue University); Armand Navabi (Purdue University); KC Sivaramakrishnan (Purdue University); Lukasz Ziarek (Purdue University) 14:50 Discussion 15:00 Mirage: high-performance ML kernels in the cloud Anil Madhavapeddy (University of Cambridge); Thomas Gazagnaire (INRIA Sophia Antipolis) 15:25 Hosting a Standard ML compiler in a Web Browser: Status Report Martin Elsman 15:50 Discussion 16:00 Break 16:30 A simple and effective method for assigning blame for type errors David MacQueen (University of Chicago) 16:55 The MetaOCaml files: Status report and research proposal Oleg Kiselyov (FNMOC); Chung-chieh Shan (Rutgers University) 17:20 Discussion 17:30 Closing Registration and Local Arrangements ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ * https://regmaster3.com/2010conf/ICFP10/register.php * http://www.icfpconference.org/icfp2010/local.html 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

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