January 2011 - Haskell

Announce: ~Haskell 2011
by Malcolm Wallace 07 Jan '11

07 Jan '11

The Haskell Language committee has had a quiet year. Following the announcement of Haskell 2010 in Nov 2009 [1], and the publication of the 2010 Report in July 2010 [2], we found a distinct lack of complete new proposals to decide upon. As a result, the committee has made the following decisions: (a) we wish to accept the NoDatatypeContexts proposal http://hackage.haskell.org/trac/haskell-prime/wiki/NoDatatypeContexts (b) this delta will be applied to the 2010 Report to form a new baseline; (c) we will _not_ issue a new language standard called 2011; (d) we intend to issue a new language standard in 2012; (e) the committee will continue for another year without new nominations. However, let me make it clear that the apparent lull in committee activity does not mean there are no active proposals being made. On the contrary, proposals for language features (and removals) are made by the community at large (that's you) - the committee's main role is not to make proposals, but to decide which to accept. And there have in fact been a large number of proposals, but very few have made it all the way to the stage of producing a "language report delta" that could be accepted (or modified) by the committee. So, I wish to declare "open season" on proposals for the 2012 standard. If there is a language feature you care about, please do take an hour or two to review the details on our wiki [3], search for older discussions on the mailing lists, and draft the Report changes you think would be necessary. I'm looking forward to a more active and exciting collection of potential language changes for 2012, but it will only happen if you get involved. Regards, Malcolm (Haskell 2011 committee chair) [1] http://www.haskell.org/pipermail/haskell/2009-November/021750.html [2] http://www.haskell.org/pipermail/haskell/2010-July/022189.html [3] http://hackage.haskell.org/trac/haskell-prime/

1 0

CfP: 4th Workshop on Approaches and Applications of Inductive Programming (AAIP 2011)
by Emanuel Kitzelmann 05 Jan '11

05 Jan '11

CALL FOR PAPERS 4th International Workshop on Approaches and Applications of Inductive Programming AAIP 2011 July 19, 2011, Odense, Denmark http://www.cogsys.wiai.uni-bamberg.de/aaip11/ co-located with the International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming (PPDP 2011) and the International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2011). AIMS AND SCOPE Inductive program synthesis or inductive programming (IP) is concerned with the automated generation of general computer programs from incomplete specifications such as input/output examples. IP particularly includes the synthesis of programs that contain loops or recursive calls. This inductive type of automated program synthesis is addressed by researchers in different fields such as artificial intelligence, inductive logic programming, evolutionary computation, symbolic computation, grammar inference, formal methods, and functional programming. The aim of the AAIP workshop is to have a common place to present and discuss research on all aspects of inductive programming - including, but not limited to: Inductive programming algorithms, techniques, and systems, heuristics, inductive biases, analysis of the learnability of particular program classes, and the combination of generate-and-test based and analytical techniques. We especially encourage submissions on inductive programming challenge problems and real-world applications of inductive programming in, e.g., computer-assisted software engineering, end-user programming, and intelligent agents. This is the fourth workshop on "Approaches and Applications of Inductive Programming" and takes place for the first time in conjunction with PPDP and LOPSTR. We invite authors to submit papers reporting on original work in either of two categories: full technical papers and short papers. Full papers should present mature work. Short papers may be work in progress reports, descriptions of system demonstrations, or position statements. INVITED TALKS TBA PRESENTATION AND PUBLICATION INFORMATION All accepted papers will be presented orally. Workshop (pre-)proceedings will be published online and as a technical report. Furthermore, we plan to publish selected and revised papers as a post-proceedings volume and sent a corresponding request to Springer LNCS. SUBMISSION GUIDELINES Submitted papers must describe original work, be written in English and should be formatted in the Springer Lecture Notes in Computer Science style: http://www.springer.de/comp/lncs/authors.html Submissions can either be full papers describing mature work or short papers describing work in progress, a system demonstration, or make a position statement. Full and short papers should not exceed 16 and 8 pages, respectively, including bibliography and appendices. Papers should be submitted as PDF via the AAIP 2011 submission webpage: http://www.easychair.org/conferences/?conf=aaip2011 IMPORTANT DATES April 3, 2011 Paper submission May 16, 2011 Author notification June 12, 2011 Camera-ready July 19, 2011 Workshop ORGANIZATION COMMITTEE * Emanuel Kitzelmann, International Computer Science Institute, Berkeley, USA * Ute Schmid, University of Bamberg, Germany PROGRAM COMMITTEE * Ricardo Aler Mur, Universidad Carlos III de Madrid, Spain * Pierre Flener, Uppsala University, Sweden * Lutz Hamel, University of Rhode Island, Kingston, USA * Jose Hernandez-Orallo, Technical University of Valencia, Spain * Martin Hofmann, SAP Research & Development, Germany * Johan Jeuring, University of Utrecht, The Netherlands * Susumu Katayama, University of Miyazaki, Japan * Pieter Koopman, Radboud University Nijmegen, The Netherlands * Maria Jose Ramirez Quintana, Technical University of Valencia, Spain CONTACT aaip2011(a)easychair.org -- Dr. Emanuel Kitzelmann International Computer Science Institute (ICSI) 1947 Center Street, Suite 600 Berkeley, CA 94704, USA e-mail: emanuel AT icsi DOT berkeley DOT edu phone: +1 510 666 2883

