- Haskell - Haskell.org

Postdoc Positions at the CLIP group, Spain
by CFP 04 Feb '09

04 Feb '09

********************************************************************** Application deadline 13th of February (for the 5 years position) and 18th of February (for the 3 years position) ********************************************************************** The CLIP (Computational Logic, Implementation and Parallelism) group is searching for candidates for postdoctoral research positions in the research areas in which the group is involved. A PhD in Computer Science or related areas is required. These are research positions (no teaching is compulsory, although it is allowed) and renewable for up to 3 or 5 years. The initial salary (for the 5 year positions) is 44370 Euros/year plus an initial budget of 15000 Euros for travel and other expenses during the first year. Knowledge of Spanish is not a prerequisite for application and candidates can be of any nationality. The working language at the CLIP group for research is English. The number of positions available depends on the quality of the applicants. The positions are co-funded by the Spanish Ministry of Science and Technology and the Technical University of Madrid within the Ramon y Cajal and Juan de la Cierva programs. Selection Process: Interested applicants should send their c.v. and a description of their research interests to the CLIP group at hats-grants(a)clip.dia.fi.upm.es. The CLIP group will perform a pre-selection of the best applicants based on their scientific merits and the relevance of their research interests and experience to the research activities of the group. The CLIP group will then assist the pre-selected candidates in accomplishing all required steps to present the required documentation for the final evaluation step. The applications, will then be sent to the Spanish Ministry of Science and Technology which performs the final selection. The details of this step are described here. http://clip.dia.fi.upm.es/Job_Openings/RyC2009.html More details on the CLIP group, publications, projects, and research areas of interest can be found at our WWW site (see e.g. the group description and the listing of research topics and publications): http://clip.dia.fi.upm.es/ For more information on any of the above, please contact hats-grants(a)clip.dia.fi.upm.es --

1 0

HOC
by Thomas Davie 04 Feb '09

04 Feb '09

I noticed recently that HOC has moved over to google code, and seems a little more active than it was before. Is there a mailing list where I can talk to other users and get myself kick started, or is it a case of just using the standard Haskell ones? Bob

2 2

ANN: #haskell-in-depth IRC channel
by Philippa Cowderoy 04 Feb '09

04 Feb '09

Hi folks. As I've been daft enough to get a few things rolling, it looks like it's fallen on me to announce the new IRC channel, #haskell-in-depth. #haskell has been a roaring success over the last few years, as Don has repeatedly pointed out. Unfortunately that roar is starting to make it hard for some to participate - there's so much traffic that it can be difficult to fit an additional conversation in. We're starting to hit the limits as to how far one channel can take us, and that means we need to explore ways to divide up traffic. Actually, this isn't entirely new - a number of years ago now, #haskell-blah was formed as a space for off-topic (and sometimes less-than-worksafe) conversation among #haskell regulars. We also created #haskell-overflow, but it doesn't see much use except among some of the cabal implementors because it's hard to know when to take the conversation you're currently in to -overflow. We need channels that people start their conversations in, not ones to send people to! So we're trying a space for in-depth discussion. The new channel is open to everyone, just like #haskell. But just as we're hoping for certain kinds of discussion, there're others we want to avoid. If you need to know how to use monads so you can do IO, #haskell-in-depth isn't the place. On the other hand, if you want to discuss how Haskell's monads compare to the category theory or what the category theory can tell us about how individual monads relate to the language as a whole, -in-depth is a good place! In particular, we're hoping that the kind of category theory discussions that give the mistaken impression you actually need to know CT will increasingly live in #haskell-in-depth. We're not after a theory channel though - architectural discussion, compiler implementation, possible type system extensions, library design, all are good subjects. Anyway, I shouldn't ramble on for too long here - #haskell-in-depth is open for business and we look forward to seeing you there! -- Philippa Cowderoy <flippa(a)flippac.org>

2 1

WWV'09 - DEADLINE EXTENSION
by Demis Ballis 03 Feb '09

03 Feb '09

