Poly/ML

polyml@lists.polyml.org

695 discussions

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

use depth
by itz＠buug.org 25 Feb '13

25 Feb '13

Is there an easy way (perhaps through the PolyML.Compiler structure) to get the depth of ` use "foo" ' stack at runtime? -- Ian Zimmerman gpg public key: 1024D/C6FF61AD fingerprint: 66DC D68F 5C1B 4D71 2EE5 BD03 8A00 786C C6FF 61AD http://www.gravatar.com/avatar/c66875cda51109f76c6312f4d4743d1e.png Rule 420: All persons more than eight miles high to leave the court.

4 4

Patch to fix PolyML on x86_64 FreeBSD
by imre＠vdsz.com 12 Feb '13

12 Feb '13

This patch is necessary to make PolyML work on FreeBSD x86_64, because the elf.h header in FreeBSD is missing a typecast that exists in the corresponding header file on Linux. Without this patch the compiled polyml immediately segfaults on FreeBSD x86_64. This issue also affects other *BSD systems (e.g. NetBSD/amd64). It should not do any harm to simply include this cast as in the patch unconditionally. Regards, Imre Vadasz --- libpolyml/elfexport.h.orig Tue Sep 11 16:27:04 2007 +++ libpolyml/elfexport.h Sat Jan 26 22:33:22 2013 @@ -37,7 +37,7 @@ #define ElfXX_Sym Elf64_Sym #define ElfXX_Ehdr Elf64_Ehdr #define ElfXX_Shdr Elf64_Shdr -#define ELFXX_R_INFO(_y, _z) ELF64_R_INFO(_y, _z) +#define ELFXX_R_INFO(_y, _z) ELF64_R_INFO((Elf64_Xword)(_y), _z) #define ELFXX_ST_INFO(_y, _z) ELF64_ST_INFO(_y, _z) #define ELFCLASSXX ELFCLASS64 #else

2 1

Profiling: UNKNOWN ranks highest
by krauss＠in.tum.de 29 Jan '13

29 Jan '13

Hi all, I am trying to profile a piece of Isabelle code (with profiling type 1), and in the end I get a report like the following: 24 Term_Subst.instT_same(3)subst_typ(1) 24 Term.abstract_over(2)abs(2) 26 Term.fastype_of1(2) 27 Ord_List.union(3)unio(2) 28 TextIO.openAppend(1) 28 Term_Subst.instT_same(3)subst_typs(1) 32 Table().lookup_key(2)look(1) 33 BasicStreamIO().flushOut'(1)flushBuff(1) 35 Ord_List.unions(2)unios(2) 39 Thm.deriv_rule2(3) 41 Table().del(3) 43 TextIO.input'(1) 44 Term_Subst.inst_same(4)subst(1) 52 Table().lookup_key(2)look(1) 57 Term_Ord.atoms_ord(2) 62 Sorts.mg_domain(3) 70 Term_Ord.types_ord(2) 77 Table().lookup_key(2)look(1) 79 Table().modify(3)modfy(1) 80 Term_Ord.struct_ord(2) 87 Table().defined(2)def(1) 149 GARBAGE COLLECTION (minor collection) 150 GARBAGE COLLECTION (total) 13313 UNKNOWN What does UNKNOWN mean? Is there anything I can do to make the result more meaningful? Alex

3 3

Low-level filehandle error
by krauss＠in.tum.de 22 Jan '13

22 Jan '13

Dear list, In an Isabelle session that reads a large file containing a proof trace, I am regularly getting a funny low-level filehandle error when using polyml 5.5.0: *** exception Io {name = "/home/krauss/src/nimport/HOL_VOL/proofsN-VOL", cause = SysErr ("Bad file descriptor", SOME EBADF), function = "TextIO.fillBuffer"} raised (line 476 of "./basis/TextIO.sml") I am doing nothing low-level with filehandles, just reading a file using basis library APIs (wrapped by Isabelle). It does not happen completely reliably but quite often, and seems to be correlated with low-memory situations. If I restrict the memory drastically using --maxheap, then it always happens. But it also sometimes happens when (I think) enough memory should be available. My suspicion is that this could be an issue with the new memory management, but this is just guessing. This happens across various linuxes. I am seeing it with polyml 5.5.0 but not with 5.4.1. It happens both on 32bit and 64bit. I can exclude things like NFS, since I also see it on regular ext3 volumes. My questions: - Can any of the new memory management features be switched off (e.g., the sharing phase)? Are there other flags I could play with to narrow this issue down further? - Any other ideas? I can provide source code to reproduce this, but it is not quite minimal at the moment... Thanks for any help Alex

2 1

Trends in Functional Programming 2013: 2nd Call for Papers
by jay.mccarthy＠gmail.com 18 Jan '13

18 Jan '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 Danny Yoo from the University of Utah 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 Shrijvers 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

Unable to build fixes-5.5 debian style
by itz＠buug.org 28 Dec '12

28 Dec '12

For some time now, Debian tries to build all binaries with some "hardening" flags. This includes the -pie linker flag, which forces building of position-independent binaries. But I cannot build the current tip of the fixes-5.5 branch this way. At the point where poly reads the portable export, I get: ./poly -H 50 --error-exit < mlsource/BuildExport.sml lt-poly: memmgr.cpp:915: void MemMgr::AddTreeRange(SpaceTree**, MemSpace*, uintptr_t, uintptr_t): Assertion `t->tree[r] == 0' failed. /bin/bash: line 1: 14570 Aborted ./poly -H 50 --error-exit < mlsource/BuildExport.sml make[2]: *** [compiler] Error 134 make[2]: Leaving directory `/tmp/polyml-fixes/polyml' Attached is the build log both _with_ (bad) and _without_ (good) the -pie flag. I suspect that the successful build without -pie is an accident, ie. an uninitialized location is being read and it just happens to be 0 in this case. Arch amd-64, gcc/g++ 4.7.2 -- Ian Zimmerman gpg public key: 1024D/C6FF61AD fingerprint: 66DC D68F 5C1B 4D71 2EE5 BD03 8A00 786C C6FF 61AD http://www.gravatar.com/avatar/c66875cda51109f76c6312f4d4743d1e.png Rule 420: All persons more than eight miles high to leave the court.

