June 2008 - Haskell - Haskell.org

TLDI 2009 Call for Papers
by Amal Ahmed 18 Jun '08

18 Jun '08

********************************************************************* CALL FOR PAPERS TLDI 2009 ACM SIGPLAN Workshop on Types in Language Design and Implementation 24 January 2009 Savannah, Georgia, USA To be held in conjunction with POPL 2009 http://ttic.uchicago.edu/~amal/tldi2009/ ********************************************************************* IMPORTANT DATES Submission: 8 Oct 2008, 5PM EDT (Wed) Notification: 8 Nov 2008 (Sat) Camera ready: 19 Nov 2008 (Wed) TLDI'09: 24 January 2009 (Sat) SCOPE The role of types and proofs in all aspects of language design, compiler construction, and software development has expanded greatly in recent years. Type systems, type analyses, and formal deduction have led to new concepts in compilation techniques for modern programming languages, verification of safety and security properties of programs, program transformation and optimization, and many other areas. In light of this expanding role of types, the ACM SIGPLAN Workshop on Types in Language Design and Implementation (TLDI'09) follows six previous International Workshops on types in compilation and language design (TIC'97, TIC'98, TIC'00, TLDI'03, TLDI'05, and TLDI'07), with the hope of bringing together researchers to share new ideas and results in this area. Submissions for this event are invited on all interactions of types with language design, implementation, and programming methodology. This includes both practical applications and theoretical aspects. TLDI'09 specifically encourages papers from a broad field of programming language and compiler researchers, including those working in object-oriented, dynamically-typed, late-binding, systems programming, and mobile-code paradigms, as well as traditional fully-static type systems. Topics of interest include: - Typed intermediate languages and type-directed compilation - Type-based language support for safety and security - Types for interoperability - Type systems for system programming languages - Type-based program analysis, transformation, and optimization - Dependent types and type-based proof assistants - Types for security protocols, concurrency, and distributed computing - Type inference and type reconstruction - Type-based specifications of data structures and program invariants - Type-based memory management - Proof-carrying code and certifying compilation This is not meant to be an exhaustive list; papers on novel utilizations of type information are welcome. Authors concerned about the suitability of a topic are encouraged to inquire via electronic mail to the program chair prior to submission. SUBMISSION GUIDELINES Authors should submit a full paper of no more than 12 pages (including bibliography and appendices) by Wednesday, October 8, 2008 5PM Eastern Daylight Savings Time. The submission deadline and length limitations are firm. Submissions that do not meet these guidelines will not be considered. All submissions should be in standard ACM SIGPLAN conference format: two columns, nine-point font on a ten-point baseline. Detailed formatting guidelines are available on the SIGPLAN Author Information page, along with a LaTeX class file and template: http://www.sigplan.org/authorInformation.htm Papers must be submitted in Adobe Portable Document Format (PDF) and must be formatted for US Letter size (8.5"x11") paper. Authors for whom this is a hardship should contact the program chair before the deadline. Submitted papers must adhere to the SIGPLAN Republication Policy: http://www.sigplan.org/republicationpolicy.htm Submissions should contain original research not published or submitted for publication elsewhere. The URL for submission will be announced closer to the deadline. GENERAL CHAIR Andrew Kennedy Microsoft Research, Cambridge PROGRAM CHAIR Amal Ahmed Toyota Technological Institute, Chicago PROGRAM COMMITTEE Amal Ahmed Toyota Technological Institute, Chicago (Chair) Juan Chen Microsoft Research Peter Dybjer Chalmers University of Technology Jeff Foster University of Maryland, College Park Neal Glew Intel Robert Harper Carnegie Mellon University Andrew Myers Cornell University Atsushi Ohori Tohoku University Matthew Parkinson University of Cambridge Didier Remy INRIA Paris-Rocquencourt Andreas Rossberg Max Planck Institute for Software Systems STEERING COMMITTEE Craig Chambers University of Washington Robert Harper Carnegie Mellon University (Chair) Xavier Leroy INRIA Paris-Rocquencourt Greg Morrisett Harvard University George Necula Rinera Networks and UC Berkeley Atsushi Ohori Tohoku University Francois Pottier INRIA Paris-Rocquencourt Zhong Shao Yale University

1 0

Final CFP: 2008 Haskell Symposium (Haskell 08)
by Andy Gill 18 Jun '08

18 Jun '08

