Poly/ML

polyml@lists.polyml.org

695 discussions

Workshop on ML 2010 - Call for Content
by mtf＠cs.rit.edu 24 May '10

24 May '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 Content 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: 25 June, 2010 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

Poly/ML interpreter's opcodes
by xyly781＠gmail.com 19 May '10

19 May '10

Dear David, Right now I'm studying the Poly/ML's interpreter, trying to understand the semantics of opcodes implemented in interpret.cpp. However, I have difficulty on understanding some of the opcodes: 1. INSTR_non_local, in its implementation case INSTR_non_local: { PolyWord *t = sp+arg1; POLYSIGNED uu; for(uu = 1; uu <= arg2; uu++) t = (t[-1]).AsStackAddr(); uu = arg3; /* Can be negative. */ if (uu > 32767) uu -= 65536; *(--sp) = t[uu]; pc += 6; break; } Here what does this instruction do, and what does t[-1] holds? Also how about the semantics of INSTR_non_local_l_i (where i can be 1, 2 or 3)? 2. INSTR_const_addr_Xb, and INSTR_const_addr_Xw: in their implementations they have long expression for computing the addresses such as: PolyWord::FromCodePtr(pc + (pc[0]+4)*sizeof(PolyWord) + pc[1] + pc[2]*256 + 3)) I'm confused about what does the address computed by the long expression refer to and why it is computed in this way? What are the meanings of Xb, and Xw in the their instruction names? 3. INSTR_ldexc. This instruction pushes the content in p_reg[0] into the stack. I read the definition of the stack object in globals.h, but still couldn't understand what is the stack registers used for? Here could you give me some help for understanding the above instructions? Thanks, Yue

2 2

5.3 variability in Posix.Process.exec
by Michael.Norrish＠nicta.com.au 14 May '10

14 May '10

On my Intel Macbook Pro running 10.5.8, I get SysErr ("Operation not supported", SOME ENOTSUP) On a Linux michaeln-desktop 2.6.31-21-generic #59-Ubuntu SMP Wed Mar 24 07:28:56 UTC 2010 i686 GNU/Linux I get: -- Poly/ML 5.3 Release > Posix.Process.exec ("/bin/ls", []); Warning-The type of (it) contains a free type variable. Setting it to a unique monotype. Segmentation fault -- On a slightly different Linux atp-login1 2.6.26-2-686 #1 SMP Wed Aug 19 06:06:52 UTC 2009 i686 GNU/Linux I get the expected behaviour... -- Is there anything I should have done differently when building these Poly instances? Michael

3 13

Poly/ML exit codes
by Michael.Norrish＠nicta.com.au 13 May '10

13 May '10

I have a Linux shell-script that calls poly-image < script and which is being dying unexpectedly in a cronjob. The end of the log looks like: Poly/ML 5.3 Release > Killed /home/michaeln/stdhol/bin/Holmake: Failed script build for arm_improved_gcScript - exited with code 89 Build failed in directory /home/michaeln/stdhol/examples/machine-code/lisp (exited with code 1) Holmake is reporting the error returned by a call to OS.Process.system, using fun posix_diagnostic stat = let open Posix.Process in case fromStatus stat of W_EXITSTATUS w8 => "exited with code "^Word8.toString w8 | W_EXITED => "exited normally" | W_SIGNALED sg => "with signal " ^ SysWord.toString (Posix.Signal.toWord sg) | W_STOPPED sg => "stopped with signal " ^ SysWord.toString (Posix.Signal.toWord sg) end The presence of "Killed" makes me think that the script is being killed by an external signal, perhaps a SIGSEGV caused by hitting a limit on stack-size. But is this plausible? Would Poly/ML catch that signal and then exit with 89? Annoyingly, the same script doesn't fail when not in a cronjob, so it's hard to test. Michael

2 2

Fwd: Re: [polyml] Documentation of Poly/ML opcode
by xyly781＠gmail.com 01 May '10

01 May '10

forward to the list. -------- Original Message -------- Subject: Re: [polyml] Documentation of Poly/ML opcode Date: Sat, 01 May 2010 13:58:45 -0500 From: Yue Li <xyly781(a)gmail.com> To: David Matthews <David.Matthews(a)prolingua.co.uk> Hi, David, On 05/01/2010 06:38 AM, David Matthews wrote: > Hi, > The opcodes in int_opcodes.h apply only to the interpreted version of > Poly/ML and the interpreter is only used on platforms where there is > no native code-generator. > I see. Ok! > There's not much, if any, documentation for the internals of the > compiler or run-time system. Probably the most useful data structures > to look at are in mlsource/MLCompiler/CODETREESIG.ML . I did not discover that before. The IR is really helpful! Thanks! > The top-level of the compiler builds this intermediate level data > structure and the optimiser transforms it. It is then code-generated > by the bottom level using either a native code-generator; for the X86 > (32 or 64-bit), PPC or Sparc or byte code for the interpreter on any > other platform. Many operations, though, are performed by RTS > (run-time system) functions and these include such basic operations as > integer addition. These are listed in libpoly/sys.h and > basis/RunTimeCalls.ML. In the general case these actually require a > call into the C++ run-time system but simple operations are > implemented in the assembly code section or are recognised by the > code-generator and turned into the appropriate machine instructions. > No problem! Here could you point me to the code where the native and byte code generator lives? Thank you very much! Yue > Regards, > David > > Yue Li wrote: >> 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 >> _______________________________________________ >> polyml mailing list >> polyml(a)inf.ed.ac.uk >> http://lists.inf.ed.ac.uk/mailman/listinfo/polyml

1 0

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

← Newer
1
...
43
44
45
46
47
48
49
...
70
Older →

Jump to page:

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