[Apologies if you receive multiple copies] *********************************************************** * DEADLINE EXTENSION * * * * WWV 2009 * * Automated Specification and Verification of Web Systems * * 5th International Workshop * * * * Castle of Hagenberg, Austria. July 17, 2009 * * * *********************************************************** NEW DATES --------- Abstract Submission February 9, 2009 (extended) Full Paper Submission February 16, 2009 (extended) Acceptance Notification April 20, 2009 Camera Ready June 1, 2009 Workshop July 17, 2009 WEB PAGE -------- http://www.risc.uni-linz.ac.at/conferences/wwv09/

1 0

CFP: AAIP'09 associated with ICFP'09
by Martin Hofmann 03 Feb '09

03 Feb '09

3rd Workshop on Approaches and Applications of Inductive Programming (AAIP 2009) associated with the 14th ACM SIGPLAN International Conference on Functional Programming (ICFP 2009) 4 September 2009, Edinburgh, Scotland *** Submission Deadline 11 May 2009 *** http://www.cogsys.wiai.uni-bamberg.de/aaip09/ CALL FOR PAPERS Inductive Programming is concerned with the automated construction of declarative (often functional) programs from incomplete specifications such as input/output examples. This inductive type of automated program synthesis has been originally addressed by researchers in artificial intelligence and machine learning. During the last years, some work on exploiting induction techniques has been started also in the functional programming community. This is the third workshop on "Approaches and Applications of Inductive Programming" and takes place for the first time in conjunction with ICFP. AAIP'09 aims to bring together researchers from the field of inductive functional programming and present and compare the different approaches with respect to their scope and efficiency. Furthermore, challenge problems for inductive programming which can be of interest to the functional programming community will be discussed. Finally, potential applications of inductive programming, especially the potential of such approaches for their use as programming assistants shall be discussed. We hope that this workshop advances fruitful interactions between the functional programming and the inductive functional programming communities. We invite authors to submit papers in either of two categories: technical papers and work in progress reports. Topics of interest are theoretical approaches to and algorithms or applications of inductive programming. Technical papers should present mature work on up to 12 pages. Additionally, extended abstracts (up to two pages) can be submitted to report work in progress. INVITED TALKS It is our pleasure to announce the following invited speakers: * Lennart Augustsson (Chalmers University of Technology) * Pieter Koopman and Rinus Plasmeijer (University of Nijmegen) * Neil Mitchell (Standard Chartered) PRESENTATION AND PUBLICATION INFORMATION Accepted technical papers will be presented orally (20 min. talk and 10 min. discussion). Accepted work in progress reports will be presented as posters. Workshop proceedings will be published online and as technical report. Furthermore, we plan to publish revised and selected papers as post-proceedings volume at Springer LNCS/LNAI. SUBMISSION GUIDELINES * Submissions of technical papers should be no longer than 12 pages, including bibliography and appendices. Submissions of work in progress reports should not be longer than 2 pages. Both paper types should follow the ICFP submission policy. The document template for LaTeX available from SIGPLAN should be used to prepare the document: http://www.sigplan.org/authorInformation.htm * Submission should be sent as EMail attachment as PDF to the workshop organizers using the following address martin.hofmann(a)uni-bamberg.de * Submitted papers must have content that has not previously been published in other conferences or refereed venues, and simultaneous submission to other conferences or refereed venues is unacceptable. IMPORTANT DATES Submission deadline 11 May 2009 Author notification 05 June 2009 Final paper due 22 June 2009 Workshop 04 September 2009 ORGANISATION COMMITTEE * Schmid, Ute, University of Bamberg * Plasmeijer, Rinus, Radboud University Nijmegen * Kitzelmann, Emanuel, University of Bamberg Technical Support: Martin Hofmann, University of Bamberg PROGRAM COMMITTEE * Pierre Flener, Uppsala University, Sweden * Lutz Hamel, University of Rhode Island, Kingston, USA * Jose Hernandez-Orallo, Technical University of Valencia, Spain * Johan Jeuring, University of Utrecht, The Netherlands * Susumu Katayama, University of Miyazaki, Japan * Kitzelmann, Emanuel, University of Bamberg * Pieter Koopman, Radboud University Nijmegen, The Netherlands * Oleg G. Monakhov, Russian Academy of Sciences, Siberian Branch, Russia * Ricardo Aler Mur, Universidad Carlos III de Madrid, Spain * Roland Olsson, Ostfold College, Norway * Rinus Plasmeijer, Radboud University Nijmegen, The Netherlands * Maria José Ramírez Quintana, Technical University of Valencia, Spain * Schmid, Ute, University of Bamberg WORKSHOP URL Further information: http://www.cogsys.wiai.uni-bamberg.de/aaip09/