Haskell 08 ACM SIGPLAN 2008 Haskell Symposium Victoria, British Columbia, Canada Thursday, 25th September, 2008 FINAL CALL FOR PAPERS http://haskell.org/haskell-symposium/2008 The Haskell Symposium 2008 is part of the 2008 International Conference on Functional Programming (ICFP) as an associated ACM SIGPLAN sponsored symposium. The purpose of the Haskell Symposium is to discuss experience with Haskell, and future developments for the language. The scope of the symposium includes all aspects of the design, semantics, theory, application, implementation, and teaching of Haskell. Topics of interest include, but are not limited to, the following: * Language Design, with a focus on possible extensions and modifications of Haskell as well as critical discussions of the status quo; * Theory, in the form of a formal treatment of the semantics of the present language or future extensions, type systems, and foundations for program analysis and transformation; * Implementations, including program analysis and transformation, static and dynamic compilation for sequential, parallel, and distributed architectures, memory management as well as foreign function and component interfaces; * Tools, in the form of profilers, tracers, debuggers, pre-processors, and so forth; * Applications, Practice, and Experience, with Haskell for scientific and symbolic computing, database, multimedia and Web applications, and so forth as well as general experience with Haskell in education and industry; * Functional Pearls, being elegant, instructive examples of using Haskell. Papers in the latter two categories need not necessarily report original research results; they may instead, for example, report practical experience that will be useful to others, re-usable programming idioms, or elegant new ways of approaching a problem. The key criterion for such a paper is that it makes a contribution from which other practitioners can benefit. It is not enough simply to describe a program! Before 2008, the Haskell Symposium was known as the Haskell Workshop. The name change reflects the steady increase of influence of the Haskell Workshop on the wider community, as well as an increasing numbers of high quality submissions making the acceptance process highly competitive. Previously, Haskell Workshops have been held in La Jolla (1995), Amsterdam (1997), Paris (1999), Montreal (2000), Firenze (2001), Pittsburgh (2002), Uppsala (2003), Snowbird (2004), Tallinn (2005), Portland, Oregon (2006), Freiburg (2007). Submission Details * Submission Deadline: Monday, June 23rd 2008 (9:00 am, Samoa Standard Time, UTC -11) * Author Notification: Friday, July 18th 2008 * Final Papers Due: Monday, July 28th 2008 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (http://www.acm.org/sigs/sigplan/authorInformation.htm) The length is restricted to 12 pages, and the font size 9pt. Each submission must adhere to SIGPLAN's republication policy, as explained on the web. Violation risks summary rejection of the offending submission. Paper submissions can be made via the easychair webpage http://www.easychair.org/conferences/?conf=haskell08 Accepted papers will be published by the ACM and will appear in the ACM Digital Library. If there is sufficient demand, we will try to organize a time slot for system or tool demonstrations. If you are interested in demonstrating a Haskell related tool or application, please send a brief demo proposal to Andy Gill, andygill(a)ku.edu. Links * http://haskell.org/haskell-symposium, the permanent homepage of the Haskell Symposium. * http://haskell.org/haskell-symposium/2008, the 2008 Haskell Symposium web page. * http://www.icfpconference.org/icfp2008, the ICFP 2008 web page. Program Committee * Arthur Baars, Instituto Tecnologico de Informatica, Valencia, Spain * Jeremy Gibbons, Oxford University, UK * Andy Gill, University of Kansas, USA (Program Chair) * William Harrison, University of Missouri, Columbia, USA * Roman Leshchinskiy, University of New South Wales, Australia * Bernie Pope, University of Melbourne, Australia * Colin Runciman, University of York, UK * Tim Sheard, Portland State University, USA * Mary Sheeran, Chalmers University of Technology, Sweden * Satnam Singh, Microsoft Research, UK * Wouter Swierstra, Nottingham University, UK * Varmo Vene, University of Tartu, Estonia

1 0

ANNOUNCE: Cabal 1.4
by Duncan Coutts 18 Jun '08

18 Jun '08

