Poly/ML April 2010

polyml@lists.polyml.org

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

Documentation of Poly/ML opcode
by xyly781＠gmail.com 01 May '10

01 May '10

Hi, I'm currently studying the run time system of Poly/ML, looking at its source code. I found there are 130 instructions listed in int_opcodes.h, and the semantics is defined in interpreter function. I'm wondering whether there's any documentation available for describing the semantics of each instruction, this will definitely help me understand each instruction better. Thanks for your help, Yue

2 1

CUFP 2010 in Baltimore in September -- Call for Participation
by sweeks＠sweeks.com 24 Apr '10

24 Apr '10

Commercial Users of Functional Programming Workshop (CUFP) 2010 Call for Participation Sponsored by SIGPLAN Co-located with ICFP 2010 Baltimore, Maryland Sep 27-29, 2010 Submission Deadline: 15 June 2010 Functional programming languages have been a hot topic of academic research for over 35 years, and have seen an ever larger practical impact in settings ranging from tech startups to financial firms to biomedical research labs. At the same time, a vigorous community of practically-minding functional programmers has come into existence. CUFP is designed to serve this community. The annual CUFP workshop is a place where people can see how others are using functional programming to solve real world problems; where practitioners meet and collaborate; where language designers and users can share ideas about the future of their favorite language; and where one can learn practical techniques and approaches for putting functional programming to work. # Giving a CUFP Talk # If you have experience using functional languages in a practical setting, we invite you to submit a proposal to give a talk at the workshop. We're looking for two kinds of talks: *Experience reports* are typically 25 minutes long, and aim to inform participants about how functional programming plays out in real-world applications, focusing especially on lessons learned and insights gained. Experience reports don't need to be highly technical; reflections on the commercial, management, or software engineering aspects are, if anything, more important. You do not need to submit a paper! *Technical talks* are expected to be 30-45 minutes long, and should focus on teaching the audience something about a technical technique or methodology, from the point of view of someone who has seen it play out in practice. These talks could cover anything from techniques for building functional concurrent applications, to managing dynamic reconfigurations, to design recipes for using types effectively in large-scale applications. While these talks will often be based on a particular language, they should be accessible to a broad range of functional programmers. If you are interested in offering a talk, or nominating someone to do so, send an e-mail to francesco(at)erlang- consulting(dot)com or yminsky(at)janestreet(dot)com by **15 June 2010** with a short description of what you'd like to talk about or what you think your nominee should give a talk about. Such descriptions should be about one page long. There will be no published proceedings, as the meeting is intended to be more a discussion forum than a technical interchange. # Program Committee # * Francesco Cesarini, Erlang Training and Consulting (Co-Chair) * Tim Dysinger, Sonian Networks * Alain Frisch, LexiFi * Nick Gerakines, Chegg * Adam Granicz, IntelliFactory * Amanda Laucher * Romain Lenglet, Google Japan * Yaron Misky, Jane Street (Co-Chair) * Mary Sheeran, Chalmers * Don Stewart, Galois * Dean Wampler, DRW Trading # More information # For more information on CUFP, including videos of presentations from previous years, take a look at the CUFP website at <http://cufp.org>. Note that presenters, like other attendees, will need to register for the event. Presentations will be video taped and presenters will be expected to sign an ACM copyright release form. Acceptance and rejection letters will be sent out by July 15th.

1 0

Code examples in Parallel Poly/ML and Isabelle/ML paper
by yli＠cse.tamu.edu 24 Apr '10

24 Apr '10