1 0

CFP TFP 2009
by Horváth Zoltán 02 Feb '09

02 Feb '09

First call for papers 10th SYMPOSIUM ON TRENDS IN FUNCTIONAL PROGRAMMING TFP 2009 SELYE JANOS UNIVERSITY, KOMARNO, SLOVAKIA June 2-4, 2009 http://www.inf.elte.hu/tfp_cefp_2009 The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming languages, focusing on providing a broad view of current and future trends in Functional Programming. It aspires to be a lively environment for presenting the latest research results. Acceptance for the conference is based on full papers or extended abstracts, and a formal post-symposium refereeing process selects the best articles presented at the symposium for publication in a high-profile volume. TFP 2009 is hosted by the Selye Janos University, Komarno, Slovakia, and it is co-located with the 3rd Central-European Functional Programming School (CEFP 2009), which is held immediately before TFP 2009 (May 25-30). IMPORTANT DATES (ALL 2009) * Paper Submission: March 15 * Notification of Acceptance: April 3 * Camera Ready Symposium Proceedings Paper: April 24 * TFP Symposium: June 2-4, 2009 * Post Symposium Paper Submission: June 30 * Notification of Acceptance: September 7 * Camera Ready Revised Paper: September 21 SCOPE OF THE SYMPOSIUM 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: leading-edge, previously unpublished research. * Position: on what new trends should or should not be. * Project: descriptions of recently started new projects. * Evaluation: what lessons can be drawn from a finished project. * Overview: summarizing 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. Contributions on the following subject areas are particularly welcomed: * Dependently Typed Functional Programming * Validation and Verification of Functional Programs * Debugging for Functional Languages * Functional Programming and Security * Functional Programming and Mobility * Functional Programming to Animate/Prototype/Implement Systems from Formal or Semi-Formal Specifications * Functional Languages for Telecommunications Applications * Functional Languages for Embedded Systems * Functional Programming Applied to Global Computing * Functional GRIDs * Functional Programming Ideas in Imperative or Object-Oriented Settings (and the converse) * Interoperability with Imperative Programming Languages * Novel Memory Management Techniques * Parallel/Concurrent Functional Languages * 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 2009 program chairs, Zoltan Horvath and Viktoria Zsok at tfp2009(a)inf.elte.hu SUBMISSION AND DRAFT PROCEEDINGS Acceptance of articles for presentation at the symposium is based on the screening process of full papers (15 pages) and extended abstracts (at least 3 pages). TFP encourages PhD students to submit papers. PhD students may request the program committee to provide extensive feedback on their full papers at the time of submission. Full papers describing work accepted for presentation must be completed before the symposium for publication in the draft proceedings. Further details can be found at the TFP 2009 website. POST-SYMPOSIUM REFEREEING AND PUBLICATION In addition to the draft symposium proceedings, we continue the TFP tradition of publishing a high-quality subset of contributions in the Intellect series on Trends in Functional Programming. PROGRAM COMMITTEE * Peter Achten (symp-chair), Radboud University Nijmegen, NL * John Clements, California Polytechnic State University, USA * Cormac Flanagan, University of California at Santa Cruz, USA * Jurriaan Hage, Utrecht University, NL * Kevin Hammond, University of St. Andrews, UK * Michael Hanus, Christian-Albrechts University zu Kiel, DE * Ralf Hinze, University of Oxford, UK * Zoltan Horvath (PC co-chair), Eotvos Lorand University, HU * Graham Hutton, University of Nottingham, UK * Johan Jeuring, Utrecht University, NL * Pieter Koopman (symp-chair), Radboud University Nijmegen, NL * Hans-Wolfgang Loidl, Ludwig-Maximilians University Munchen, DE * Rita Loogen, Philipps-University Marburg, DE * Greg Michaelson, Heriot-Watt University, UK * Marco T. Morazan, Seton Hall University, USA * Rex L Page, University of Oklahoma, USA * Sven-Bodo Scholz, University of Hertfordshire, UK * Clara Segura, University Complutense de Madrid, ES * Mary Sheeran, Chalmers University of Technology, SE * Phil Trinder, Heriot-Watt University, UK * Marko van Eekelen, Radboud University Nijmegen, NL * Varmo Vene, University of Tartu, EE * Viktoria Zsok (PC co-chair), Eotvos Lorand University, HU LOCATION Conference Centre of Selye University, Komarno, Slovakia (http://www.selyeuni.sk/) It is a new and excellent conference centre with modern equipment, lecture rooms and computer labs. Komarno is on the north bank of river Danube, the northern part of the city Komarom / Komarno. It is a charming old city with about 30 000 inhabitants, 90 km away from Budapest (the capital of Hungary), with good highway and railway connections and 90 km away from Bratislava (the capital of Slovakia), about 100 km from Vienna International Airport.