2 1

Bug in x86-64 version of >=PolyML-5.4.1
by rene.neumann＠in.tum.de 21 Nov '12

21 Nov '12

Skipped content of type multipart/mixed

3 3

Re: reading a file on byte level
by David.Matthews＠prolingua.co.uk 17 Oct '12

17 Oct '12

Michael, It's probably a good idea to send questions like this to the Poly/ML mailing list and I'm copying this reply to the list. There are people on the list who may have experience of what you're trying to do and also any replies get archived and reduce the chances of the same question being asked repeatedly. To reply to your specific question: there's no difference in efficiency between TextIO and BinIO on Unix. On Windows TextIO is more complicated because of the need to convert between CRLF and "\n". I'm not clear how you are accessing the file, whether it is random or sequential. To read individual bytes you can always use BinIO.input1 or TextIO.input1. This would save you having to explode a vector. BinIO deals with values of type Word8.word and the vector is Word8Vector.vector. These are unsigned byte values. Regards, David On 16/10/2012 20:59, Michael Moeller wrote: > Hi, > > I've got a problem regarding huge files as input. I need to get access to > the single byteslike with fgetc() in C. TextIO and subsequently exploding > the string does the jobbut performance matters and it seems to me like > BinIOsaves me from the 'explode' step.Unfortunately I can't figure out > how to access theresulting BinIO.vector. I'd be appreciative to seean > exampleand please tell me if this is not the right approach. > > Regards, > Michael >

3 4

32 bit Compiler stuck
by Bernard.Berthomieu＠laas.fr 07 Oct '12

07 Oct '12

Hello, When compiling the following function with 32 bit poly, the compiler does not return (tried on Unixes). No problem with 64 bit poly. fun h x = let val m = 0wx5bd1e995 val h0 = Word.xorb( x, 0wx1e3779b9) val k0 = x * m val k1 = Word.xorb( k0, Word.>>( k0, Word.fromInt 24)) val k2 = k1 * m val h1 = h0 * m in Word.xorb( h1, k2 ) end; Best Regards, Bernard.

2 1

← Newer
1
...
30
31
32
33
34
35
36
...
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