Cabal 1.4 ========= Cabal version 1.4 is out: http://haskell.org/cabal/download.html The user guide and API documentation are also available from the download page. You can also get it from hackage: http://hackage.haskell.org/cgi-bin/hackage-scripts/package/Cabal Release notes ============= There are no huge new features in the Cabal library itself, though there are a number of incremental improvements and lots of bug fixes. The main new feature is that is supports a significantly improved version of cabal-install. You can see a summary of the changes in the change log: http://haskell.org/cabal/release/latest/changelog A few items in particular are changes in existing behaviour: * All .cabal files are treated as UTF-8 and must be valid * Stricter parsing for version strings, eg disallows "1.05" * Default prefix for --user installs is now $HOME/.cabal Compatibility ------------- We have tried to preserve compatibility with all packages that worked with the Cabal-1.2.x series. That is, packages that can be built using Cabal (including custom Setup.hs scripts) but not packages that directly import and use the Cabal API. Packages that directly import and use the Cabal api will need updating. This affects packages that build distro packages for example, rpm debs etc. Bugs and feature requests ------------------------- This is an excellent opportunity to make sure your favourite bug or feature request is properly described in our bug tracker: http://hackage.haskell.org/trac/hackage/ To help us guide development priorities please add yourself to the ticket's cc list and describe why that bug or feature is important to you. Credits ======= On behalf of the Cabal hackers and the community generally I'd like to thank the large number of people who have contributed patches during this development series. Previously I was rather worried that we were not getting enough contributors to fix bugs and do new feature development, but now I'm very pleased. Get involved ============ Of course there's still a lot to do! We have big plans for Cabal-2.0, cabal-install and the Hackage website. So if you're interested in helping out with this core infrastructure project then: * subscribe to the cabal-devel mailing list: http://www.haskell.org/mailman/listinfo/cabal-devel * grab the source: http://haskell.org/cabal/code.html * read the guide to the source code: http://hackage.haskell.org/trac/hackage/wiki/SourceGuide * take a look at our list of bugs and feature requests: http://hackage.haskell.org/trac/hackage/report/12 especially the easy tickets: http://hackage.haskell.org/trac/hackage/report/13 Duncan

1 0

send in material for the HWN!
by Brent Yorgey 17 Jun '08

17 Jun '08

Hi all, Do you know of a blog post about Haskell that wasn't syndicated on Planet Haskell? Do you have a Haskell-related story to tell or announcement to make? Do you have a link to some great pictures from the latest meetup/hackathon/talk/conference? A funny story about Don Stewart? If so, consider submitting it to the Haskell Weekly News. The HWN isn't really about Haskell so much as it is about the Haskell *community* -- and that means you! In addition to the above sorts of submissions, I am also thinking of adding a "Community News" section with announcements of (not-necessarily-Haskell-related) major events in the lives of community members -- but obviously this depends on submissions, so if you get a new job/move/start a new company/graduate/increment your age/have a comet named after you/bring forth a new life (aka future Haskeller) into the world, please share, and let the community celebrate with you! Submissions can be sent to byorgey at seas dot upenn dot edu. Be sure to include "HWN" in the subject line. For now I'm planning to put an issue out every Wednesday afternoon, so the submission deadline is Wednesday at 11am GMT (6am Eastern US). -Brent

1 0

Final CFP: ML Workshop 2008
by Eijiro Sumii 16 Jun '08

16 Jun '08