1 0

ANN: regex-posix-unittest-1.0 AND regex-posix-0.94.1 AND regex-tdfa-0.97.1
by ChrisK 02 Feb '09

02 Feb '09

I have three announcements to make about regex-* related packages. The regex-posix-0.94.1 package update provides better semantics for multiple matches. Below version 0.94, if any match was empty the matching would stop. Now the empty match is returned and the position is incremented and the searching continues. The regex-tdfa-0.71.1 package update provides the same new multiple match semantics. It also fixes a bug I found. I know of no outstanding bugs in regex-tdfa, and version 0.71.1 now passes all the tests used in regex-posix-unittest-1.0 announced below. We should care about the correctness of our operating system libraries. To help with this, I have a NEW package to announce: regex-posix-unittest-1.0 The accompanying wiki page is http://www.haskell.org/haskellwiki/Regex_Posix This new package provides an executable called regex-posix-unittest which you can install as --user or --global. The regex-posix-unittest executable with no arguments runs a suite of unit tests, all of which are described by text files in the package, the format is documented in the wiki page. By editing the text files in the package you can add to or delete from the unit tests being run. With two arguments the program expects the text first and the pattern second and will run just that match and print all the results. How does regex-posix-unittest help us care about the OS libraries? The regex-posix distributed in the GHC bundle uses the OS C library's "regex.h" API. The regex-posix-unittest package will quite likely show you that your OS C library "regex.h" API is full of bugs. If you are on Linux, it will show you a plethora of GLIBC bugs in Posix conformance. If you are on OS X, FreeBSD, or NetBSD, it will show you many bugs including a critical bug where it fail to find a match where one actually exists. These bugs in the OS library are inherited by your "sed" program as well as regex-posix and Haskell. If you are on Windows, or OpenBSD, or Solaris, or anything else, then please update the wiki page at http://www.haskell.org/haskellwiki/Regex_Posix or email me with your results so I can update the wiki. You may have evil and ingenious tests of Posix extended regular expressions to add to the test suite. Adding them is easy and if you send them to me I will put them in an updated version of regex-posix-unittest. Cheers, Chris

1 0

Haskell-mode 2.0
by Stefan Monnier 02 Feb '09

02 Feb '09