1 0

Call for Papers: PAPP 2011 (deadline extended)
by Clemens Grelck 04 Jan '11

04 Jan '11

New deadline: January 15, 2011 !! Eighth International Workshop on Practical Aspects of High-Level Parallel Programming (PAPP 2011) part of The International Conference on Computational Science June 1-3, 2011, Tsukuba, Japan http://www.papp-workshop.org AIMS AND SCOPE Computational Science applications are more and more complex to develop and require more and more computing power. Sequential computing cannot go further. Major companies in the computing industry now recognise the urgency of re-orienting an entire industry towards massively parallel computing. Parallel and grid computing are solutions to the increasing need for computing power. The trend is towards the increase of cores in processors, the number of processors and the need for scalable computing everywhere. But parallel and distributed programming is still dominated by low-level techniques such as send/receive message passing. Thus high-level approaches should play a key role in the shift to scalable computing in every computer. Algorithmic skeletons, parallel extensions of functional languages such as Haskell and ML, parallel logic and constraint programming, parallel execution of declarative programs such as SQL queries, genericity and meta-programming in object-oriented languages, etc. have produced methods and tools that improve the price/performance ratio of parallel software, and broaden the range of target applications. Also, high level languages offer a high degree of abstraction which ease the development of complex systems. Moreover, being based on formal semantics, it is possible to certify the correctness of critical parts of the applications. The PAPP workshop focuses on practical aspects of high-level parallel programming: design, implementation and optimisation of high-level programming languages, semantics of parallel languages, formal verification, design or certification of libraries, middle-wares and tools (performance predictors working on high-level parallel/grid source code, visualisations of abstract behaviour, automatic hot-spot detectors, high-level GRID resource managers, compilers, automatic generators, etc.), application of proof assistants to parallel applications, applications in all fields of computational science, benchmarks and experiments. Research on high-level grid programming is particularly relevant as well as domain specific parallel software. The aim of all these languages and tools is to improve and ease the development of applications (safety, expressivity, efficiency, etc.). Thus the PAPP workshop focuses on applications. The PAPP workshop is aimed both at researchers involved in the development of high level approaches for parallel and grid computing and computational science researchers who are potential users of these languages and tools. Topics We welcome submission of original, unpublished papers in English on topics including: * applications in all fields of high-performance computing and visualisation (using high-level tools) * high-level models (CGM, BSP, MPM, LogP, etc.) and tools for parallel and grid computing * high-level parallel language design, implementation and optimisation * practical aspects of computer assisted verification for high-level parallel languages * modular, object-oriented, functional, logic, constraint programming for parallel, distributed and grid computing systems * algorithmic skeletons, patterns and high-level parallel libraries * generative (e.g. template-based) programming with algorithmic skeletons, patterns and high-level parallel libraries * benchmarks and experiments using such languages and tools PAPER SUBMISSION AND PUBLICATION Prospective authors are invited to submit full papers in English presenting original research. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers will go through a rigorous reviewing process. Each paper will be reviewed by at least three referees. The accepted papers will be published in the Procedia Computer Science series, as part of the ICCS proceedings. Submission must be done through the ICCS website. We invite you to submit a full paper of at most 10 pages describing new and original results, no later than January 8, 2011. Submission implies the willingness of at least one of the authors to register and present the paper. Accepted papers should be presented at the workshop. IMPORTANT DATES * January 15, 2011: Full paper due * February 20, 2011: Notification * March 7, 2011: Camera-ready paper due PROGRAMME COMMITTEE * Marco Aldinucci (University of Torino, Italy) * Jost Berthold (University of Copenhagen, Denmark) * Kento Emoto (University of Tokyo, Japan) * Frédéric Gava (University Paris-East, France) * Alexandros Gerbessiotis (NJIT, USA) * Clemens Grelck (University of Amsterdam, Netherlands) * Hideya Iwasaki (The University of Electro-communications, Japan) * Roman Leshchinskiy (Standard Chartered Bank, UK) * Frédéric Loulergue, chair (University of Orléans, France) * Bruno Raffin (INRIA, France) * Aamir Shafi (NUST, Pakistan) -- ---------------------------------------------------------------------- Dr Clemens Grelck Science Park 904 Universitair Docent 1098 XH Amsterdam Nederland Universiteit van Amsterdam Instituut voor Informatica T +31 (0) 20 525 8683 F +31 (0) 20 525 7490 Office C3.105 www.science.uva.nl/~grelck ----------------------------------------------------------------------