The submission deadline (June 23, Monday) for ML Workshop 2008 is approaching. Note the extension of the scope of the workshop this year (see below). Please feel free to contact the program chair (sumii(a)ecei.tohoku.ac.jp) if you have any question. Eijiro ********************************************************************** CALL FOR PAPERS The 2008 ACM SIGPLAN Workshop on ML Sunday, September 21, 2008 Victoria, British Columbia, Canada To be held in conjunction with ICFP 2008 http://www.kb.ecei.tohoku.ac.jp/ml2008/ IMPORTANT DATES: Submission deadline: Monday, June 23, 2008 Notification of acceptance: Friday, July 18, 2008 Final revision due: Monday, July 28, 2008 Workshop: Sunday, September 21, 2008 GOALS OF THE WORKSHOP: 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 build on previous occasions (recent instances are ML 2005 in Tallinn, Estonia, 2006 in Portland, Oregon, and 2007 in Freiburg, Germany), providing a forum to encourage discussion and research on ML and related technology. The 2008 Workshop on ML will be held in conjunction with the 13th ACM SIGPLAN International Conference on Functional Programming (ICFP 2008) in Victoria, British Columbia, Canada on Sunday, September 21, 2008. This year we extend the scope of the workshop from ML itself to technologies closely related to ML (higher-order, typed, or strict languages) and invite high-quality papers in all areas of crucial importance for the future of ML. SUBMISSION GUIDELINES: We seek papers on topics related to ML, including (but not limited to): * applications * extensions: objects, classes, concurrency, distribution and mobility, semi-structured data handling, etc. * type systems (static and dynamic): inference, effects, overloading, error reporting, contracts, specifications and assertions, etc. * implementation: compilers, interpreters, partial evaluators, garbage collectors, etc. * environments: libraries, tools, editors, debuggers, cross-language interoperability, functional data structures, etc. * semantics Submitted papers should describe new ideas, experimental results, ML-related projects, or informed positions regarding proposals for next-generation ML languages. In order to encourage lively discussion, submitted papers may describe work in progress. All papers will be judged on a combination of correctness, significance, novelty, clarity, and interest to the community. All paper submissions must be at most 12 pages total length in the standard ACM SIGPLAN two-column conference format (9pt): http://www.acm.org/sigs/sigplan/authorInformation.htm Accepted papers will be published by the ACM and will appear in the ACM Digital Library. The submission web site is now online. Visit http://www.easychair.org/conferences?conf=ml2008 and follow the instructions. PROGRAM CHAIR: Eijiro Sumii (Tohoku University) PROGRAM COMMITTEE: Sylvain Conchon (Paris-Sud University / INRIA Saclay-Ile-de-France) Karl Crary (Carnegie Mellon University) Andrzej Filinski (DIKU) Robby Findler (The University of Chicago) Cormac Flanagan (University of California at Santa Cruz) Alain Frisch (LexiFi) Dan Grossman (University of Washington) Didier Remy (INRIA Paris-Rocquencourt) Claudio Russo (Microsoft Research Cambridge) Eijiro Sumii (Tohoku University) Hongwei Xi (Boston University)

1 0

ANNOUNCE: trac for projects on community.haskell.org
by Ian Lynagh 14 Jun '08

14 Jun '08

Hi all, It is now possible for projects on community.haskell.org to create themselves a trac (which provides a bug tracking system and wiki). Please see http://community.haskell.org/admin/using_project.html#trac for details of how to do so. Thanks Ian

1 0

ANN: Haddock Trac
by David Waern 13 Jun '08

13 Jun '08

Hi everyone, there's now a Haddock bug-tracker and wiki at http://trac.haskell.org/haddock. Please use it to submit bug reports and feature requests! David

1 0

AMAST'08 Call for Participation
by Mark Hills 12 Jun '08

12 Jun '08