Hi, Makarius, Thank you very much for these information, and I apologize that I reply this so late. I will start working on topics related to parallel computer algebra during this summer, and is very interested in knowing how these examples work so well from your Poly/ML paper so that I can take advantage of the mechanism in the paper to my work, therefore I was asking for these useful examples presented in the paper. I will ask more if I have further questions. Thank you very much, Yue On Fri, Feb 12, 2010 at 6:11 PM, Yue K. Li <yue.kevin.li(a)gmail.com> wrote: > ---------- Forwarded message ---------- > From: Makarius <makarius(a)sketis.net> > Date: Fri, Feb 12, 2010 at 2:21 PM > Subject: Re: [polyml] Code examples in Parallel Poly/ML and Isabelle/ML paper > To: Yue Li <yue.kevin.li(a)gmail.com> > Cc: polyml(a)inf.ed.ac.uk > > > On Thu, 11 Feb 2010, Yue Li wrote: > >> Recently I read the paper "Efficient Parallel Programming in Poly/ML and Isabelle/ML" published in DAMP'10. It's really a nice paper for me to read. Especially, I'm deeply impressed by the good scalability and cpu utilization of multithreading implementation as shown in the data section. I'm very interested in the parallel implementation of Poly/ML, and would like to try to use it. Here may I ask is there any way for me to obtain the testing examples used in the paper's experiment so that I could study and play with the parallel features? > > In the paper we point to a particular repository version of Isabelle > (with Mercurial changeset id), but it is easier to use the official > Isabelle2009-1 release that came out a few weeks later -- the parallel > infrastructure did not change much in between. > > See http://isabelle.in.tum.de and > http://isabelle.in.tum.de/installation.html in particular. ?A suitable > Poly/ML compilation for many platforms is also included here -- this > is actually required to use the Isabelle logic images from that > website. > > To work with Isabelle/ML, you can mostly forget about everything > involving Proof General and Emacs, which causes the main problems for > first-time installation. ?If you have the GNU "rlwrap" ("readline > wrapper") tool on your system, you already get a convenient tty > interface. ?E.g. run it like this: > > ?$ Isabelle2009-1/bin/isabelle tty -l HOL > ?Welcome to Isabelle/HOL (Isabelle2009-1: December 2009) > ?> exit > ?ML> > > Strictly speaking, the "Pure" image is sufficient, instead of the > slightly bulky "HOL" one, but the latter is available as precompiled > on the Isabelle download site. > > If you want to compile only the core Isabelle/Pure system you can do > it like this: > > ?$ Isabelle2009-1/build Pure > ?... > ?Press RETURN to compilation of > > ?Pure > > ?Started at Fri Feb 12 21:01:22 CET 2010 (polyml-5.3.0_x86-linux on ...) > ?Building Pure ... > ?Finished Pure (0:00:11 elapsed time, 0:00:10 cpu time, factor 0.90) > ?Finished at Fri Feb 12 21:01:33 CET 2010 > ?0:00:11 elapsed time, 0:00:10 cpu time, factor 0.90 > > And invoke it as above, replacing "HOL" by "Pure" in the command line. > > > The "applications" from the paper are all relatively big Isabelle > logic sessions, with formal definitions and proofs being processed by > semi-automatic tools. ?The ideas behind parallelizing formal document > processing is further explained in > http://www4.in.tum.de/~wenzelm/papers/parallel-isabelle.pdf > > You need to use "isabelle usedir ..." and/or "isabelle make" with > certain parameters in certain directories to reproduce the examples. > I can give you further details on demand -- even some Scala script to > produce the graphs from the paper. ?Note that certain server-class > hardware sometimes needs extra tweaking to get good results, while > high-end workstations usually work without further worries (notably > Mac Pro). > > > Probably your main interest will be the Isabelle/ML library for > working with synchronized variables, future values etc. ?All of this > is in Isabelle2009-1/src/Pure/Concurrent/. ?The ML names in the paper > have been slightly shortened. > > Here is an example: > > ?val x = Future.fork (fn () => 1 + 1); > > The ML toplevel pretty printer will display the value of x, just type > "x" again at the toplevel later. ?You can also use Future.join > explicitly. > > Here is the example from section 4.2: > > ?fun loop () : int = loop (); > > ?val g = Task_Queue.new_group NONE; > ?val x = Future.fork_group g loop; > ?val y = Future.fork_group g (fn () => 1 div 0); > > > The library implementation is fine-tuned towards the particular needs > of Isabelle proof checking, but it should be straight forward to turn > this into a fully generic ML library. ?(I would be willing to assist > anybody in doing this, but I can myself only maintain the Isabelle/ML > version.) > > > ? ? ? ?Makarius >

2 1

PolyML.print/makestring vs. toplevel pretty printing
by makarius＠sketis.net 12 Apr '10

12 Apr '10

Two questions concerning the builtin pretty printing facilities of Poly/ML 5.3 (or pre-5.4 SVN version 1125). (1) The Poly/ML toplevel pretty prints values nicely, according to the print functions installed by the user. It seems that PolyML.print (and PolyML.makestring) produce an unformatted string only via PolyML.uglyPrint instead of PolyML.prettyPrint. Is this a fundamental limitation, or could one get regular pretty printed output here as well? (2) When mapping Pretty.fbrk (forced break) of Isabelle to the Poly/ML model we simulate it via a very large regular break, greater than the usual line length. This produces funny output with PolyML.print/makestring, because it does not do the formatting as observed above. Is it possible to force breaks more directly, apart from embedding a literal "\n" which is not counted properly? Makarius

2 2

Profiling on Mac OS X
by David.Matthews＠prolingua.co.uk 04 Apr '10

04 Apr '10

There's a problem using PolyML.profiling 1 on Mac OS X and think this has been discussed before. Time profiling works by setting a timer and then examining the program counter when the timer goes off to determine which function is being executed. Linux supports per-thread timers and when a timer goes off the thread that is executing receives the signal. Mac OS X has only per-process timers and all signals are sent to the "main" thread, the thread that handles garbage-collection, which means that the profiler cannot work out what function was actually being executed. I've now added an option to "configure", --without-threads, that builds a version of poly that is single-threaded and so allows profiling on Mac OS X. Note that disabling threads also disables signal handling. David

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