1 0

CFP: Workshop on Intermediate Representations: deadline Jan 21
by Simon Peyton-Jones 04 Jan '11

04 Jan '11

Friends Happy new year! I'm on the PC for Workshop on Intermediate Representations; do consider submitting a paper. Simon WIR 2011: Workshop on Intermediate Representations 2011 http://researchr.org/conference/wir-2011 The intermediate representation is the core of any program transformation tool. Its design has a significant impact on the simplicity, efficiency, and effectiveness of program transformations. The developments in concurrent programming, integrated development environments, and domain-specific languages pose new requirements on intermediate representations. This workshop provides a forum to discuss current trends and experiences in the design, implementation, and application of intermediate representations. Co-located with CGO 2011<http://researchr.org/conference/cgo-2011> Conference Dates Submissions: January 21, 2011 Notification: February 25, 2011 Event: April 2, 2011-April 2, 2011

1 0

ANNOUNCE: haskell-src-meta 0.3
by Ben Millwood 04 Jan '11

04 Jan '11

Hello, I'm pleased to announce the recent release of haskell-src-meta 0.3. haskell-src-meta is a package originally written by Matt Morrow to provide a translation from the syntax tree provided by haskell-src-exts to template haskell syntax. Essentially this allows TH code to be parsed from a string, and is used in several quasiquoter libraries. The biggest reason for 0.3 is support for GHC 7 and TH 2.5. In addition to that, there is also better support for inline pragmas, and a smaller API. The original haskell-src-meta had a lot of neat ideas all in one place, and while they were quite useful, they were also irritating to maintain and made the version number unstable (keeping in line with the PVP). In an attempt to address this, I've moved the two most useful quasiquoters to their own new package - applicative-quoters - and moved the rest to an unexported 'examples' directory. I intend to do more to reduce the exposed API, but I thought I would make this release as soon as possible so that my reverse dependencies could start building again. I welcome contributions and contributors. This package is not in any real sense "mine" so I am happy to grant committer access to the github or joint maintainership to anyone with an interest in doing so. If you find bugs, there is an issue tracker, or if you want to discuss issues, there is a wiki: https://github.com/benmachine/haskell-src-meta Yours, Ben Millwood

1 0

Pearls of Functional Algorithm Design question
by Mark Engelberg 03 Jan '11

03 Jan '11

I'm currently reading the excellent Haskell-based book "Pearls of Functional Algorithm Design". I have a question about Chapter 2, the "surpassing problem". According to the book, "since join takes linear time, table is computer in O(n log n) steps". However, as far as I can tell, join takes linear time proportional to the number of elements in *table*, and the number of elements in table is potentially as large as n^2 where n is the length of the original list. So it seems like a quadratic algorithm or worse, to me. What am I missing? Thanks, Mark

1 1