[Apologies for multiple copies, please distribute.] CALL FOR PARTICIPATION 12th International Conference on Algebraic Methodology and Software Technology Urbana, Illinois, United States July 28th - 31st, 2008 http://amast08.cs.uiuc.edu The major goal of the AMAST conferences is to promote research towards setting software technology on a firm, mathematical basis. Work towards this goal is a collaborative, international effort with contributions from both academia and industry. The conference series has become widely known for disseminating academic and industrial achievements within the broad AMAST areas of interest. Through these meetings AMAST has attracted an international following among researchers and practitioners interested in software technology, programming methodology and their algebraic and logical foundations. Registration for AMAST'08 is now open. EARLY REGISTRATION: June 29, 2008. https://www-s.continuinged.uiuc.edu/conferences/index.cfm?formid=121655a2-6… INVITED SPEAKERS: Rajeev Alur, Marrying Words and Trees Jayadev Misra, Simulation Using Orchestration Teodor Rus, Liberate Computer User from Programming ACCEPTED PAPERS: An Algebra for Features and Feature Composition Sven Apel, Christian Lengauer, Bernhard Moeller, Christian Kaestner Petri nets are dioids Paolo Baldan, Fabio Gadducci Towards an Efficient Implementation of Tree Automata Completion Emilie Balland, Yohan Boichut, Pierre-Etienne Moreau, Thomas Genet Calculating Invariants as Coreflexive Bisimulations Luis Barbosa, Jose Oliveira, Alexandra Silva Types and Deadlock Freedom in a Calculus of Services, Sessions and Pipelines Roberto Bruni, Leonardo Gaetano Mezzina A declarative debugger for Maude Rafael Caballero, Narciso Marti-Oliet, Adrian Riesco, Alberto Verdejo Long-Run Cost Analysis by Approximation of Linear Operators over Dioids David Cachera, Thomas Jensen, Arnaud Jobin, Pascal Sotin Towards Validating a Platoon of Cristal Vehicles using CSP||B Samuel Colin, Arnaud Lanoix, Olga Kouchnarenko, Jeanine Souquieres Explaining Verification Conditions Ewen Denney, Bernd Fischer Towards Formal Verification of ToolBus Scripts Wan Fokkink, Paul Klint, Bert Lisser, Yaroslav S. Usenko A Formal Analysis of Complex Type Flaw Attacks on Security Protocols Han Gao, Chiara Bodei, Pierpaolo Degano Abstract Interpretation Plugins for Type Systems Tobias Gedell, Daniel Hedin Separation Logic Contracts for a Java-like Language with Fork/Join Christian Haack, Clement Hurlin Towards a Model-theoretic Semantics for Contract-based Software Components Rolf Hennicker, Michel Bidoit Implementing a categorical information system Michael Johnson, Robert Rosebrugh Constant complements, reversibility and universal view updates Michael Johnson, Robert Rosebrugh Coinductive Properties of Causal Maps Jiho Kim Extending Timed Process Algebra with Discrete Stochastic Time Jasen Markovski, Erik de Vink Vx86: x86 Assembler Simulated in C Powered by Automated Theorem Proving Stefan Maus, Michal Moskal, Wolfram Schulte Evolving Specification Engineering Dusko Pavlovic, Peter Pepper, Douglas Smith Verification of Java Programs with Generics Kurt Stenzel, Holger Grandy, Wolfgang Reif Domain Axioms for a Family of Near-Semirings Georg Struth, Jules Desharnais Generating specialized rules and programs for demand-driven analysis K. Tuncay Tekle, Katia Hristova, Yanhong A. Liu Non expansive Epsilon-Bisimulations Simone Tini A Hybrid Approach for Safe Memory Management in C Syrine Tlili, Zhenrong Yang, Hai Zhou Ling, Mourad Debbabi Service Specification and Matchmaking using Description Logic: An Approach Based on Institutions M. Birna van Riemsdijk, Rolf Hennicker, Martin Wirsing, Andreas Schroeder System Demonstration of Spiral, Program Generator for High-Performance Libraries for Linear Transforms Yevgen Voronenko, Franz Franchetti, Frederic de Mesmay, Markus Pueschel The verification of the on-chip COMA cache coherence protocol Duong Vu, Li Zhang, Chris Jesshope

1 0

2008 ICFP Programming Contest
by Tim Chevalier 12 Jun '08

12 Jun '08

[Re-posting since the first message was apparently held due to the large number of recipients. Apologies if this shows up more than once, and please forward to any appropriate lists where it hasn't showed up already.] Mark your calendars for Friday, July 11, 2008 to Monday, July 14, 2008: the dates for the eleventh annual ICFP Programming Contest. The ICFP Programming Contest is one of the most advanced and prestigious programming contests, as well as being a chance to show off your programming skills, your favorite languages and tools, and your ability to work as a team. The contest is affiliated with the International Conference on Functional Programming. Teams consisting of one or more participants, from any part of the world, using any programming language, may enter. The specific task will be announced when the contest begins. In the meantime, watch the Web site for more information: http://icfpcontest.org/ Please direct any questions to Tim Sheard at sheard(a)cs.pdx.edu, rather than replying to this message. -Tim Chevalier, on behalf of the 2008 contest organizers (programming language devotees at Portland State University and the University of Chicago) -- Tim Chevalier * http://cs.pdx.edu/~tjc * Often in error, never in doubt "Time flies like an arrow. Fruit flies like a banana. Syntax rules like a macro." -- Albert Lai

1 0

ANN: random-access-list-0.1
by Stephan Friedrichs 11 Jun '08

11 Jun '08

Hello, I've implemented Chris Okasaki's random-access list[1] which provides typical list operations (cons, head, tail) in O(1) and yet offers indexed random-access in O(log n). It's uploaded on hackage[2]. It's still an early version which I'll extend, but especially at this eary stage I'd appreciate your feedback concerning what's still missing / to be fixed / to be improved. Regards, Stephan [1] Chris Okasaki: "Purely Functional Data Structures" [2] http://hackage.haskell.org/cgi-bin/hackage-scripts/package/random-access-li… -- Früher hieß es ja: Ich denke, also bin ich. Heute weiß man: Es geht auch so. - Dieter Nuhr

1 0