I have recently taken over maintainership of Haskell-mode, and after making a bunch of changes, I figured it would be a good idea to make a new release. You can find this new release at: http://www-perso.iro.umontreal.ca/~monnier/elisp/ If you think it should also be found at http://www.haskell.org/haskell-mode/, then please tell John Peterson to get back to me (my email to him seem to go straight to the bitbucket. John?). This release has several changes that have all been only lightly tested, especially w.r.t compatibility with various Emacsen. See appended the NEWS file that describes some of the notewirthy changes. Stefan Changes since 1.45: * keybindings C-c <char> have been replaced by C-c C-<char> so as not to collide with minor modes. * The following modules are now automatically activated without having to add anything to haskell-mode-hook: haskell-font-lock (just turn on global-font-lock-mode). haskell-decl-scan (just bind `imenu' to some key). * In recent Emacsen, haskell-doc hooks into eldoc-mode. * haskell-hugs and haskell-ghci are superceded by inf-haskell. * Indentation rules have been improved when using layout inside parens/braces. * Symbols like -> and \ can be displayed as actual arrows and lambdas. See haskell-font-lock-symbols. * Tweaks to the font-lock settings. Among other things paren-matching with things like \(x,y) should work correctly now. * New maintainer <monnier(a)gnu.org>.

3 6

ICFP09 Final CFP
by Matthew Fluet (ICFP Publicity Chair) 02 Feb '09

02 Feb '09

Final Call for Papers ICFP 2009: International Conference on Functional Programming Edinburgh, Scotland, 31 August - 2 September 2009 http://www.cs.nott.ac.uk/~gmh/icfp09.html ** Submission deadline: 2 March 2009 ** Submission URL: https://www.softconf.com/a/icfp09/ ICFP 2009 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects or concurrency. Particular topics of interest include * Language Design * Implementation * Software-Development Techniques * Foundations * Applications and Domain-Specific Languages * Functional Pearls The conference also solicits Experience Reports, which are short papers that provide evidence that functional programming really works or describe obstacles that have kept it from working in a particular application. Important Dates (at 20:00 UTC) ~~~~~~~~~~~~~~~ Submission: 2 March 2009 https://www.softconf.com/a/icfp09/ Author response: 21-23 April 2009 Notification: 5 May 2009 Final papers due: 8 June 2009 Call for Papers (full text) ~~~~~~~~~~~~~~~ http://web.cecs.pdx.edu/~apt/icfp09_cfp.html Call for Experience Reports (full text) ~~~~~~~~~~~~~~~~~~~~~~~~~~~ http://web.cecs.pdx.edu/~apt/icfp09_cfer.html Program Chair ~~~~~~~~~~~~~ Andrew Tolmach Department of Computer Science Portland State University P.O. Box 751, Portland, OR 97207 USA Email: apt(a)cs.pdx.edu Phone: +1 503 725 5492 Fax: +1 503 725 3211 Mail sent to the address above is filtered for spam. If you send mail and do not receive a prompt response, particularly if the deadline is looming, feel free to telephone.

1 0

ANN: regex-xmlschema
by Uwe Schmidt 01 Feb '09

01 Feb '09

I'm pleased to announce (yet another) package for processing text with regular expressions: regex-xmlschema The W3C XML Schema specification (http://www.w3.org/TR/xmlschema11-2/#regexs) defines a language for regular expressions. This language is used in the XML Schema spec when defining the data type library part. This regex-xmlschema package contains a complete implementation of this spec. It is implemented with the technique of derivations of regular expression. Main features are: * full support of Unicode including all Unicode code blocks and character properties * a purely functional interface * 100% Haskell, no other packages except parsec needed * cabal build file * extensions for intersection, set difference, exclusive or and interleave of regular sets (regular expressions), * extensions for subexpression matches * functions for matching, for grep like searching, for stream like editing (sed like) and for tokenizing. With this package, it becomes rather easy to build lightweight tokenizers e.g. for colourizing arbitrary programming languages, like hscolor does it for Haskell. The package is available from Hackage: "http://hackage.haskell.org/cgi-bin/hackage-scripts/package/regex-xmlschema", there's a darcs repo for the latest source: "http://darcs2.fh-wedel.de/hxt/regex/" and a wiki page, describing the extension and giving some examples for using the library: "http://www.haskell.org/haskellwiki/Regular_expressions_for_XML_Schema" Cheers, Uwe -- Uwe Schmidt FH Wedel http://www.fh-wedel.de/~si/

1 0