From simonpj at microsoft.com  Tue Apr  1 04:38:48 2008
From: simonpj at microsoft.com (Simon Peyton-Jones)
Date: Tue Apr  1 04:34:53 2008
Subject: [Haskell] Commercial Users of Functional Programming Workshop 
Message-ID: <638ABD0A29C8884A91BC5FB5C349B1C32AB9FA8A10@EA-EXMSG-C334.europe.corp.microsoft.com>

      Commercial Users of Functional Programming Workshop (CUFP) 2008
                26 September 2008, Victoria, British Columbia

        ============== CALL FOR PRESENTATIONS ======================

                 Presentation proposals due 2 June 2008

                 http://cufp.functionalprogramming.com
               Functional Programming As a Means, Not an End

                          Sponsored by SIGPLAN
                        Co-located with ICFP 2008     _________________________________________________________________

   Functional languages have been under academic development for over 25
   years, and remain fertile ground for programming language research.
   Recently, however, developers in industrial, governmental, and open
   source projects have begun to use functional programming successfully
   in practical applications. In these settings, functional programming
   has often provided dramatic leverage, including whole new ways of
   thinking about the original problem.

   The goal of the CUFP workshop is to act as a voice for these users of
   functional programming. The workshop supports the increasing viability
   of functional programming in the commercial, governmental, and
   open-source space by providing a forum for professionals to share
   their experiences and ideas, whether those ideas are related to
   business, management, or engineering. The workshop is also designed to
   enable the formation and reinforcement of relationships that further
   the commercial use of functional programming.

Speaking at CUFP

   If you use functional programming as a means, rather than as an end,
   we invite you to offer to give a talk at the workshop. Alternatively,
   if you know someone who would give a good talk, please nominate them!

   Talks are typically 30-45 minutes long, but can be shorter. They aim
   to inform participants about how functional programming played out in
   real-world applications, focusing especially on the re-usable lessons
   learned, or insights gained. Your talk does not need to be highly
   technical; for this audience, reflections on the commercial,
   management, or software engineering aspects are, if anything, more
   important. You do not need to submit a paper!

   If you are interested in offering a talk, or nominating someone to do
   so, send an e-mail to jim (dot) d (dot) grundy (at) intel (dot) com or
   simonpj (at) microsoft (dot) com by 2 June 2008 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.

Program Plans

   CUFP 2008 will last a full day and feature an invited presentation
   from Michael Hopcroft, the product unit manager for the forthcoming
   release of Microsoft Visual Studio F#. Additionally, the program
   will include a mix of presentations and discussion sessions. Topics
   will range over a wide area, including:
     * Case studies of successful and unsuccessful uses of functional
       programming;
     * Business opportunities and risks from using functional languages;
     * Enablers for functional language use in a commercial setting;
     * Barriers to the adoption of functional languages, and
     * Mitigation strategies for overcoming limitations of functional
       programming.

   There will be no published proceedings, as the meeting is intended to
   be more a discussion forum than a technical interchange.

Program Committee

     * Lennart Augustsson <lennart (dot) augustsson (at) gmail (dot) com>
     * Matthias Blume <blume (at) tti-c (dot) org>
     * Adam Granicz <granicz (dot) adam (at) intellifactory (dot) com>
     * Jim Grundy (co-chair) <jim (dot) d (dot) grundy (at) intel (dot) com>
     * John Lalonde <lalonde (at) abstrax (dot) com>
     * Andy Martin <akmartin (at) us (dot) ibm (dot) com>
     * Yaron Minsky <yminsky (at) janestcapital (dot) com>
     * Simon Peyton Jones (co-chair) <simonpj (at) microsoft (dot) com>
     * Ulf Wiger <ulf (dot) wiger (at) ericsson (dot) com>

   This will be the fifth CUFP, for more information - including reports
   from attendees of previous events - see the workshop web site:
   http://cufp.functionalprogramming.com
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups "CUFP" group.
To post to this group, send email to cufp@googlegroups.com
To unsubscribe from this group, send email to cufp-unsubscribe@googlegroups.com
For more options, visit this group at http://groups.google.com/group/cufp?hl=en
-~----------~----~----~----~------~----~------~--~---

From jeremy.odonoghue at gmail.com  Tue Apr  1 06:35:20 2008
From: jeremy.odonoghue at gmail.com (Jeremy O'Donoghue)
Date: Tue Apr  1 06:31:20 2008
Subject: [Haskell] ANN: wxHaskell 0.10.3
Message-ID: <1207046120.21995.1245402907@webmail.messagingengine.com>

The wxHaskell development team is pleased to announce the release of
wxHaskell 0.10.3, a Haskell binding
for the wxWidgets GUI library.

The Haskell support is built on a reasonably complete C language
binding, which
could be used as the basis for wxWidgets support on other
languages/platforms
which do not have easy mechanisms for linking with C++ code.

The feature set is the same as wxHaskell 0.10.3 rc1 and rc2, with a
number of
additional bugfixes.

This is the first full release since June 2005, and is the result of a
great deal of work by a new team of contributors.

Highlights of 0.10.3 include:

- Support for Unicode builds of wxWidgets
- Support for additional widgets including calendar, toolbar divider,
  styled text control (wxScintilla), media control
- Support for clipboard, drag and drop
- Support for 64bit (Linux) targets
- Support for wxWidgets 2.6.x (support for wxWidgets 2.4.2 if
  you compile from source). wxWidgets 2.8 is not yet supported
- Support for building with GHC 6.6.x and 6.8.x
- Parts of wxHaskell are now built with Cabal
- New test cases
- Removed support GHC version < 6.4
- Profiling support
- Smaller generated binary sizes (using --split-objs)

Binary packages are available from the wxHaskell download site at
http://sourceforge.net/project/showfiles.php?group_id=73133, for the
following platforms:

- Debian
- Windows
- OS X (Intel and PPC platforms)
- Source code .tar.gz and .zip
- Documentation (cross-platform)

The wxHaskell libraries (wxcore and wx) are also available from Hackage
(http://hackage.haskell.org).

About wxHaskell
---------------

wxHaskell is a Haskell binding to the wxWidgets GUI library for recent
versions
of the Glasgow Haskell Compiler. It provides a native look and feel on
Windows,
OS X and Linux, and a medium level programming interface.

The main project page for wxHaskell is at
http://wxhaskell.sourceforge.net.
The latest source code for wxHaskell can always be obtained from
http://darcs.haskell.org/wxhaskell.
There are developer (wxhaskell-devel@lists.sourceforge.net and user
(wxhaskell-users@lists.sourceforge.net) mailing lists, and a wiki page
at http://haskell.org/haskellwiki/WxHaskell which can provide more
information to those interested.

wxHaskell was originally created by Daan Leijen. The contributors to
this new release include:

- Eric Kow
- shelarcy
- Arie Middelkoop
- Mads Lindstroem
- Jeremy O'Donoghue
- Lennart Augustson

The C language binding for wxHaskell was derived from an original C
language binding created for the Eiffel programming language by the
ELJ project (http://elj.sourceforge.net).
-- 
  Jeremy O'Donoghue
  jeremy.odonoghue@gmail.com

From s_zefirov at ipmce.ru  Wed Apr  2 08:39:05 2008
From: s_zefirov at ipmce.ru (Serguey Zefirov)
Date: Wed Apr  2 08:36:25 2008
Subject: [Haskell] Some old and quite old news.
Message-ID: <47F37E69.4060203@ipmce.ru>

I'd like to let dear readers to know that I finally managed to put 
source code and some documentation related to modeling of digital 
circuits and whole systems.

Most of the work was done in 2006 and 2007, so this is very old news. 
But I finally found time to put everything in more-or-less usable state 
and put it online (thanks to Max Taldykin, the host of Moskow HUG). I 
put it online a while ago so this is just old news.

The SVN repository is here: http://thesz.mskhug.ru/browser/hiersort

This is the model of multicore dynamic dataflow machine (with a twist), 
the draft paper about architecture under consideration and a 
presentation about the use of Haskell in modeling (almost) complete MIPS 
CPU with memory.

The core of our modeling framework is here: 
http://thesz.mskhug.ru/browser/hiersort/core/S.hs
The paper about dataflow machine is here: 
http://thesz.mskhug.ru/browser/hiersort/doc/sdd2.pdf
And the presentation is here: 
http://thesz.mskhug.ru/browser/hiersort/doc/hhm-eng.pdf

To summarize presentation content: we were able to deliver working model 
of MIPS CPU with working model of dynamic memory with memory controller 
in four months. The biggest roadblock encountered is the memory leak we 
couldn't get rid of. We often use Haskell to prototype various kinds of 
IP blocks and (parts of) computer architecture since that.

From sescobar at dsic.upv.es  Thu Apr  3 06:21:16 2008
From: sescobar at dsic.upv.es (Santiago Escobar)
Date: Thu Apr  3 06:18:05 2008
Subject: [Haskell] EXTENSION: (SecReT 2008) 3rd Int'l Workshop on Security
	and Rewriting Techniques
References: <76715604-C36C-4480-9CB1-532124FDEA6D@dsic.upv.es>
Message-ID: <93CB2208-DDB2-4A39-AE9E-DC0F44C0E913@dsic.upv.es>

********************************************************************

                         (DEADLINE EXTENSION)

                              SecReT 2008

                     3rd International Workshop on
                   Security and Rewriting Techniques
               http://www.dsic.upv.es/workshops/secret08

                          Sunday, June 22, 2008,
                             Pittsburgh, USA

                          Affiliated workshop of
       the 21st IEEE Computer Security Foundations Symposium (CSF)
     and the 23rd IEEE Symposium on Logic In Computer Science (LICS)


IMPORTANT DATES

Abstract Submission      April 18, 2008 *********
Full Paper Submission    April 20, 2008 *********
Acceptance Notification  May   12, 2008
Camera Ready             May   26, 2008
Workshop                 June  22, 2008

SCOPE

The aim of this workshop is to bring together rewriting researchers
and  security  experts, in order to  foster  their  interaction and
develop future collaborations in this area,  provide  a  forum  for
presenting  new  ideas and work in progress,  and  enable newcomers
to learn about current activities in this area.

The workshop focuses on the use of rewriting techniques in all aspects
of security. Specific topics include: authentication, encryption,
access control and authorization, protocol verification, specification
of policies, intrusion detection, integrity of information, control of
information leakage, control of distributed and mobile code, etc.

Previous instances of SecRet were held in 2006 (S. Servolo, Venice,
Italy), and 2007 (Paris, France).

LOCATION

SecReT'08 will be held at Carnegie Mellon University in Pittsburgh,
Pennsylvania, USA. The  workshop is associated with the 21st IEEE
Computer Security Foundations Symposium (CSF'08) and the  23rd IEEE
Symposium on Logic in Computer Science (LICS'08).

SUBMISSION PROCEDURE

Submission is web-based via a link available in  the main web page.
Submissions must be received by April 6, 2008. In addition, a title
and abstract must be submitted by March 31, 2008. Submitted papers
should be at most 15 pages in the ENTCS style, and should include
an abstract and the author's information. See the author's
instructions of ENTCS style at http://www.entcs.org.

PUBLICATION

Accepted papers will be published in a preliminary volume available
during the workshop.  After the workshop, a final version of the
proceedings will be published in the Elsevier series Electronic
Notes in Theoretical Computer Science (ENTCS).

INVITED SPEAKERS

Hubert Comon         Cachan, France
Jonathan Millen      MITRE, USA

PROGRAM CO-CHAIRS

Daniel Dougherty     Worcester Polytechnic Institute, USA
Santiago Escobar     Technical University of Valencia, Spain

PROGRAM COMMITTEE

Pierpaolo Degano     Pisa, Italy
Daniel Dougherty     Worcester, USA
Santiago Escobar     Valencia, Spain
Maribel Fernandez    King's College London, UK
Thomas Genet         IRISA Rennes, France
Joshua Guttman       MITRE, USA
Catherine Meadows    NRL, USA
Monica Nesi          L'Aquila, Italy
Michael Rusinowitch  Lorraine, France
Ralf Treinen         Paris-7, France

********************************************************************
From waldmann at imn.htwk-leipzig.de  Thu Apr  3 09:08:20 2008
From: waldmann at imn.htwk-leipzig.de (Johannes Waldmann)
Date: Thu Apr  3 09:04:14 2008
Subject: [Haskell] Local Haskell Meeting Leipzig Germany April 18th (update)
Message-ID: <47F4D6C4.2000501@imn.htwk-leipzig.de>

Dear all,

updated information (schedule, venue)
for "Haskell in Leipzig 3" (Friday, April 18th,
that is, in two weeks time) is now available
from http://www.iba-cg.de/hal3.html.
Thrilling topics, beautiful venue - register now!

Talks:
Janis Voigtl?nder - Theorems for Free
Bernd Holzm?ller - Haskell tools for DSL compilation
Lutz Donnerhacke - Haskell/SPARK libraries
J?rgen Nicklisch-Franken - Making of Leksah

Sponsors:
ICS AG Stuttgart - http://www.ics-ag.de/
iba Consultig Gesellschaft Leipzig - http://iba-cg.de/
FIT Leipzig - http://www.fit-leipzig.de/

We'll also have the eclipsefp Hackathon but for that,
registration is now *closed* (too many people - imagine that!)
Still, you can contribute to this project
anytime via http://leiffrenzel.de/eclipse/wiki/doku.php

Best regards, Alf Richter and Johannes Waldmann.

From andreas.abel at ifi.lmu.de  Fri Apr  4 11:38:35 2008
From: andreas.abel at ifi.lmu.de (Andreas Abel)
Date: Fri Apr  4 11:34:23 2008
Subject: [Haskell] LFMTP'08: 2nd Call for Papers
Message-ID: <47F64B7B.7030108@ifi.lmu.de>

Update:
- invited speaker: Dale Miller
- submission server now open (abstract deadline: 14 April)


     International Workshop on Logical Frameworks and Meta-Languages:
     Theory and Practice (LFMTP'08)
                   http://www4.in.tum.de/~lfmtp

               Pittsburgh, PA, USA, 23 June 2008
         Affiliated with Logic in Computer Science (LICS 2008)

                        2nd CALL FOR PAPERS

Important dates:
---------------------------------------------------------------------
Abstract submission:     14 April 2008
Paper submission:        21 April 2008
Author notification:     19 May 2008
Final version:            2 June 2008
Workshop day:            23 June 2008
---------------------------------------------------------------------

The LFMTP workshop continues the International workshop on Logical
Frameworks and Meta-languages (LFM) and the MERLIN workshop on
MEchanized Reasoning about Languages with variable BIndingIN.

Logical frameworks and meta-languages form a common substrate for
representing, implementing, and reasoning about a wide variety of
deductive systems of interest in logic and computer science. Their
design and implementation on the one hand and their applications in
for example proof-carrying code have been the focus of considerable
research over the last two decades. This workshop will bring together
designers, implementors, and practitioners to discuss all aspects of
logical frameworks and variable binding.

The broad subject areas of LFMTP'08 are:

* The automation and implementation of the meta-theory of programming
   languages and related calculi, particularly work which involves
   variable binding and fresh name generation.
* The theoretical and practical issues concerning the encoding of
   variable binding and fresh name generation, especially the
   representation of, and reasoning about, datatypes defined from binding
   signatures.
* Case studies of meta-programming, and the mechanization of the
   (meta)theory of descriptions of programming languages and other
   calculi.  Papers focusing on logic translations and on experiences
   with encoding programming languages theory are particularly welcome.

Topics include, but are not limited to

     * logical framework design
     * meta-theoretic analysis
     * applications and comparative studies
     * implementation techniques
     * efficient proof representation and validation
     * proof-generating decision procedures and theorem provers
     * proof-carrying code
     * substructural frameworks
     * semantic foundations
     * methods for reasoning about logics
     * formal digital libraries

Invited Speaker:

Dale Miller         (Laboratoire d'Informatique, INRIA Saclay)

Program Committee:

Andreas Abel        (LMU Munich)
Peter Dybjer        (Chalmers University of Technology)
Alberto Momigliano  (University of Edinburgh)
Brigitte Pientka    (McGill University)
Randy Pollack       (University of Edinburgh)
Carsten Schuermann  (IT University of Copenhagen)
Peter Sewell        (University of Cambridge)
Aaron Stump         (Washington University)
Christian Urban     (TU Munich)

Three categories of papers are solicited:

   * Category A: Detailed and technical accounts of new research: up
     to fifteen pages including bibliography.
   * Category B: Shorter accounts of work in progress and proposed
     further directions, including discussion papers: up to eight
     pages including bibliography and appendices.
   * Category C: System descriptions presenting an implemented tool
     and its novel features: up to six pages. A demonstration is
     expected to accompany the presentation.

Submission is electronic.  Authors are required to submit a paper
title and a short abstract of about 100 words before submitting the
paper.

Papers are to be submitted in postscript or PDF format and must
conform to the ENTCS style preferably using LaTeX2e. For further
information and submission instructions, see the LFMTP web page:
http://www4.in.tum.de/~lfmtp

Proceedings are to be published as a volume in the Electronic Notes in
Theoretical Computer Science (ENTCS) series and will be available to
participants at the workshop.

Authors of accepted papers are expected to present their paper at
the workshop.

The organizers:

Andreas Abel                           Christian Urban		
Theoretical Computer Science	       Institute for Computer Science
Ludwig-Maximilians-University Munich   Technical University of Munich
Email: andreas.abel@ifi.lmu.de         Email: urbanc@in.tum.de

-- 
Andreas Abel  <><      Du bist der geliebte Mensch.

Theoretical Computer Science, University of Munich
http://www.tcs.informatik.uni-muenchen.de/~abel/

From icfp.publicity at googlemail.com  Sat Apr  5 11:44:47 2008
From: icfp.publicity at googlemail.com (Matthew Fluet (ICFP Publicity Chair))
Date: Sat Apr  5 11:40:36 2008
Subject: [Haskell] DEFUN08: Call for Talks & Tutorials (co-located w/ ICFP08)
Message-ID: <53ff55480804050844i2d604b26gaeff9d2f2d6a17a2@mail.gmail.com>

		     Call for Talks and Tutorials
     ACM SIGPLAN 2008 Developer Tracks on Functional Programming
		http://www.deinprogramm.de/defun-2008/
	     Victoria, BC, Canada, 25, 27 September, 2008
       The workshop will be held in conjunction with ICFP 2008.
	       http://www.icfpconference.org/icfp2008/

Important dates

Proposal Deadline: June 27, 2008, 0:00 UTC
Notification:      July 14, 2008

DEFUN 2008 invites functional programmers who know how to solve
problems with functional prorgamming to give talks and lead tutorials
at the The ICFP Developer Tracks.

We want to know about your favorite programming techniques, powerful
libraries, and engineering approaches you've used that the world
should know about and apply to other projects. We want to know how to
be productive using functional programming, write better code, and
avoid common pitfals.

We invite proposals for presentations in the following categories:

How-to talks: 45-minute "how-to" talks that provide specific
  information on how to solve specific problems using functional
  programming. These talks focus on concrete examples, but provide
  useful information for developers working on different projects or in
  different contexts.

  Examples:
  - "How I made Haskell an extension language for SAP R/3."
  - "How I replaced /sbin/init by a Scheme program."
  - "How I hooked up my home appliances to an Erlang control system."
  - "How I got an SML program to drive my BMW."

General language tutorials
  Half-day general language tutorials for specific functional
  languages, given by recognized experts for the respective languages.

Technology tutorials Half-day tutorials on techniques, technologies,
  or solving specific problems in functional programming

  such as:
  - how to make the best use of specific FP programming techniques
  - how to inject FP into a development team used to more conventional
    technologies
  - how to connect FP to existing libraries / frameworks / platforms
  - how to deliver high-performance systems with FP
  - how to deliver high-reliability systems with FP

Remember that your audience will include computing professionals who
are not academics and who may not already be experts on functional
programming.

Presenters of tutorials will receive free registration to ICFP 2008.

Submission guidelines

Submit a proposal of 150 words or less for either a 45-minute talk
with a short Q&A session at the end, or a 300-word-or-less proposal
for a 3-hour tutorial, where you present your material, but also give
participants a chance to practice it on their own laptops.

Some advice:
- Give it a simple and straightforward title or name; avoid fancy
  titles or puns that would make it harder for attendees to figure out
  what you'll be talking about.
- Clearly identify the level of the talk: What knowledge should people
  have when they come to the presentation or tutorial?
- Explain why people will want to attend:
  is the language or library useful for a wide range of attendees? Is
  the pitfall you're identifying common enough that a wide range of
  attendees is likely to encounter it?
- Explain what benefits attendees are expected to take home to their
  own projects.
- For a tutorial, explain how you want to structure the time, and what
  you expect to have attendees to do on their laptops. List what
  software you'll expect attendees to have installed prior to coming.

Submit your proposal in plain text electronically to
defun-2008-submission-AT-deinprogramm.de by the beginning of Friday,
June 27, Universal Coordinated Time.

Organizers
Kathleen Fisher         AT&T Labs
Simon Peyton Jones      Microsoft Research
Mike Sperber (co-chair) DeinProgramm
Don Stewart (co-chair)  Galois
From t.h at gmx.info  Sun Apr  6 08:07:22 2008
From: t.h at gmx.info (Timo B. =?utf-8?q?H=C3=BCbel?=)
Date: Sun Apr  6 08:03:23 2008
Subject: [Haskell] ANN: Hayoo! beta 0.1
Message-ID: <200804061407.22507.t.h@gmx.info>

Hello,

we are pleased to announce the first beta release of Hayoo!, a Haskell API 
search engine providing advanced features like suggestions, find-as-you-type, 
fuzzy queries and much more.

Visit Hayoo! here: http://holumbus.fh-wedel.de/hayoo

Please bear in mind that this is still a beta release and we are continuously 
working on further improvements. Our plans for the future include:

- Covering all documentation available at Hackage.
- Compatibility with non-JavaScript enabled browsers.
- Providing a web interface where people can point Hayoo! to an URI linking
  to Haddock documentation which will be automatically included in Hayoo!.

Hayoo! was developed as a use-case for the Holumbus framework, which aims to 
help at the creation of very flexible and highly specialized search engines.

Although Holumbus is still under heavy development and we have no official 
release yet, some informations and a Darcs repository are available at the 
Holumbus homepage: http://holumbus.fh-wedel.de

Any suggestions and feedback is highly welcomed.

Cheers,
Timo B. H?bel & Sebastian M. Schlatt
From batterseapower at hotmail.com  Sun Apr  6 16:09:46 2008
From: batterseapower at hotmail.com (Max Bolingbroke)
Date: Sun Apr  6 16:05:32 2008
Subject: [Haskell] ANN: Hayoo! beta 0.1
In-Reply-To: <200804061407.22507.t.h@gmx.info>
References: <200804061407.22507.t.h@gmx.info>
Message-ID: <9d4d38820804061309g7f906d69w5a90736fad2b99de@mail.gmail.com>

On 06/04/2008, Timo B. H?bel <t.h@gmx.info> wrote:
> Hello,
>
>  we are pleased to announce the first beta release of Hayoo!, a Haskell API
>  search engine providing advanced features like suggestions, find-as-you-type,
>  fuzzy queries and much more.

Very nice!

I'm not sure if this is documented or not, but for those interested in
creating a search template for Firefox, Quicksilver and the like, it
is possible to use a URL such as this to enter a search term:

http://holumbus.fh-wedel.de/hayoo/hayoo.html?query=catmaybes

Cheers,
Max
From igloo at earth.li  Sun Apr  6 18:50:02 2008
From: igloo at earth.li (Ian Lynagh)
Date: Sun Apr  6 18:45:51 2008
Subject: [Haskell] ANNOUNCE: Well-Typed LLP - The Haskell Consultants
Message-ID: <20080406225002.GA15145@matrix.chaos.earth.li>


Fellow Haskellers,

We (Bj?rn Bringert, Duncan Coutts and Ian Lynagh) are pleased to
announce that we have recently set up a Haskell consultancy company,
Well-Typed LLP (http://www.well-typed.com/).

Our services include application development, library and tool
maintenance, project advice, and training. Please see our website or
drop us an e-mail for more details.

We look forward to hearing from you in the future!


-- 
Bj?rn Bringert, Duncan Coutts, Ian Lynagh
http://www.well-typed.com/  info@well-typed.com

From nominolo at googlemail.com  Sun Apr  6 19:15:44 2008
From: nominolo at googlemail.com (Thomas Schilling)
Date: Sun Apr  6 19:11:33 2008
Subject: [Haskell] REMINDER: Next Hackathon (Hac4) starts in 4 days
Message-ID: <405BB5B0-08E4-4A3A-8061-E680B0D045C3@googlemail.com>

Hi Haskell Hackers!

There are only 4 days left until the fourth Hackathon (http:// 
www.haskell.org/haskellwiki/Hac4) at Chalmers University in  
Gothenburg, Sweden.

If you haven't registered, yet, please do so now!

     Registration deadline:  Tuesday, April 8, 2008

To register, go to http://www.haskell.org/haskellwiki/Hac4/Register  
and follow the steps.

For all those already registered, here's a short (not nearly  
complete) checklist:

* Make sure you have an account on code.haskell.org.  (See http:// 
www.haskell.org/haskellwiki/Hac4/Projects for how to do that.)

* Decide what to work on if you haven't yet.  (See http:// 
www.haskell.org/haskellwiki/Hac4/Projects for ideas.)

* Make sure your laptop is working and that you take all required  
extra equipment.  (If your wireless driver sucks, we can probably  
find some cables and a switch here.)

* It would be good to have all the code you want to work on already  
on your computer.  Also make sure it builds with your compiler  
version.  If your distro doesn't have binaries, maybe install some  
software in advance, like Gobby or profiled versions of GHC, newest  
version of gtk2hs or whatever seems appropriate.  It would just be a  
shame to waste hours of precious hacking time.

* Make a backup.  Just in case. ;)

* Many hostels want a confirmation a few days before arrival, don't  
forget.

* If you need some phone numbers of locals, check the wiki site, if  
you need some more help from us locals, you can ask us at our IRC  
channel #haskell-hac4.


We're looking forward to a fun weekend!

/ The Hac4 Team

From andreas.abel at ifi.lmu.de  Mon Apr  7 05:13:49 2008
From: andreas.abel at ifi.lmu.de (Andreas Abel)
Date: Mon Apr  7 05:09:30 2008
Subject: [Haskell] LFMTP'08: 2nd Call for Papers
Message-ID: <47F9E5CD.60407@ifi.lmu.de>

Update:
- invited speaker: Dale Miller
- submission server now open (abstract deadline: 14 April)


     International Workshop on Logical Frameworks and Meta-Languages:
     Theory and Practice (LFMTP'08)
                   http://www4.in.tum.de/~lfmtp

               Pittsburgh, PA, USA, 23 June 2008
         Affiliated with Logic in Computer Science (LICS 2008)

                        2nd CALL FOR PAPERS

Important dates:
---------------------------------------------------------------------
Abstract submission:     14 April 2008
Paper submission:        21 April 2008
Author notification:     19 May 2008
Final version:            2 June 2008
Workshop day:            23 June 2008
---------------------------------------------------------------------

The LFMTP workshop continues the International workshop on Logical
Frameworks and Meta-languages (LFM) and the MERLIN workshop on
MEchanized Reasoning about Languages with variable BIndingIN.

Logical frameworks and meta-languages form a common substrate for
representing, implementing, and reasoning about a wide variety of
deductive systems of interest in logic and computer science. Their
design and implementation on the one hand and their applications in
for example proof-carrying code have been the focus of considerable
research over the last two decades. This workshop will bring together
designers, implementors, and practitioners to discuss all aspects of
logical frameworks and variable binding.

The broad subject areas of LFMTP'08 are:

* The automation and implementation of the meta-theory of programming
   languages and related calculi, particularly work which involves
   variable binding and fresh name generation.
* The theoretical and practical issues concerning the encoding of
   variable binding and fresh name generation, especially the
   representation of, and reasoning about, datatypes defined from binding
   signatures.
* Case studies of meta-programming, and the mechanization of the
   (meta)theory of descriptions of programming languages and other
   calculi.  Papers focusing on logic translations and on experiences
   with encoding programming languages theory are particularly welcome.

Topics include, but are not limited to

     * logical framework design
     * meta-theoretic analysis
     * applications and comparative studies
     * implementation techniques
     * efficient proof representation and validation
     * proof-generating decision procedures and theorem provers
     * proof-carrying code
     * substructural frameworks
     * semantic foundations
     * methods for reasoning about logics
     * formal digital libraries

Invited Speaker:

Dale Miller         (Laboratoire d'Informatique, INRIA Saclay)

Program Committee:

Andreas Abel        (LMU Munich)
Peter Dybjer        (Chalmers University of Technology)
Alberto Momigliano  (University of Edinburgh)
Brigitte Pientka    (McGill University)
Randy Pollack       (University of Edinburgh)
Carsten Schuermann  (IT University of Copenhagen)
Peter Sewell        (University of Cambridge)
Aaron Stump         (Washington University)
Christian Urban     (TU Munich)

Three categories of papers are solicited:

   * Category A: Detailed and technical accounts of new research: up
     to fifteen pages including bibliography.
   * Category B: Shorter accounts of work in progress and proposed
     further directions, including discussion papers: up to eight
     pages including bibliography and appendices.
   * Category C: System descriptions presenting an implemented tool
     and its novel features: up to six pages. A demonstration is
     expected to accompany the presentation.

Submission is electronic.  Authors are required to submit a paper
title and a short abstract of about 100 words before submitting the
paper.

Papers are to be submitted in postscript or PDF format and must
conform to the ENTCS style preferably using LaTeX2e. For further
information and submission instructions, see the LFMTP web page:
http://www4.in.tum.de/~lfmtp

Proceedings are to be published as a volume in the Electronic Notes in
Theoretical Computer Science (ENTCS) series and will be available to
participants at the workshop.

Authors of accepted papers are expected to present their paper at
the workshop.

The organizers:

Andreas Abel                           Christian Urban		
Theoretical Computer Science	       Institute for Computer Science
Ludwig-Maximilians-University Munich   Technical University of Munich
Email: andreas.abel@ifi.lmu.de         Email: urbanc@in.tum.de

-- 
Andreas Abel  <><      Du bist der geliebte Mensch.

Theoretical Computer Science, University of Munich
http://www.tcs.informatik.uni-muenchen.de/~abel/


From john.tromp at gmail.com  Mon Apr  7 15:11:16 2008
From: john.tromp at gmail.com (John Tromp)
Date: Mon Apr  7 15:06:57 2008
Subject: [Haskell] making inits less strict
In-Reply-To: <mailman.4117.1207594843.31811.haskell@haskell.org>
References: <mailman.4117.1207594843.31811.haskell@haskell.org>
Message-ID: <fd4251220804071211x5f5695e9l8d9e09ad71e60046@mail.gmail.com>

The standard definition of inits:

  inits []     =  [[]]
  inits (x:xs) =  [[]] ++ map (x:) (inits xs)

is unnecessarily strict, evaluating its argument
before yielding the initial [] of the result.
An improved version is:

  inits l = [] : case l of []     -> []
                           (x:xs) -> map (x:) inits xs

 This allows one to define for instance
   nats = map length (inits nats)
 which loops for the standard definition.

 regards,
 -John
From oleg at okmij.org  Mon Apr  7 22:28:14 2008
From: oleg at okmij.org (oleg@okmij.org)
Date: Mon Apr  7 22:24:36 2008
Subject: [Haskell] Continuation Fest 2008: Call for Participation
Message-ID: <20080408022814.26982A99B@Adric.metnet.fnmoc.navy.mil>


[Conrad Parker's presentation below will talk about continuations in Haskell]

	Continuation Fest 2008: Call for Participation
	http://logic.cs.tsukuba.ac.jp/Continuation/

Date: Sunday April 13, 2008.
Place: Akihabara-Daibiru Building, 13th Floor, Tokyo, Japan.
       (Akihabara Site of the University of Tokyo,
        http://www.i.u-tokyo.ac.jp/map/index_e.shtml#aki)

Program (tentative):

    13:00-13:05  Opening

    Session 1. Demonstrating continuations
    13:05-13:45  Kenichi Asai (Ochanomizu)
                 Typing printf 
    13:45-14:25  Oleg Kiselyov 
                 Demo of persistent delimited continuations in OCaml
                 for nested web transactions
    (break)

    Session 2. Applying continuations
    14:35-15:05  Katsutoshi Itoh (Kahua project)
                 Various use of continuations in Kahua
                 - Application in practical web programming experience
    15:05-15:35  Rui Otake (Tohoku)
                 Delimited continuations in the grammar of Japanese
    15:35-16:00  Conrad Parker (Kyoto)
                 Continuations for video decoding and scrubbing
    16:00-16:25  Takuo Watanabe (Titech) and Yuichi Tanaka 
                 Continuing from the past: An approach to building
                 dynamically upgradable applications
    (break)

    Session 3. Implementing continuations
    16:35-17:15  Shinji Kono (Ryukyu)
                 How to implement continuation only language in gcc 4.x
    17:15-17:55  Koichi Sasada (Tokyo)
                 Ruby Continuations

    17:55-18:00  Closing

    18:30-      Dinner

Participation:
	No registration or participation fee is needed to attend
	Continuation Fest except the dinner.
	Those who join the dinner are encouraged to send an e-mail 
	to the organizer by April 11th.

Program committee:
	Chris Barker (New York), Shiro Kawai (Scheme Arts),
	Oleg Kiselyov (FNMOC), Chung-chieh Shan (Chair, Rutgers),
	Taiichi Yuasa (Kyoto)

Organizers:
	Kenichi Asai (Ochanomizu), Yukiyoshi Kameyama (Chair, Tsukuba),
	Takahiro Kido (shelarcy)

Inquiries:
	CF2008@logic.cs.tsukuba.ac.jp
From simonpj at microsoft.com  Tue Apr  8 03:37:27 2008
From: simonpj at microsoft.com (Simon Peyton-Jones)
Date: Tue Apr  8 03:33:09 2008
Subject: [Haskell] FW: [TYPES/announce] DEFUN08: Call for Talks & Tutorials
 (co-located w/	ICFP08)
Message-ID: <638ABD0A29C8884A91BC5FB5C349B1C32AE39A2252@EA-EXMSG-C334.europe.corp.microsoft.com>

Folks,

ICFP is growing a Functional Programming Developer Conference!  It'll sit back-to-back with ICFP, with the Commercial Users of Functional Programming workshop as part of it.

As well as CUFP, though, there'll be tutorials and presentations about
        libraries
        tools
        programming techniques

The call below invites you to offer such a talk or tutorial.   More details below.  You don't have to write a paper -- you just have to have a cool and *useful* library or tool that you'd like to show to others.

Step up!  Deadline for offers is 27 June, so you have time.  But don't leave it too long.

Simon


                     Call for Talks and Tutorials
     ACM SIGPLAN 2008 Developer Tracks on Functional Programming
                http://www.deinprogramm.de/defun-2008/
             Victoria, BC, Canada, 25, 27 September, 2008
       The workshop will be held in conjunction with ICFP 2008.
               http://www.icfpconference.org/icfp2008/

Important dates

Proposal Deadline: June 27, 2008, 0:00 UTC
Notification:      July 14, 2008

DEFUN 2008 invites functional programmers who know how to solve
problems with functional prorgamming to give talks and lead tutorials
at the The ICFP Developer Tracks.

We want to know about your favorite programming techniques, powerful
libraries, and engineering approaches you've used that the world
should know about and apply to other projects. We want to know how to
be productive using functional programming, write better code, and
avoid common pitfals.

We invite proposals for presentations in the following categories:

How-to talks: 45-minute "how-to" talks that provide specific
  information on how to solve specific problems using functional
  programming. These talks focus on concrete examples, but provide
  useful information for developers working on different projects or in
  different contexts.

  Examples:
  - "How I made Haskell an extension language for SAP R/3."
  - "How I replaced /sbin/init by a Scheme program."
  - "How I hooked up my home appliances to an Erlang control system."
  - "How I got an SML program to drive my BMW."

General language tutorials
  Half-day general language tutorials for specific functional
  languages, given by recognized experts for the respective languages.

Technology tutorials Half-day tutorials on techniques, technologies,
  or solving specific problems in functional programming

  such as:
  - how to make the best use of specific FP programming techniques
  - how to inject FP into a development team used to more conventional
    technologies
  - how to connect FP to existing libraries / frameworks / platforms
  - how to deliver high-performance systems with FP
  - how to deliver high-reliability systems with FP

Remember that your audience will include computing professionals who
are not academics and who may not already be experts on functional
programming.

Presenters of tutorials will receive free registration to ICFP 2008.

Submission guidelines

Submit a proposal of 150 words or less for either a 45-minute talk
with a short Q&A session at the end, or a 300-word-or-less proposal
for a 3-hour tutorial, where you present your material, but also give
participants a chance to practice it on their own laptops.

Some advice:
- Give it a simple and straightforward title or name; avoid fancy
  titles or puns that would make it harder for attendees to figure out
  what you'll be talking about.
- Clearly identify the level of the talk: What knowledge should people
  have when they come to the presentation or tutorial?
- Explain why people will want to attend:
  is the language or library useful for a wide range of attendees? Is
  the pitfall you're identifying common enough that a wide range of
  attendees is likely to encounter it?
- Explain what benefits attendees are expected to take home to their
  own projects.
- For a tutorial, explain how you want to structure the time, and what
  you expect to have attendees to do on their laptops. List what
  software you'll expect attendees to have installed prior to coming.

Submit your proposal in plain text electronically to
defun-2008-submission-AT-deinprogramm.de by the beginning of Friday,
June 27, Universal Coordinated Time.

Organizers
Kathleen Fisher         AT&T Labs
Simon Peyton Jones      Microsoft Research
Mike Sperber (co-chair) DeinProgramm
Don Stewart (co-chair)  Galois
From wss at Cs.Nott.AC.UK  Tue Apr  8 06:56:26 2008
From: wss at Cs.Nott.AC.UK (Wouter Swierstra)
Date: Tue Apr  8 06:57:38 2008
Subject: [Haskell] ANN: The Monad.Reader Issue 10
Message-ID: <E4AD27CF-B785-4A76-B3F3-B7ABD6300F43@cs.nott.ac.uk>


I am pleased to announce that a new issue of The Monad.Reader is now  
available:

   http://www.haskell.org/haskellwiki/The_Monad.Reader

Issue 10 consists of the following two articles:

  * Bernie Pope
	Step inside the GHCi debugger

  * Matthew Naylor
	Evaluating Haskell in Haskell

The Monad.Reader is a quarterly magazine about functional programming.  
It is less formal than a journal, but somehow more enduring than a  
wiki page or blog post.

If you'd like to write something for the next issue of The  
Monad.Reader, please get in touch. I haven't fixed the deadline for  
the next issue just yet. I hope to send out an official call for copy  
fairly soon.

  Wouter


This message has been checked for viruses but the contents of an attachment
may still contain software viruses, which could damage your computer system:
you are advised to perform your own checks. Email communications with the
University of Nottingham may be monitored as permitted by UK legislation.

From andres at cs.uu.nl  Tue Apr  8 09:26:48 2008
From: andres at cs.uu.nl (Andres Loeh)
Date: Tue Apr  8 09:22:27 2008
Subject: [Haskell] Change of Editor HCAR (Haskell Communities and Activities
	Report)
Message-ID: <20080408132648.GD6419@cs.uu.nl>

Dear Haskellers.

The Haskell Communities and Activities Report (HCAR) for short is a
collection of status reports and news items from projects, groups,
companies, and individuals that appears twice per year.

As of now, the latest issue is from December 2007 and available from
http://haskell.org/communities. I have been the editor of the report for
the last six editions, and have recently been looking for a successor.
It is my pleasure to announce that

  Janis Voigtlaender, Technical University of Dresden

has declared himself willing to perform this task, starting with the
next issue, which will have a deadline very soon, probably in the
beginning of May. I want to use this opportunity to thank Janis for
accepting the responsibility and thereby helping to keep this valuable
information source alive. I also want to thank all the contributors to
the HCAR for supporting it during the past years and ask you to support
Janis in his job by submitting many new entries in time for the
deadline, as you usually did when I was the editor.

Cheers,
  Andres

-- 

Andres Loeh, Universiteit Utrecht

mailto:andres@cs.uu.nl     mailto:mail@andres-loeh.de
http://www.andres-loeh.de
From simonpj at microsoft.com  Tue Apr  8 09:31:17 2008
From: simonpj at microsoft.com (Simon Peyton-Jones)
Date: Tue Apr  8 09:26:59 2008
Subject: [Haskell] Change of Editor HCAR (Haskell Communities and
	Activities	Report)
In-Reply-To: <20080408132648.GD6419@cs.uu.nl>
References: <20080408132648.GD6419@cs.uu.nl>
Message-ID: <638ABD0A29C8884A91BC5FB5C349B1C32AE39A2667@EA-EXMSG-C334.europe.corp.microsoft.com>

Well done Janis!

And a massive thank you to you, Andres.  You are a hero.

Simon

| -----Original Message-----
| From: haskell-bounces@haskell.org [mailto:haskell-bounces@haskell.org] On Behalf Of Andres Loeh
| Sent: 08 April 2008 14:27
| To: haskell@haskell.org
| Subject: [Haskell] Change of Editor HCAR (Haskell Communities and Activities Report)
|
| Dear Haskellers.
|
| The Haskell Communities and Activities Report (HCAR) for short is a
| collection of status reports and news items from projects, groups,
| companies, and individuals that appears twice per year.
|
| As of now, the latest issue is from December 2007 and available from
| http://haskell.org/communities. I have been the editor of the report for
| the last six editions, and have recently been looking for a successor.
| It is my pleasure to announce that
|
|   Janis Voigtlaender, Technical University of Dresden
|
| has declared himself willing to perform this task,
From venanzio at cs.ru.nl  Wed Apr  9 02:37:54 2008
From: venanzio at cs.ru.nl (Venanzio Capretta)
Date: Wed Apr  9 03:32:14 2008
Subject: [Haskell] MSFP deadline extension
Message-ID: <47FC6442.5070802@cs.ru.nl>

We are glad to announce that the deadline for the workshop
MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING
has been extended by a week:

Submission of abstracts: 11 April
Submission of papers: 18 April

Information about the workshop and the submission procedure can be found 
at: http://msfp.org.uk/

Venanzio Capretta
Conor McBride


From P.Achten at cs.ru.nl  Thu Apr 10 09:55:01 2008
From: P.Achten at cs.ru.nl (Peter Achten)
Date: Thu Apr 10 10:08:30 2008
Subject: [Haskell] First Call for Participation TFP 2008, The Netherlands
Message-ID: <47FE1C35.5050601@cs.ru.nl>

FIRST CALL FOR PARTICIPATION
TRENDS IN FUNCTIONAL PROGRAMMING 2008
RADBOUD UNIVERSITY NIJMEGEN, THE NETHERLANDS
MAY 26-28, 2008
INVITED SPEAKER: PROF. HENK BARENDREGT
http://www.st.cs.ru.nl/AFP_TFP_2008/

[ EARLY REGISTRATION CLOSES AT MONDAY MAY 14 ]

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
through acceptance by extended abstracts and full papers. A formal
post-symposium refereeing process selects the best articles presented
at the symposium for publication in a high-profile volume.

TFP 2008 is hosted by the Radboud University Nijmegen, The Netherlands,
and will be held in the rural setting of Center Parcs ?Het Heijderbos?,
Heijen (in the vicinity of Nijmegen), The Netherlands.

TFP 2008 is co-located with the 6th Int?l. Summer School on Advanced
Functional Programming (AFP?08), which is held immediately before TFP?08.


PROGRAM INFORMATION
We have selected papers in the following themes:

(*) Types
(*) Applications
(*) Parallellism
(*) Refactoring
(*) Reactive Systems
(*) Memory Analysis
(*) Software Construction & Program Transformation
(*) Reasoning

The preliminary program can be found on the site:

http://www.st.cs.ru.nl/AFP_TFP_2008/documents/preliminary_program_TFP_2008.pdf



VENUE INFORMATION
TFP (and AFP) is held in The Netherlands, at Center Parcs ?Het
Heijderbos? which is a holiday resort in the woodlands near the
city of Nijmegen. We accomodate participants in DeLuxe Cottages,
each of which has three separate bed-rooms, shared bathroom,
toilet, kitchen, and terrace. Cottages will be shared by three
participants. If you wish to reduce costs, you can choose to
share a bedroom. The summer school and symposium will take place
in the business center of the venue. Breakfast, lunch and diner
is included within the limits of the venue. The resort features,
amongst others, a sub-tropical swimming pool (free for
participants), restaurants, shops, water sports lake, midget golf
court, squash court, and outdoor and indoor tennis courts.

Nijmegen is considered to be the oldest city of the Netherlands,
being approximately 2000 years old. Nijmegen is located at the
east border of the Netherlands, near Germany. Nijmegen can be
reached easily from several airports such as Schiphol airport,
Eindhoven airport, and D?sseldorf airport, as well as by train
and car. Conveniently close to Center Parcs ?Het Heijderbos? you
will find airport Weeze in Germany. The venue Center Parcs ?Het
Heijderbos? can be reached from Nijmegen by train to Boxmeer
(25 minutes). From there you will need to order a taxi. The venue
can also be reached by car: parking is free for participants of
AFP and TFP.


SYMPOSIUM FEES
TFP 2008 includes accommodation, symposium, breakfast ? lunch ?
diner, proceedings, and social event costs. The early registration fee
is ? 595; the late registration fee is ? 695. For details, we refer
to the site (see above). During the social event we will visit
Nijmegen and have a symposium diner at the river-side of De Waal.


REGISTRATION INFORMATION
Early registration is still possible until april 15 2008. Late
registration opens at april 15 2008. Registration closes at may 5 2008.
We can not guarantee accommodation in case you wish to register later
than may 5 2008. Registration can be done on-line at the site:

http://www.st.cs.ru.nl/AFP_TFP_2008/#RegistrationInformation


IMPORTANT DATES (ALL 2008)
Early Registration Deadline: April 14
Late Registration Opens: April 15
Late Registration Deadline: May 5
TFP Symposium: May 26-28


PROGRAMME COMMITTEE
Peter Achten (co-chair) Radboud Univ. Nijmegen, NL
Andrew Butterfield Trinity College, IE
Manuel Chakravarty Univ. of New South Wales, AU
John Clements Cal Poly State Univ., USA
Matthias Felleisen Northeastern Univ., USA
Jurriaan Hage Utrecht Univ., NL
Michael Hanus Christian-Albrechts Univ. zu Kiel, DE
Ralf Hinze Univ. of Oxford, UK
Graham Hutton Univ. of Nottingham, UK
Johan Jeuring Utrecht Univ., NL
Pieter Koopman (co-chair) Radboud Univ. Nijmegen, NL
Shriram Krishnamurthi Brown Univ., USA
Hans-Wolfgang Loidl Ludwig-Maximilians Univ.M?nchen, DE
Rita Loogen Philipps-Univ. Marburg, DE
Greg Michaelson Heriot-Watt Univ., UK
Marco T. Moraz?n (symp. chair) Seton Hall Univ., USA
Sven-Bodo Scholz Univ. of Hertfordshire, UK
Ulrik Schultz Univ. of Southern Denmark, DK
Clara Segura Univ. Complutense de Madrid, ES
Olin Shivers Northeastern Univ., USA
Phil Trinder Heriot-Watt Univ., UK
Varmo Vene Univ. of Tartu, EE
Vikt?ria Zs?k E?tv?s Lor?nd Univ., HU


ORGANIZATION
Symposium Chair: Marco T. Moraz?n, Seton Hall University, USA
Programme Chair: Peter Achten, Pieter Koopman,
Radboud University Nijmegen, NL
Treasurer: Greg Michaelson, Heriot-Watt University, UK

From P.Achten at cs.ru.nl  Thu Apr 10 10:10:29 2008
From: P.Achten at cs.ru.nl (Peter Achten)
Date: Thu Apr 10 10:09:42 2008
Subject: [Haskell] Third Call for Participation AFP 2008
Message-ID: <47FE1FD5.7000706@cs.ru.nl>

3RD CALL FOR PARTICIPATION
6TH INTERNATIONAL SUMMER SCHOOL ON ADVANCED FUNCTIONAL PROGRAMMING 2008 
(AFP ?08)
RADBOUD UNIVERSITY NIJMEGEN AND UTRECHT UNIVERSITY, THE NETHERLANDS
MAY 19-24, 2008
http://www.st.cs.ru.nl/AFP_TFP_2008/
[ EARLY REGISTRATION CLOSES ON MONDAY MAY 14 ]

AFP is a series of international summer schools which aims to
bring computer scientists, in particular young researchers and
programmers, up to date with the latest advances in practical
advanced functional programming. Functional programming
emphasizes the evaluation of expressions rather than the
execution of commands. We focus on functional programming
techniques in ?programming in the real world? and bridge the
gap between results presented at programming conferences and
material from textbooks on functional programming. In this
school you will receive in depth lectures about advanced
functional programming techniques, taught by experts in the
field. Lectures are accompanied by practical problems to be
solved by the students at the school.

AFP 2008 is hosted by the Radboud University Nijmegen, and
Utrecht University, The Netherlands, and will be held in the
rural setting of Center Parcs ?Het Heijderbos?, Heijen (in the
vicinity of Nijmegen), The Netherlands.

AFP 2008 is co-located with the 9th Symposium on Trends in
Functional Programming (TFP?08), which is held after AFP?08.


PROGRAM INFORMATION
The following speakers will give the lectures (in alphabetic
order):
Umut Acar (Toyota Technological Institute,
University of Chicago, US)
Richard Bird (University of Oxford, UK)
Olivier Danvy (University of Aarhus, DK)
Johan Jeuring (Utrecht University, NL)
Mark Jones (Portland State University, US)
Ulf Norell (Chalmers University, SE)
Simon Peyton Jones (Microsoft Research, UK)
Rinus Plasmeijer (Radboud University Nijmegen, NL)

During the summer school, all participants receive printed
lecture notes. Participants are expected to have a notebook,
in order to be able to participate with the practical problems.

After the summer school, all lecture notes will be revised,
reviewed, and published in the LNCS series of Springer. All
registered participants receive a copy of these lecture notes.


VENUE INFORMATION
AFP (and TFP) is held in The Netherlands, at Center Parcs ?Het
Heijderbos? which is a holiday resort in the woodlands near the
city of Nijmegen. We accomodate participants in DeLuxe Cottages,
each of which has three separate bed-rooms, shared bathroom,
toilet, kitchen, and terrace. Cottages will be shared by three
participants. If you wish to reduce costs, you can choose to
share a bedroom. The summer school and symposium will take place
in the business center of the venue. Breakfast, lunch and diner
is included within the limits of the venue. The resort features,
amongst others, a sub-tropical swimming pool (free for
participants), restaurants, shops, water sports lake, midget golf
court, squash court, and outdoor and indoor tennis courts.

Nijmegen is considered to be the oldest city of the Netherlands,
being approximately 2000 years old. Nijmegen is located at the
east border of the Netherlands, near Germany. Nijmegen can be
reached easily from several airports such as Schiphol airport,
Eindhoven airport, and D?sseldorf airport, as well as by train
and car. Conveniently close to Center Parcs ?Het Heijderbos? you
will find airport Weeze in Germany. The venue Center Parcs ?Het
Heijderbos? can be reached from Nijmegen by train to Boxmeer
(25 minutes). From there you will need to order a taxi. The venue
can also be reached by car: parking is free for participants of
AFP and TFP.


SUMMER SCHOOL FEES
AFP 2008 includes accommodation, conference, breakfast ? lunch ?
diner, speakers, and proceedings costs. The early registration fee
is ? 995; the late registration fee is ? 1095.


REGISTRATION INFORMATION
You can still register early until monday april 14 2008. Late
registration opens at april 15 2008. Registration closes at may 5 2008.
We can not guarantee accommodation in case you wish to register later
than may 5 2008.


IMPORTANT DATES (ALL 2008)
Early Registration Deadline: April 14
Late Registration Opens: April 15
Late Registration Deadline: May 5
AFP Summer School: May 19-24


ORGANIZATION
Programme Chair: Rinus Plasmeijer, Pieter Koopman, Radboud
University Nijmegen, NL
Doaitse Swierstra, Utrecht University, NL
Arrangements: Peter Achten, Simone Meeuwsen, Radboud University
Nijmegen, NL
E-mail: afp_tfp_2008@cs.ru.nl

From P.Achten at cs.ru.nl  Thu Apr 10 15:04:41 2008
From: P.Achten at cs.ru.nl (Peter Achten)
Date: Thu Apr 10 15:18:01 2008
Subject: [Haskell] First Call for Participation TFP 2008,
 The Netherlands (correct early registration date)
Message-ID: <47FE64C9.8010600@cs.ru.nl>

FIRST CALL FOR PARTICIPATION
TRENDS IN FUNCTIONAL PROGRAMMING 2008
RADBOUD UNIVERSITY NIJMEGEN, THE NETHERLANDS
MAY 26-28, 2008
INVITED SPEAKER: PROF. HENK BARENDREGT
http://www.st.cs.ru.nl/AFP_TFP_2008/

[ EARLY REGISTRATION CLOSES AT MONDAY APRIL 14 ]
[ THIS IS THE CORRECT DATE ]

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
through acceptance by extended abstracts and full papers. A formal
post-symposium refereeing process selects the best articles presented
at the symposium for publication in a high-profile volume.

TFP 2008 is hosted by the Radboud University Nijmegen, The Netherlands,
and will be held in the rural setting of Center Parcs ?Het Heijderbos?,
Heijen (in the vicinity of Nijmegen), The Netherlands.

TFP 2008 is co-located with the 6th Int?l. Summer School on Advanced
Functional Programming (AFP?08), which is held immediately before TFP?08.


PROGRAM INFORMATION
We have selected papers in the following themes:

(*) Types
(*) Applications
(*) Parallellism
(*) Refactoring
(*) Reactive Systems
(*) Memory Analysis
(*) Software Construction & Program Transformation
(*) Reasoning

The preliminary program can be found on the site:

http://www.st.cs.ru.nl/AFP_TFP_2008/documents/preliminary_program_TFP_2008.pdf



VENUE INFORMATION
TFP (and AFP) is held in The Netherlands, at Center Parcs ?Het
Heijderbos? which is a holiday resort in the woodlands near the
city of Nijmegen. We accomodate participants in DeLuxe Cottages,
each of which has three separate bed-rooms, shared bathroom,
toilet, kitchen, and terrace. Cottages will be shared by three
participants. If you wish to reduce costs, you can choose to
share a bedroom. The summer school and symposium will take place
in the business center of the venue. Breakfast, lunch and diner
is included within the limits of the venue. The resort features,
amongst others, a sub-tropical swimming pool (free for
participants), restaurants, shops, water sports lake, midget golf
court, squash court, and outdoor and indoor tennis courts.

Nijmegen is considered to be the oldest city of the Netherlands,
being approximately 2000 years old. Nijmegen is located at the
east border of the Netherlands, near Germany. Nijmegen can be
reached easily from several airports such as Schiphol airport,
Eindhoven airport, and D?sseldorf airport, as well as by train
and car. Conveniently close to Center Parcs ?Het Heijderbos? you
will find airport Weeze in Germany. The venue Center Parcs ?Het
Heijderbos? can be reached from Nijmegen by train to Boxmeer
(25 minutes). From there you will need to order a taxi. The venue
can also be reached by car: parking is free for participants of
AFP and TFP.


SYMPOSIUM FEES
TFP 2008 includes accommodation, symposium, breakfast ? lunch ?
diner, proceedings, and social event costs. The early registration fee
is ? 595; the late registration fee is ? 695. For details, we refer
to the site (see above). During the social event we will visit
Nijmegen and have a symposium diner at the river-side of De Waal.


REGISTRATION INFORMATION
Early registration is still possible until april 15 2008. Late
registration opens at april 15 2008. Registration closes at may 5 2008.
We can not guarantee accommodation in case you wish to register later
than may 5 2008. Registration can be done on-line at the site:

http://www.st.cs.ru.nl/AFP_TFP_2008/#RegistrationInformation


IMPORTANT DATES (ALL 2008)
Early Registration Deadline: April 14
Late Registration Opens: April 15
Late Registration Deadline: May 5
TFP Symposium: May 26-28


PROGRAMME COMMITTEE
Peter Achten (co-chair) Radboud Univ. Nijmegen, NL
Andrew Butterfield Trinity College, IE
Manuel Chakravarty Univ. of New South Wales, AU
John Clements Cal Poly State Univ., USA
Matthias Felleisen Northeastern Univ., USA
Jurriaan Hage Utrecht Univ., NL
Michael Hanus Christian-Albrechts Univ. zu Kiel, DE
Ralf Hinze Univ. of Oxford, UK
Graham Hutton Univ. of Nottingham, UK
Johan Jeuring Utrecht Univ., NL
Pieter Koopman (co-chair) Radboud Univ. Nijmegen, NL
Shriram Krishnamurthi Brown Univ., USA
Hans-Wolfgang Loidl Ludwig-Maximilians Univ.M?nchen, DE
Rita Loogen Philipps-Univ. Marburg, DE
Greg Michaelson Heriot-Watt Univ., UK
Marco T. Moraz?n (symp. chair) Seton Hall Univ., USA
Sven-Bodo Scholz Univ. of Hertfordshire, UK
Ulrik Schultz Univ. of Southern Denmark, DK
Clara Segura Univ. Complutense de Madrid, ES
Olin Shivers Northeastern Univ., USA
Phil Trinder Heriot-Watt Univ., UK
Varmo Vene Univ. of Tartu, EE
Vikt?ria Zs?k E?tv?s Lor?nd Univ., HU


ORGANIZATION
Symposium Chair: Marco T. Moraz?n, Seton Hall University, USA
Programme Chair: Peter Achten, Pieter Koopman,
Radboud University Nijmegen, NL
Treasurer: Greg Michaelson, Heriot-Watt University, UK

From P.Achten at cs.ru.nl  Thu Apr 10 15:07:17 2008
From: P.Achten at cs.ru.nl (Peter Achten)
Date: Thu Apr 10 15:18:32 2008
Subject: [Haskell] Third Call for Participation AFP 2008 (correct date early
	registration)
Message-ID: <47FE6565.2030803@cs.ru.nl>

3RD CALL FOR PARTICIPATION
6TH INTERNATIONAL SUMMER SCHOOL ON ADVANCED FUNCTIONAL PROGRAMMING 2008 
(AFP ?08)
RADBOUD UNIVERSITY NIJMEGEN AND UTRECHT UNIVERSITY, THE NETHERLANDS
MAY 19-24, 2008
http://www.st.cs.ru.nl/AFP_TFP_2008/

[ EARLY REGISTRATION CLOSES ON MONDAY APRIL 14 ]
[ THIS IS THE CORRECT DATE ]

AFP is a series of international summer schools which aims to
bring computer scientists, in particular young researchers and
programmers, up to date with the latest advances in practical
advanced functional programming. Functional programming
emphasizes the evaluation of expressions rather than the
execution of commands. We focus on functional programming
techniques in ?programming in the real world? and bridge the
gap between results presented at programming conferences and
material from textbooks on functional programming. In this
school you will receive in depth lectures about advanced
functional programming techniques, taught by experts in the
field. Lectures are accompanied by practical problems to be
solved by the students at the school.

AFP 2008 is hosted by the Radboud University Nijmegen, and
Utrecht University, The Netherlands, and will be held in the
rural setting of Center Parcs ?Het Heijderbos?, Heijen (in the
vicinity of Nijmegen), The Netherlands.

AFP 2008 is co-located with the 9th Symposium on Trends in
Functional Programming (TFP?08), which is held after AFP?08.


PROGRAM INFORMATION
The following speakers will give the lectures (in alphabetic
order):
Umut Acar (Toyota Technological Institute,
University of Chicago, US)
Richard Bird (University of Oxford, UK)
Olivier Danvy (University of Aarhus, DK)
Johan Jeuring (Utrecht University, NL)
Mark Jones (Portland State University, US)
Ulf Norell (Chalmers University, SE)
Simon Peyton Jones (Microsoft Research, UK)
Rinus Plasmeijer (Radboud University Nijmegen, NL)

During the summer school, all participants receive printed
lecture notes. Participants are expected to have a notebook,
in order to be able to participate with the practical problems.

After the summer school, all lecture notes will be revised,
reviewed, and published in the LNCS series of Springer. All
registered participants receive a copy of these lecture notes.


VENUE INFORMATION
AFP (and TFP) is held in The Netherlands, at Center Parcs ?Het
Heijderbos? which is a holiday resort in the woodlands near the
city of Nijmegen. We accomodate participants in DeLuxe Cottages,
each of which has three separate bed-rooms, shared bathroom,
toilet, kitchen, and terrace. Cottages will be shared by three
participants. If you wish to reduce costs, you can choose to
share a bedroom. The summer school and symposium will take place
in the business center of the venue. Breakfast, lunch and diner
is included within the limits of the venue. The resort features,
amongst others, a sub-tropical swimming pool (free for
participants), restaurants, shops, water sports lake, midget golf
court, squash court, and outdoor and indoor tennis courts.

Nijmegen is considered to be the oldest city of the Netherlands,
being approximately 2000 years old. Nijmegen is located at the
east border of the Netherlands, near Germany. Nijmegen can be
reached easily from several airports such as Schiphol airport,
Eindhoven airport, and D?sseldorf airport, as well as by train
and car. Conveniently close to Center Parcs ?Het Heijderbos? you
will find airport Weeze in Germany. The venue Center Parcs ?Het
Heijderbos? can be reached from Nijmegen by train to Boxmeer
(25 minutes). From there you will need to order a taxi. The venue
can also be reached by car: parking is free for participants of
AFP and TFP.


SUMMER SCHOOL FEES
AFP 2008 includes accommodation, conference, breakfast ? lunch ?
diner, speakers, and proceedings costs. The early registration fee
is ? 995; the late registration fee is ? 1095.


REGISTRATION INFORMATION
You can still register early until monday april 14 2008. Late
registration opens at april 15 2008. Registration closes at may 5 2008.
We can not guarantee accommodation in case you wish to register later
than may 5 2008.


IMPORTANT DATES (ALL 2008)
Early Registration Deadline: April 14
Late Registration Opens: April 15
Late Registration Deadline: May 5
AFP Summer School: May 19-24


ORGANIZATION
Programme Chair: Rinus Plasmeijer, Pieter Koopman, Radboud
University Nijmegen, NL
Doaitse Swierstra, Utrecht University, NL
Arrangements: Peter Achten, Simone Meeuwsen, Radboud University
Nijmegen, NL
E-mail: afp_tfp_2008@cs.ru.nl

From demis at dimi.uniud.it  Fri Apr 11 11:49:55 2008
From: demis at dimi.uniud.it (demis@dimi.uniud.it)
Date: Fri Apr 11 11:46:21 2008
Subject: [Haskell] 2nd CFP: 4th Int'l Workshop on Automated Specification
	and Verification of Web Systems (WWV'08)
Message-ID: <20080411154955.6875A3FC210@sole.dimi.uniud.it>

Skipped content of type multipart/alternative
From thomas at cs.ru.nl  Sat Apr 12 08:39:23 2008
From: thomas at cs.ru.nl (Thomas van Noort)
Date: Sat Apr 12 08:34:51 2008
Subject: [Haskell] ANNOUNCE: Generic Haskell 1.80 (Emerald)
Message-ID: <49766.82.157.212.81.1208003963.squirrel@squirrel.science.ru.nl>

             Generic Haskell version 1.80 (Emerald)
             ======================================

We are happy to announce the fifth release of Generic Haskell,
an extension of Haskell that facilitates generic programming.

Generic Haskell includes the following features:

* type-indexed values -- generic functions that can be
   instantiated on all Haskell data types.

* type-indexed types -- types which are indexed over the type
   constructors underlying Haskell datatypes.

The Generic Haskell compiler takes Generic Haskell source
and produces Haskell code.


Changes since 1.62 (Diamond)
----------------------------

* Generic views for generic types [1] are now supported.

* The implementation of type-indexed types is improved.


Download
--------

The Generic Haskell compiler is available in source and binary
distributions. Binaries for Linux, Windows, and MacOSX
are available. These are available from:

     http://www.generic-haskell.org/compiler.html

The documentation is also available separately from that page.

For more general information, point your browser to:

     http://www.generic-haskell.org


Why Generic Haskell?
--------------------

Software development often consists of designing datatypes, around which
functionality is added.  Some functionality is datatype
specific, whereas other functionality is defined on almost all
datatypes in such a way that it depends only on the structure of the
datatype.  A function that works on many datatypes in this way
is called a generic function.  Examples of generic functionality
include editing, pretty-printing or storing a value in a database, and
comparing two values for equality.

Since datatypes often change and new datatypes are introduced, we
have developed Generic Haskell, an extension of the functional
programming language Haskell that supports generic definitions,
to save the programmer from (re)writing instances of generic
functions. The original design of Generic Haskell is based on work by Ralf
Hinze.

   Pleasant programming,
   The Generic Haskell Team at Utrecht University

   info@generic-haskell.org

[1] Thomas van Noort. Generic views for generic types. Master's thesis,
Utrecht University, 2008.

From pablo at babel.ls.fi.upm.es  Sat Apr 12 09:34:28 2008
From: pablo at babel.ls.fi.upm.es (Pablo Nogueira)
Date: Sat Apr 12 09:29:53 2008
Subject: [Haskell] Re: [Haskell-cafe] ANNOUNCE: Generic Haskell 1.80
	(Emerald)
In-Reply-To: <49768.82.157.212.81.1208003974.squirrel@squirrel.science.ru.nl>
References: <49768.82.157.212.81.1208003974.squirrel@squirrel.science.ru.nl>
Message-ID: <ae151f40804120634q54819390j20ec0c1ad66bfc87@mail.gmail.com>

On 12/04/2008, Thomas van Noort <thomas@cs.ru.nl> wrote:

>  Generic Haskell includes the following features:
>
>  * type-indexed values -- generic functions that can be
>    instantiated on all Haskell data types.
                               ^^^

I have perused the manual and wonder if parametric types with class
constraints are now supported or are not considered Haskell types. I'm
thinking of types such as

data Ord a => BinTree a = Leaf | Node a (BinTree a) (BinTree a)
data Functor f => GRose f a = GLeaf | GNode a (f(GTree f a))
From thomas at cs.ru.nl  Sat Apr 12 11:12:21 2008
From: thomas at cs.ru.nl (Thomas van Noort)
Date: Sat Apr 12 11:23:01 2008
Subject: [Haskell] Re: [Haskell-cafe] ANNOUNCE: Generic Haskell 1.80
	(Emerald)
In-Reply-To: <ae151f40804120634q54819390j20ec0c1ad66bfc87@mail.gmail.com>
References: <49768.82.157.212.81.1208003974.squirrel@squirrel.science.ru.nl>
	<ae151f40804120634q54819390j20ec0c1ad66bfc87@mail.gmail.com>
Message-ID: <50032.82.157.212.81.1208013141.squirrel@squirrel.science.ru.nl>

That's a good question. Unfortunately, only Haskell98 types are currently
supported by the Generic Haskell compiler.

But at first sight, implementing support for parametric types with class
constraints is not too hard. Class constraints of a parametric type need
to be propagated to its generated structure type.

Regards,
Thomas

> On 12/04/2008, Thomas van Noort <thomas@cs.ru.nl> wrote:
>
>>  Generic Haskell includes the following features:
>>
>>  * type-indexed values -- generic functions that can be
>>    instantiated on all Haskell data types.
>                                ^^^
>
> I have perused the manual and wonder if parametric types with class
> constraints are now supported or are not considered Haskell types. I'm
> thinking of types such as
>
> data Ord a => BinTree a = Leaf | Node a (BinTree a) (BinTree a)
> data Functor f => GRose f a = GLeaf | GNode a (f(GTree f a))
>

From pablo at babel.ls.fi.upm.es  Sat Apr 12 13:14:19 2008
From: pablo at babel.ls.fi.upm.es (Pablo Nogueira)
Date: Sat Apr 12 13:09:44 2008
Subject: [Haskell] Re: [Haskell-cafe] ANNOUNCE: Generic Haskell 1.80
	(Emerald)
In-Reply-To: <50032.82.157.212.81.1208013141.squirrel@squirrel.science.ru.nl>
References: <49768.82.157.212.81.1208003974.squirrel@squirrel.science.ru.nl>
	<ae151f40804120634q54819390j20ec0c1ad66bfc87@mail.gmail.com>
	<50032.82.157.212.81.1208013141.squirrel@squirrel.science.ru.nl>
Message-ID: <ae151f40804121014y4d43a945qc8c4dd0118fc0a33@mail.gmail.com>

On 12/04/2008, Thomas van Noort <thomas@cs.ru.nl> wrote:

> That's a good question. Unfortunately, only Haskell98 types are currently
>  supported by the Generic Haskell compiler.

I thought constrained types were Haskell 98, but now I'm in doubt...

>  But at first sight, implementing support for parametric types with class
>  constraints is not too hard. Class constraints of a parametric type need
>  to be propagated to its generated structure type.

Certainly, but there are a few difficulties for higher-kinded types.
An arguable solution: http://portal.acm.org/citation.cfm?id=1159868

The reason I mention this is because Scrap your Boilerplate supports
them whereas GH does not, and I'm not aware this has been taken into
account when comparing these two approaches in the work cited by Bulat
on this thread.
From thomas at cs.ru.nl  Sat Apr 12 13:33:32 2008
From: thomas at cs.ru.nl (Thomas van Noort)
Date: Sat Apr 12 13:44:12 2008
Subject: [Haskell] Re: [Haskell-cafe] ANNOUNCE: Generic Haskell 1.80
	(Emerald)
In-Reply-To: <ae151f40804121014y4d43a945qc8c4dd0118fc0a33@mail.gmail.com>
References: <49768.82.157.212.81.1208003974.squirrel@squirrel.science.ru.nl>
	<ae151f40804120634q54819390j20ec0c1ad66bfc87@mail.gmail.com>
	<50032.82.157.212.81.1208013141.squirrel@squirrel.science.ru.nl>
	<ae151f40804121014y4d43a945qc8c4dd0118fc0a33@mail.gmail.com>
Message-ID: <50652.82.157.212.81.1208021612.squirrel@squirrel.science.ru.nl>

> On 12/04/2008, Thomas van Noort <thomas@cs.ru.nl> wrote:
>
>> That's a good question. Unfortunately, only Haskell98 types are
>> currently
>>  supported by the Generic Haskell compiler.
>
> I thought constrained types were Haskell 98, but now I'm in doubt...

I'm not 100% sure either, but according to the Haskell98 language report,
constrained types are not part of Haskell98,

http://haskell.org/onlinereport/basic.html ,

but are described as GHC language features,

http://www.haskell.org/ghc/docs/latest/html/users_guide/data-type-extensions.html

>
>>  But at first sight, implementing support for parametric types with
>> class
>>  constraints is not too hard. Class constraints of a parametric type
>> need
>>  to be propagated to its generated structure type.
>
> Certainly, but there are a few difficulties for higher-kinded types.
> An arguable solution: http://portal.acm.org/citation.cfm?id=1159868
>
> The reason I mention this is because Scrap your Boilerplate supports
> them whereas GH does not, and I'm not aware this has been taken into
> account when comparing these two approaches in the work cited by Bulat
> on this thread.
>

This has certainly been taken into account when comparing approaches to
generic programming. I quote from page 18/19 from the work you and Bulat
cited:

==
Full reflexivity. A generic programming language is fully reflexive if a
generic function can be used on any type that is definable in the
language. Generic Haskell is fully reflexive with respect to the types
that are definable in Haskell 98, except for constraints in data-type
definitions. So a data type of the form

data Eq a => Set a = NilSet | ConsSet a (Set a)

is not dealt with correctly. However, constrained data types are a corner
case in Haskell and can easily be simulated using other means.
Furthermore, Nogueira [69] shows how to make Generic Haskell work for data
types with constraints.
==

Thus, full reflexivity of an approach is taken into account. This suggests
constrained types are part of Haskell98. So, I'm a bit confused at the
moment as well.

Regards,
Thomas

From allbery at ece.cmu.edu  Sat Apr 12 13:51:31 2008
From: allbery at ece.cmu.edu (Brandon S. Allbery KF8NH)
Date: Sat Apr 12 13:46:59 2008
Subject: [Haskell] Re: [Haskell-cafe] ANNOUNCE: Generic Haskell 1.80
	(Emerald)
In-Reply-To: <50652.82.157.212.81.1208021612.squirrel@squirrel.science.ru.nl>
References: <49768.82.157.212.81.1208003974.squirrel@squirrel.science.ru.nl>
	<ae151f40804120634q54819390j20ec0c1ad66bfc87@mail.gmail.com>
	<50032.82.157.212.81.1208013141.squirrel@squirrel.science.ru.nl>
	<ae151f40804121014y4d43a945qc8c4dd0118fc0a33@mail.gmail.com>
	<50652.82.157.212.81.1208021612.squirrel@squirrel.science.ru.nl>
Message-ID: <33890D00-EB03-465A-B4AF-09A24783667E@ece.cmu.edu>


On Apr 12, 2008, at 13:33 , Thomas van Noort wrote:
>> On 12/04/2008, Thomas van Noort <thomas@cs.ru.nl> wrote:
>>
>>> That's a good question. Unfortunately, only Haskell98 types are
>>> currently
>>>  supported by the Generic Haskell compiler.
>>
>> I thought constrained types were Haskell 98, but now I'm in doubt...
>
> language. Generic Haskell is fully reflexive with respect to the types
> that are definable in Haskell 98, except for constraints in data-type
> definitions. So a data type of the form
>
> data Eq a => Set a = NilSet | ConsSet a (Set a)
>
> is not dealt with correctly. However, constrained data types are a  
> corner
> case in Haskell and can easily be simulated using other means.

I was under the impression "corner case" here means that H98 lets you  
write it but doesn't handle it very sanely (a GHC-specific extension  
being needed to achieve that).

-- 
brandon s. allbery [solaris,freebsd,perl,pugs,haskell] allbery@kf8nh.com
system administrator [openafs,heimdal,too many hats] allbery@ece.cmu.edu
electrical and computer engineering, carnegie mellon university    KF8NH


From bsinclai at turing.une.edu.au  Sun Apr 13 11:45:08 2008
From: bsinclai at turing.une.edu.au (Ben Sinclair)
Date: Sun Apr 13 11:40:32 2008
Subject: [Haskell] ANNOUNCE: libmpd-0.2.1
Message-ID: <20080413154508.GA3728@mephistopheles>

Hello all,

I'm happy to announce that version 0.2.1 of libmpd has been released.
The library now covers all the features of MPD, and a lot of work has
been done on testing the library with QuickCheck and unit tests with
test coverage checking done by HPC.

Changes in this version:

  - Partial unit test coverage.
  - QuickCheck tests for parsing.
  - Many bug fixes.
  - Precise error handling.
  - Parsing improvements.
  - Code coverage generation.
  - Cabal 1.2 support.
  - Uniform command names.

Cheers,

Ben


Hackage page:
  http://hackage.haskell.org/cgi-bin/hackage-scripts/package/libmpd-0.2.1

Home page:
  http://turing.une.edu.au/~bsinclai/code/libmpd-haskell.html
-------------- next part --------------
A non-text attachment was scrubbed...
Name: not available
Type: application/pgp-signature
Size: 189 bytes
Desc: Digital signature
Url : http://www.haskell.org/pipermail/haskell/attachments/20080414/315c9098/attachment.bin
From pablo at babel.ls.fi.upm.es  Mon Apr 14 04:49:14 2008
From: pablo at babel.ls.fi.upm.es (Pablo Nogueira)
Date: Mon Apr 14 04:44:33 2008
Subject: [Haskell] Re: [Haskell-cafe] ANNOUNCE: Generic Haskell 1.80
	(Emerald)
In-Reply-To: <50652.82.157.212.81.1208021612.squirrel@squirrel.science.ru.nl>
References: <49768.82.157.212.81.1208003974.squirrel@squirrel.science.ru.nl>
	<ae151f40804120634q54819390j20ec0c1ad66bfc87@mail.gmail.com>
	<50032.82.157.212.81.1208013141.squirrel@squirrel.science.ru.nl>
	<ae151f40804121014y4d43a945qc8c4dd0118fc0a33@mail.gmail.com>
	<50652.82.157.212.81.1208021612.squirrel@squirrel.science.ru.nl>
Message-ID: <ae151f40804140149j2db8165dm385538c6de972adb@mail.gmail.com>

> This has certainly been taken into account when comparing approaches to
>  generic programming. I quote from page 18/19 from the work you and Bulat

Indeed I was not aware of it. Missed that. Thanks for pointing it out!

>  Thus, full reflexivity of an approach is taken into account. This suggests
>  constrained types are part of Haskell98. So, I'm a bit confused at the
>  moment as well.

After reading the Haskell 98 report more carefully I think constrained
types are part of Haskell98. The syntax for algebraic datatype
declarations given is:

 > data cx => T u1 ... uk = K1 t11 ... t1k1 | ...| Kn tn1 ... tnkn

Certainly, they are implemented in a peculiar way, with constraints
associated with value constructors and not the type, perhaps to keep
the class and kinds orthogonal (eg, the BinTree type has * -> * kind
instead of Ord -> * kind).

At any rate, this has been discussed before in other threads.
Thanks Thomas for your help
P.
From thomas at cs.ru.nl  Mon Apr 14 04:59:36 2008
From: thomas at cs.ru.nl (Thomas van Noort)
Date: Mon Apr 14 05:12:54 2008
Subject: [Haskell] Re: [Haskell-cafe] ANNOUNCE: Generic Haskell 1.80
	(Emerald)
In-Reply-To: <ae151f40804140149j2db8165dm385538c6de972adb@mail.gmail.com>
References: <49768.82.157.212.81.1208003974.squirrel@squirrel.science.ru.nl>	
	<ae151f40804120634q54819390j20ec0c1ad66bfc87@mail.gmail.com>	
	<50032.82.157.212.81.1208013141.squirrel@squirrel.science.ru.nl>	
	<ae151f40804121014y4d43a945qc8c4dd0118fc0a33@mail.gmail.com>	
	<50652.82.157.212.81.1208021612.squirrel@squirrel.science.ru.nl>
	<ae151f40804140149j2db8165dm385538c6de972adb@mail.gmail.com>
Message-ID: <48031CF8.6040209@cs.ru.nl>

Pablo Nogueira wrote:
>> This has certainly been taken into account when comparing approaches to
>>  generic programming. I quote from page 18/19 from the work you and Bulat
> 
> Indeed I was not aware of it. Missed that. Thanks for pointing it out!
> 
>>  Thus, full reflexivity of an approach is taken into account. This suggests
>>  constrained types are part of Haskell98. So, I'm a bit confused at the
>>  moment as well.
> 
> After reading the Haskell 98 report more carefully I think constrained
> types are part of Haskell98. The syntax for algebraic datatype
> declarations given is:
> 
>  > data cx => T u1 ... uk = K1 t11 ... t1k1 | ...| Kn tn1 ... tnkn
> 
> Certainly, they are implemented in a peculiar way, with constraints
> associated with value constructors and not the type, perhaps to keep
> the class and kinds orthogonal (eg, the BinTree type has * -> * kind
> instead of Ord -> * kind).

You are completely right, constraints are optional for data and newtype 
declarations in Haskell98:

http://www.haskell.org/onlinereport/syntax-iso.html#sect9.5

In addition, GHC supports liberalised type synonyms which allows you to 
define constraints:

http://www.haskell.org/ghc/docs/latest/html/users_guide/data-type-extensions.html#type-synonyms

Seems like the mystery is solved now..

> 
> At any rate, this has been discussed before in other threads.
> Thanks Thomas for your help
> P.

You're welcome,
Thomas

From demis at dimi.uniud.it  Mon Apr 14 06:10:10 2008
From: demis at dimi.uniud.it (demis@dimi.uniud.it)
Date: Mon Apr 14 06:05:33 2008
Subject: [Haskell] 2nd CFP: 17th Int'l Workshop on Functional and
	(Constraint) Logic Programming (WFLP'08)
Message-ID: <20080414101010.6223C3FC210@sole.dimi.uniud.it>

Skipped content of type multipart/alternative
From andy at galois.com  Mon Apr 14 14:33:49 2008
From: andy at galois.com (Andy Gill)
Date: Mon Apr 14 14:29:13 2008
Subject: [Haskell] 1st CFP: 2008 Haskell Symposium (Haskell 08)
Message-ID: <57E181B8-D796-4F5F-B3C6-75B09CB9DAD0@galois.com>


                            Haskell 08

                ACM SIGPLAN 2008 Haskell Symposium
                Victoria, British Columbia, Canada
                 Thursday, 25th September, 2008

                      FIRST 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, andy@galois.com.

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, Galois, 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

From krassimir.krustev at gmail.com  Tue Apr 15 10:47:37 2008
From: krassimir.krustev at gmail.com (Krassimir Krustev)
Date: Tue Apr 15 10:42:52 2008
Subject: [Haskell] I have some issue with XML-RPC on Windows?
Message-ID: <3565f8a0804150747o306dcb85ucd95db9515e33f29@mail.gmail.com>

On Windows, trying example from XML-RPC:

C:\Program Files\Apache Group\Apache2\cgi-bin>runhaskell simple_client.hs
simple_client.hs: user error (Error calling examples.add: Lexical error in  file
 string input  at line 7 col 56:
  unexpected EOF within </...>)

C:\Program Files\Apache Group\Apache2\cgi-bin>type input.xml
<?xml version="1.0"?>
<methodCall>
        <methodName>examples.add</methodName>
        <params>
                <param>
                        <value><i4>3</i4></value>
                </param>
                <param>
                        <value><i4>4</i4></value>
                </param>
        </params>
</methodCall>

C:\Program Files\Apache Group\Apache2\cgi-bin>runhaskell
simple_server.hs < input.xml
Server: Haskell XmlRpcServer/0.1
Content-Type: text/xml
Content-Length: 150

<?xml version='1.0' ?>
<methodResponse
  ><params
    ><param
      ><value
        ><int
          >7</int></value></param></params></methodResponse>

I do not get this behaviour if I paste the input to console.
Presumably the failed call from from simple_client did something
similar

C:\Program Files\Apache Group\Apache2\cgi-bin>runhaskell simple_server.hs
<?xml version="1.0"?>
<methodCall>
        <methodName>examples.add</methodName>
        <params>
                <param>
                        <value><i4>3</i4></value>
                </param>
                <param>
                        <value><i4>4</i4></value>
                </param>
        </params>
</methodCall>^Z
Server: Haskell XmlRpcServer/0.1
Content-Type: text/xml
Content-Length: 486

<?xml version='1.0' ?>
<methodResponse
  ><fault
    ><value
      ><struct
        ><member
          ><name
            >faultCode</name
          ><value
            ><int
              >0</int></value></member
        ><member
          ><name
            >faultString</name
          ><value
            ><string
              >Lexical error in  file string input  at line 12 col 14:
  unexpected EOF between tags</string></value></member></struct></value></fault>
</methodResponse>
From lgreg.meredith at biosimilarity.com  Tue Apr 15 11:21:19 2008
From: lgreg.meredith at biosimilarity.com (Greg Meredith)
Date: Tue Apr 15 11:16:38 2008
Subject: [Haskell] NW Functional Programming Interest Group
In-Reply-To: <5de3f5ca0802011155l771cc649wa0e671bbe3abe364@mail.gmail.com>
References: <5de3f5ca0802011155l771cc649wa0e671bbe3abe364@mail.gmail.com>
Message-ID: <5de3f5ca0804150821t342512bcv5fd3bb5f02f20bd7@mail.gmail.com>

All,

Apologies for multiple listings.

It's that time again. Our growing cadre of functionally-minded north
westerners
is meeting at the

The Seattle Public Library
1000 - 4th Ave.
Seattle, WA  98104

from 18:30 - 20:00 on April 16th.

This meeting's agenda is a little more fluid, but...

   - i would like to talk about a proposal i'm mulling over around a much
   more general account of the Curry-Howard isomorphism by way of iterated
   distributive laws for monads
   - we also need to get a couple more people on the hook to give a talk

Hope to see you there.

Monadically yours,

--greg

-- 
L.G. Meredith
Managing Partner
Biosimilarity LLC
806 55th St NE
Seattle, WA 98105

+1 206.650.3740

http://biosimilarity.blogspot.com
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell/attachments/20080415/1f29d827/attachment.htm
From waldmann at imn.htwk-leipzig.de  Tue Apr 15 17:44:11 2008
From: waldmann at imn.htwk-leipzig.de (Johannes Waldmann)
Date: Tue Apr 15 17:39:27 2008
Subject: [Haskell] Error recovery for Haskell parsers?
Message-ID: <480521AB.6070701@imn.htwk-leipzig.de>

Dear all

I'd like to collect some ideas
for error recovery in Haskell parsers.

cf. http://leiffrenzel.de/eclipse/wiki/doku.php?id=ast ,
feel free to add information to that page.

best regards, Johannes.

From jehenrik at yahoo.com  Tue Apr 15 23:02:27 2008
From: jehenrik at yahoo.com (Jeff Henrikson)
Date: Tue Apr 15 22:57:40 2008
Subject: [Haskell] NW Functional Programming Interest Group
In-Reply-To: <20080415152133.84941.qmail@mta133.mail.re3.yahoo.com>
References: <20080415152133.84941.qmail@mta133.mail.re3.yahoo.com>
Message-ID: <48056C43.8040705@yahoo.com>

Hi Greg,

Not sure if you're aware but there is already a functional programming 
interest group in Seattle, SeaFunc.  We have been meeting approximately 
every 4 weeks since 2004.  For the sake of people deciding which group 
to follow, could you explain the differences of your scope?  (We also 
discuss Haskell, OCaml, and Scala, among other things.)

http://tech.groups.yahoo.com/group/SeaFunc/

Our regularly scheduled meeting is also tomorrow, April 16 (later at 
8pm) at Ralph's Grocery downtown.  Check the list for details.


Jeff Henrikson



> Message-ID: <5de3f5ca0804150821t342512bcv5fd3bb5f02f20bd7@mail.gmail.com>
> Date: Tue, 15 Apr 2008 08:21:19 -0700
> From: "Greg Meredith" <lgreg.meredith@biosimilarity.com>
> To: haskell@haskell.org, haskell-cafe <haskell-cafe@haskell.org>,
> 	"Scala list" <scala@listes.epfl.ch>, caml-list <caml-list@inria.fr>,
> 	northwest-functional-programming-interest-group@googlegroups.com
> In-Reply-To: <5de3f5ca0802011155l771cc649wa0e671bbe3abe364@mail.gmail.com>
> Subject: NW Functional Programming Interest Group
>
> All,
>
> Apologies for multiple listings.
>
> It's that time again. Our growing cadre of functionally-minded north
> westerners
> is meeting at the
>
> The Seattle Public Library
> 1000 - 4th Ave.
> Seattle, WA  98104
>
> from 18:30 - 20:00 on April 16th.
>
> This meeting's agenda is a little more fluid, but...
>
>    - i would like to talk about a proposal i'm mulling over around a much
>    more general account of the Curry-Howard isomorphism by way of iterated
>    distributive laws for monads
>    - we also need to get a couple more people on the hook to give a talk
>
> Hope to see you there.
>
> Monadically yours,
>
> --greg
>
>   

From jgoerzen at complete.org  Tue Apr 15 23:10:56 2008
From: jgoerzen at complete.org (John Goerzen)
Date: Tue Apr 15 23:15:17 2008
Subject: [Haskell] ANN: MissingH 1.0.1
Message-ID: <slrng0ari0.k06.jgoerzen@katherina.lan.complete.org>

MissingH version 1.0.1 is now available from
http://software.complete.org/missingh and Hackage.

Two new features in this version:

* The Data.Quantity module now includes support for parsing
  quantities.  Using the binaryOpts suffixes, it can parse things like
  1.5m and 2g into the appropriate megabyte/gigabyte numbers.

* New module Data.BinPacking, which provides a standard infrastructure
  for solving the bin-packing problem, as well as two algorithms for
  doing so.  The bin-packing problem is finding the best way to fit
  items of varying sizes into bins if fixed sizes, using the fewest
  number of bins.  This is useful, say, to fit data files onto the
  fewest number of CDs or DVDs.

  The example algorithms include a naive "pack in order given"
  function as well as a "pack largest valid object first" function.

-- John

From john at repetae.net  Wed Apr 16 03:35:15 2008
From: john at repetae.net (John Meacham)
Date: Wed Apr 16 03:30:27 2008
Subject: [Haskell] Error recovery for Haskell parsers?
In-Reply-To: <480521AB.6070701@imn.htwk-leipzig.de>
References: <480521AB.6070701@imn.htwk-leipzig.de>
Message-ID: <20080416073515.GL25982@sliver.repetae.net>

a PEG (parsing expression grammar) style parser would be ideal for this
sort of thing. The nice thing about them is that you can make your error
correction/detection part of the grammar itself and if you are a little
careful when writing your grammar, you end up with a lazy parser, which
can be useful for something such as a ast-highlighting editor.

For an example of how error correction can be handled in the parser
itself, the basic and only routine to call the PEG based
frisby[1] parser is essentially:

runPeg :: P a -> String -> a

notice that there is no need at all for error handling in the calling
routine because you can just write something like

runPegMaybe :: P a -> String -> Maybe a
runPegMaybe p s = runPeg (fmap Just p </> return Nothing)


likewise, you can add things in your expression parser like

exp <- exp '+' exp </> '(' exp ')' </> errorExp

where errorExp is a rule that 'eats' any expression errors and lets the
parser continue on as normal. 

A long term goal of mine is to completely redo jhc's haskell parser in
pappy[2] to better take advantage of PEG parsers. Trying to coerce LALR
parsers to do what I want is getting frustrating.


see http://pdos.csail.mit.edu/~baford/packrat/thesis/ for more
information on packrat parsing and PEGs. I have continued development of
pappy from Bryan Ford's original version and my repo is at [2].


[1] http://repetae.net/computer/frisby/
[2] http://repetae.net/repos/pappy/

        John



-- 
John Meacham - ?repetae.net?john?
From dons at galois.com  Wed Apr 16 12:49:41 2008
From: dons at galois.com (Don Stewart)
Date: Wed Apr 16 12:45:04 2008
Subject: [Haskell] NW Functional Programming Interest Group
In-Reply-To: <48056C43.8040705@yahoo.com>
References: <20080415152133.84941.qmail@mta133.mail.re3.yahoo.com>
	<48056C43.8040705@yahoo.com>
Message-ID: <20080416164941.GB4395@scytale.galois.com>

jehenrik:
> Hi Greg,
> 
> Not sure if you're aware but there is already a functional programming 
> interest group in Seattle, SeaFunc.  We have been meeting approximately 
> every 4 weeks since 2004.  For the sake of people deciding which group 
> to follow, could you explain the differences of your scope?  (We also 
> discuss Haskell, OCaml, and Scala, among other things.)
> 
> http://tech.groups.yahoo.com/group/SeaFunc/
> 
> Our regularly scheduled meeting is also tomorrow, April 16 (later at 
> 8pm) at Ralph's Grocery downtown.  Check the list for details.
> 

I've added it to the events section on:

    http://haskell.org/

You can keep the SeaFunc entry up to date by editing:

    http://haskell.org/haskellwiki/Events

(I already do this for PDXFunc).

-- Don
From lgreg.meredith at biosimilarity.com  Wed Apr 16 15:45:04 2008
From: lgreg.meredith at biosimilarity.com (Greg Meredith)
Date: Wed Apr 16 15:40:17 2008
Subject: [Haskell] NW Functional Programming Interest Group
In-Reply-To: <20080416164941.GB4395@scytale.galois.com>
References: <20080415152133.84941.qmail@mta133.mail.re3.yahoo.com>
	<48056C43.8040705@yahoo.com>
	<20080416164941.GB4395@scytale.galois.com>
Message-ID: <5de3f5ca0804161245j508e9a6fo55d70287b0d56a41@mail.gmail.com>

Jeff, Don,

Hey, thanks for the inquiries. There's so much interest in FP in the Pacific
Northwest that having two groups is going to be a good thing. Also, we're
trying to be make the NWFPIG a bit more formal with formal presentations and
"high profile" speakers coming in to give invited talks. i'm working on
filling that pipeline these days. Please correct me if i'm wrong, but
Seafunc is more of an informal gathering. i think these two venues work well
together and hope to see some fruitful interaction.

Best wishes,

--greg

On Wed, Apr 16, 2008 at 9:49 AM, Don Stewart <dons@galois.com> wrote:

> jehenrik:
> > Hi Greg,
> >
> > Not sure if you're aware but there is already a functional programming
> > interest group in Seattle, SeaFunc.  We have been meeting approximately
> > every 4 weeks since 2004.  For the sake of people deciding which group
> > to follow, could you explain the differences of your scope?  (We also
> > discuss Haskell, OCaml, and Scala, among other things.)
> >
> > http://tech.groups.yahoo.com/group/SeaFunc/
> >
> > Our regularly scheduled meeting is also tomorrow, April 16 (later at
> > 8pm) at Ralph's Grocery downtown.  Check the list for details.
> >
>
> I've added it to the events section on:
>
>    http://haskell.org/
>
> You can keep the SeaFunc entry up to date by editing:
>
>    http://haskell.org/haskellwiki/Events
>
> (I already do this for PDXFunc).
>
> -- Don
>



-- 
L.G. Meredith
Managing Partner
Biosimilarity LLC
806 55th St NE
Seattle, WA 98105

+1 206.650.3740

http://biosimilarity.blogspot.com
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell/attachments/20080416/0b7e2895/attachment.htm
From jgwnw3 at hotmail.com  Thu Apr 17 12:46:15 2008
From: jgwnw3 at hotmail.com (John Wilson)
Date: Thu Apr 17 12:41:26 2008
Subject: [Haskell] Looking for Computer Science/Functional Programming
	professional
Message-ID: <BAY135-W39BB75C6F3137D4A879FD69FE50@phx.gbl>


Curvaceous Software Limited wants to recruit someone with a Computer Science background and experience of Functional Programming to take over the further development of a visual interactive computer program that is written partly in ML and partly in C. It includes an ML Interpreter written in C.
The ability to quickly master new concepts and to work with little supervision are key requirements. The location is South Bucks.
Curvaceous Software Limited
PO Box 43
Gerrards Cross
Buckinghamshire
SL9 8UX
United Kingdom
Phone: +44 (0) 1753 893090
enquiries@curvaceous.com 
 
 
Dr John G. Wilson
Research and Development Manager
_________________________________________________________________
Get Hotmail on your mobile. Text MSN to 63463 now!
http://mobile.uk.msn.com/pc/mail.aspx
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell/attachments/20080417/0034c6b8/attachment-0001.htm
From mh at informatik.uni-kiel.de  Fri Apr 18 03:14:32 2008
From: mh at informatik.uni-kiel.de (Michael Hanus)
Date: Fri Apr 18 03:12:10 2008
Subject: [Haskell] Final CfP: LOPSTR 2008
Message-ID: <20080418071432.DE7A184006@localhost>

======================================================================

                        Final CALL FOR PAPERS

                    18th International Symposium on
  International Symposium on Logic-Based Program Synthesis and Transformation
                                LOPSTR 2008
             http://www.informatik.uni-kiel.de/~mh/lopstr08/

                  July 17-18, 2008, Valencia, Spain

          (co-located with SAS 2008, PPDP 2008, and PLID 2008)


======================================================================

Objectives:

The aim of the LOPSTR series is to stimulate and promote international
research and collaboration on logic-based program development.
LOPSTR is open to contributions in logic-based program development in
any language paradigm.  LOPSTR has a reputation for being a lively,
friendly forum for presenting and discussing work in progress. Formal
proceedings are produced only after the symposium, so authors can
incorporate this feedback in the published papers.


Topics:

Topics of interest cover all aspects of logic-based program
development, all stages of the software life cycle, and issues of
both programming-in-the-small and programming-in-the-large. Papers
describing applications in these areas are especially welcome.
Contributions are welcome on all aspects of logic-based program
development, including, but not limited to:

  specification                           synthesis 
  verification                            transformation 
  analysis                                optimisation 
  composition                             security 
  reuse                                   applications and tools 
  component-based software development    software architectures 
  agent-based software development        program refinement 

Survey papers, that present some aspect of the above topics from a new
perspective, and application papers, that describe experience with
industrial applications, are also welcome.

Papers must describe original work, be written and presented in
English, and must not substantially overlap with papers that have been
published or that are simultaneously submitted to a journal,
conference, or workshop with refereed proceedings. Work that already
appeared in unpublished or informally published workshop proceedings
may be submitted (please contact the PC chair in case of questions).


IMPORTANT DATES AND SUBMISSION GUIDELINES:

Paper/extended abstract submission:  May 7, 2008
Notification (for pre-proceedings):  June 8, 2008
Camera-ready (for pre-proceedings):  June 29, 2008
Symposium:                           July 17-18, 2008

Submissions can either be (short) extended abstracts or (full) papers
whose length should not exceed 9 and 15 pages (including references),
respectively. Submissions must be formatted in the Springer LNCS
style (excluding well-marked appendices not intended for publication).
Referees are not required to read the appendices, and thus papers
should be intelligible without them. Short papers may describe
work-in-progress or tool demonstrations.

Both accepted short and full papers will appear in the pre-proceedings.
The full papers will automatically appear in the formal proceedings
that will be published by Springer-Verlag in the LNCS series. In
addition, after the symposium, the programme committee will select
those short papers to be considered for formal publication. These
authors will be invited to revise and extend their submissions in the
light of the comments of the reviewers and the feedback solicited at
the meeting. Then after another round of reviewing, the revised
papers which are accepted will be also published in the formal
proceedings.

Papers should be submitted either in PDF or PostScript via the
web page of LOPSTR 2008.


Program Committee:

Slim Abdennadher    German University Cairo
Danny De Schreye    K.U.Leuven, Belgium
Wlodek Drabent      Polish Academy of Sciences, Poland / Linkoeping Univ., Sweden
Gopal Gupta         University of Texas at Dallas, USA
Michael Hanus       University of Kiel, Germany (Chair)
Patricia Hill       University of Leeds, UK
Andy King           University of Kent, UK
Michael Leuschel    University of Duesseldorf, Germany
Torben Mogensen     DIKU, University of Copenhagen, Denmark
Mario Ornaghi       Universita degli Studi di Milano, Italy
Etienne Payet       Universite de La Reunion, France
Alberto Pettorossi  University of Rome Tor Vergata, Italy
German Puebla       Technical University of Madrid, Spain
C.R. Ramakrishnan   SUNY at Stony Brook, USA
Sabina Rossi        Universita Ca' Foscari di Venezia, Italy
Chiaki Sakama       Wakayama University, Japan
Josep Silva         Technical University of Valencia, Spain
Wim Vanhoof         University of Namur, Belgium
Eelco Visser        Delft University of Technology, The Netherlands

----------------------------------------------------------------------
From genaim at clip.dia.fi.upm.es  Fri Apr 18 16:18:09 2008
From: genaim at clip.dia.fi.upm.es (Samir Genaim)
Date: Fri Apr 18 16:13:56 2008
Subject: [Haskell] (no subject)
Message-ID: <Pine.LNX.4.64.0804182214190.13408@clip.dia.fi.upm.es>


       *********************************************************
       *         The Fourth International Workshop             *
       *                         on                            *
       *   Programming Language Interference and Dependence    *
       *                                                       *
       *     co-located with LOPSTR'08, PPDP'08 and SAS'08     *
       *                                                       *
       *           15 July, 2008, Valencia, Spain              *
       *                   		                       *
       *      Venue: The Technical University of Valencia      *
       *                                                       *
       *              2nd Call for Contributions               *
       *                                                       *
       *   http://www.clip.dia.fi.upm.es/Conferences/PLID08    *
       *                                                       *
       *********************************************************



Important Dates
===============

Expression of interest 	   	June 1,  2008
Extended abstract 	   	June 15, 2008
Workshop			July 15, 2008



Workshop Description
====================

Interference and  dependence are  closely related concepts,  the first
being the observable phenomenon  connected to the second. Interference
essentially means that behaviour of some parts of a dynamic system may
influence  the behaviour  of other  parts of  the  system.  Dependence
specifies the  relation between the  semantics of sub-components  of a
dynamic system.

Discovering,  measuring and controlling  interference is  essential in
many aspects  of modern computer  science, in particular  in security,
program analysis  and verification, debugging,  systems specification,
model  checking,   program  manipulation,  program   slicing,  reverse
engineering,   data   mining,   distributed  databases   and   systems
biology. Doing  these things  requires theories, models  and semantics
for interference and  dependence, as well as algorithms  and tools for
analysis and reasoning about interference and dependence.

The aim of this workshop is to gather together the community of people
that study  dependence and interference  from the different  points of
view in order  to generate new possible research  directions.  PLID is
devoted to bridging all these communities and assisting work towards a
common goal, providing the appropriate environment for reasoning about
the state of the art in interference and dependence.

Topics of interest include but are not limited to:

 * Security against unwanted interference and dependence
 * Models and theories of program interference
 * Algorithms for reducing or removing interference or for
   ameliorating its effects
 * Theory and foundations of program slicing and related dependence
   analyses
 * Resource declassification theories
 * Semantics of dependence and interference
 * Analyses based on interference and dependence
 * Abstract interpretation for dependence and interference
 * Dependence and interference in specifications
 * Slicing models and specifications
 * Interaction between dependence and refinement



Keynote Speaker
===============

Gilles Barthe, IMDEA-software (Madrid, Spain)



Submission
==========

The workshop welcomes contributions of  on-going work and ideas in the
field  of dependence and  interference.  Those  who are  interested in
having a  talk at the  workshop and/or discussing issues  related with
these  subjects are  invited to  send your  expression of  interest to
Samir Genaim (samir at clip.dia.fi.upm.es) before June 1st, 2008.

There will  be no  formal publication of  papers.  A web-page  will be
organised  collecting  all   the  workshop  contributions.   Submitted
extended abstracts should be of at most 10 pages LNCS-style and should
be sent before June 15th 2008.



Program Committee
=================

David Clark 	   	Kings College, London, UK
Sebastian Danicic 	University of London, UK
Samir Genaim (chair)   	Technical University of Madrid, Spain
Roberto Giacobazzi 	University of Verona, Italy
Daniele Gorla 	   	University of Roma, Italy
Sebastian Hunt 	   	City University, London, UK
Herbert Wiklicky 	Imperial College, London, UK
Steve Zdancewic 	University of Pennsylvania, USA



Local organization chair
========================

Christophe Joubert 	Technical University of Valencia / DSIC
From genaim at clip.dia.fi.upm.es  Fri Apr 18 16:26:51 2008
From: genaim at clip.dia.fi.upm.es (Samir Genaim)
Date: Mon Apr 21 05:09:21 2008
Subject: [Haskell] PLID'08 - 2nd Call for Contributions
Message-ID: <Pine.LNX.4.64.0804182224290.13408@clip.dia.fi.upm.es>


       *********************************************************
       *         The Fourth International Workshop             *
       *                         on                            *
       *   Programming Language Interference and Dependence    *
       *                                                       *
       *     co-located with LOPSTR'08, PPDP'08 and SAS'08     *
       *                                                       *
       *           15 July, 2008, Valencia, Spain              *
       *                   		                       *
       *      Venue: The Technical University of Valencia      *
       *                                                       *
       *              2nd Call for Contributions               *
       *                                                       *
       *   http://www.clip.dia.fi.upm.es/Conferences/PLID08    *
       *                                                       *
       *********************************************************



Important Dates
===============

Expression of interest 	   	June 1,  2008
Extended abstract 	   	June 15, 2008
Workshop			July 15, 2008



Workshop Description
====================

Interference and  dependence are  closely related concepts,  the first
being the observable phenomenon  connected to the second. Interference
essentially means that behaviour of some parts of a dynamic system may
influence  the behaviour  of other  parts of  the  system.  Dependence
specifies the  relation between the  semantics of sub-components  of a
dynamic system.

Discovering,  measuring and controlling  interference is  essential in
many aspects  of modern computer  science, in particular  in security,
program analysis  and verification, debugging,  systems specification,
model  checking,   program  manipulation,  program   slicing,  reverse
engineering,   data   mining,   distributed  databases   and   systems
biology. Doing  these things  requires theories, models  and semantics
for interference and  dependence, as well as algorithms  and tools for
analysis and reasoning about interference and dependence.

The aim of this workshop is to gather together the community of people
that study  dependence and interference  from the different  points of
view in order  to generate new possible research  directions.  PLID is
devoted to bridging all these communities and assisting work towards a
common goal, providing the appropriate environment for reasoning about
the state of the art in interference and dependence.

Topics of interest include but are not limited to:

 * Security against unwanted interference and dependence
 * Models and theories of program interference
 * Algorithms for reducing or removing interference or for
   ameliorating its effects
 * Theory and foundations of program slicing and related dependence
   analyses
 * Resource declassification theories
 * Semantics of dependence and interference
 * Analyses based on interference and dependence
 * Abstract interpretation for dependence and interference
 * Dependence and interference in specifications
 * Slicing models and specifications
 * Interaction between dependence and refinement



Keynote Speaker
===============

Gilles Barthe, IMDEA-software (Madrid, Spain)



Submission
==========

The workshop welcomes contributions of  on-going work and ideas in the
field  of dependence and  interference.  Those  who are  interested in
having a  talk at the  workshop and/or discussing issues  related with
these  subjects are  invited to  send your  expression of  interest to
Samir Genaim (samir at clip.dia.fi.upm.es) before June 1st, 2008.

There will  be no  formal publication of  papers.  A web-page  will be
organised  collecting  all   the  workshop  contributions.   Submitted
extended abstracts should be of at most 10 pages LNCS-style and should
be sent before June 15th 2008.



Program Committee
=================

David Clark 	   	Kings College, London, UK
Sebastian Danicic 	University of London, UK
Samir Genaim (chair)   	Technical University of Madrid, Spain
Roberto Giacobazzi 	University of Verona, Italy
Daniele Gorla 	   	University of Roma, Italy
Sebastian Hunt 	   	City University, London, UK
Herbert Wiklicky 	Imperial College, London, UK
Steve Zdancewic 	University of Pennsylvania, USA



Local organization chair
========================

Christophe Joubert 	Technical University of Valencia / DSIC
From demis at dimi.uniud.it  Mon Apr 21 10:21:12 2008
From: demis at dimi.uniud.it (demis@dimi.uniud.it)
Date: Mon Apr 21 10:16:26 2008
Subject: [Haskell] DEADLINE EXTENSION: (WWV'08) 4th Int'l Workshop on
	Automated Specification and Verification of Web Systems 
Message-ID: <20080421142112.805923FC214@sole.dimi.uniud.it>

Skipped content of type multipart/alternative
From marlowsd at gmail.com  Mon Apr 21 14:06:51 2008
From: marlowsd at gmail.com (Simon Marlow)
Date: Mon Apr 21 14:01:47 2008
Subject: [Haskell] DRAFT: Haskell' status update
Message-ID: <480CD7BB.2040601@gmail.com>

Those on the Haskell' mailing list may have seen recent signs of
activity on the Haskell' front.  I thought I should clarify the current
status, and update the community on our plans for Haskell'.

The main sticking point in the design of Haskell' has been the type
system: namely whether Haskell' should have Functional Dependencies or
Type Families.  This issue is still undecided, although the experts are
hard at work on developing a stronger understanding of Type Families in
particular.

Nevertheless, the committee feels that we cannot have a Haskell' without
some way to resolve ambiguities when using multi-parameter type
classes, be it Functional Dependencies (FDs) or Type Families (TFs).
For one thing, a great deal of existing code uses FDs or depends on code
that does, so unless we adopt one of these extensions all this code will
still exist outside of Haskell', and that is far from ideal.  So we
decided to proceed in two stages:

   - "Haskell' alpha" will be a complete language specification,
     including all the modifications and additions we want to make
     to the language *except* for FDs or TFs.

   - Haskell' will follow afterward, adding either FDs or TFs.

The motivation for this two-stage approach is that we can make progress
on all the other parts of the language without being blocked on the type
system, we can start work on implementing Haskell' alpha in our
compilers, users can start using the new standard, and we can gain some
experience with using it in practice.

On the process side of things, we're now tracking the status of all
language design proposals on this page:

   http://hackage.haskell.org/trac/haskell-prime/wiki/Status

and as usual all the Haskell' resources are on the wiki:

   http://hackage.haskell.org/trac/haskell-prime/wiki

The committee have been discussing various proposals amongst ourselves
over the past few weeks, with the goal of making as many concrete 
decisions as possible.  However, the general policy is still for 
technical discussions to take place in public, as far as possible.

Changes to the status page are sent to the public mailing list, and we
welcome comments on any of the issues, regardless of status.

Thanks for your patience :-)  And rest assured that progress is being made!

Cheers,

Simon (and the Haskell' committee)
From marlowsd at gmail.com  Mon Apr 21 14:08:55 2008
From: marlowsd at gmail.com (Simon Marlow)
Date: Mon Apr 21 14:03:52 2008
Subject: [Haskell] Re: Haskell' status update
In-Reply-To: <480CD7BB.2040601@gmail.com>
References: <480CD7BB.2040601@gmail.com>
Message-ID: <480CD837.8070601@gmail.com>

Simon Marlow wrote:
Subject: DRAFT: Haskell' status update

of course, that shouldn't have said "DRAFT".

Cheers,
	Simon


From dons at galois.com  Mon Apr 21 14:11:19 2008
From: dons at galois.com (Don Stewart)
Date: Mon Apr 21 14:06:19 2008
Subject: [Haskell] ANNOUNCE: Galois web libraries for Haskell released
Message-ID: <20080421181119.GB8601@scytale.galois.com>


Galois, Inc. is pleased to announce the open source release of a suite of
web programming libraries for Haskell!

The following libraries are available, providing support for a
wide range of Haskell web programming scenarios:

  * json
        JSON (JavaScript Object Notation) is a lightweight data-interchange
        format. It is easy for humans to read and write. It is easy for
        machines to parse and generate.  It is based on a subset of the
        JavaScript Programming Language, Standard ECMA-262 3rd Edition -
        December 1999.

        This library provides a validating parser and pretty printer for
        converting between Haskell values and JSON.

        http://hackage.haskell.org/cgi-bin/hackage-scripts/package/json

  * xml
        A simple, lightweight XML parser/generator.

        http://hackage.haskell.org/cgi-bin/hackage-scripts/package/xml

  * utf8-string
        A UTF8 layer for IO and Strings. The utf8-string
        package provides operations for encoding UTF8
        strings to Word8 lists and back, and for reading and
        writing UTF8 without truncation.        

        http://hackage.haskell.org/cgi-bin/hackage-scripts/package/utf8-string
    
  * selenium
        Haskell bindings to communicate with a Selenium Remote
        Control server. This package makes it possible to use
        Haskell to write test scripts that exercise web
        applications through a web browser.

        http://hackage.haskell.org/cgi-bin/hackage-scripts/package/selenium

  * curl
        libcurl is a client-side URL transfer library, supporting FTP,
        FTPS, HTTP, HTTPS, SCP, SFTP, TFTP, TELNET, DICT, LDAP, LDAPS
        and FILE.  libcurl supports SSL certificates, HTTP POST, HTTP
        PUT, FTP uploading, HTTP form based upload, proxies, cookies,
        user+password authentication (Basic, Digest, NTLM, Negotiate,
        Kerberos4), file transfer resume, http proxy tunneling and more!

        This package provides a Haskell binding to libcurl.

        http://hackage.haskell.org/cgi-bin/hackage-scripts/package/curl

  * sqlite
        Haskell binding to sqlite3 <http://sqlite.org/>, a light, fast
        database.

        http://hackage.haskell.org/cgi-bin/hackage-scripts/package/sqlite

  * feed
        Interfacing with RSS (v 0.9x, 2.x, 1.0) and Atom feeds

        http://hackage.haskell.org/cgi-bin/hackage-scripts/package/feed

  * mime
        Haskell support for working with MIME types.

        http://hackage.haskell.org/cgi-bin/hackage-scripts/package/mime

Together these fill in a big chunk of the web programming stack for Haskell.

Get the code!  You can find all the cabalised packages on hackage.haskell.org.

About:

Galois <http://galois.com> researches, designs and develops high
assurance technologies for security-critical systems, networks and
applications. We use Haskell as a primary development tool for producing
robust components for a diverse range of clients.

Web-based technologies are increasingly important in this area, and we
believe Haskell has a key role to play in the production of reliable,
secure web software. The culture of correctness Haskell encourages is
ideally suited to web programming, where issues of security,
authentication, privacy and protection of resources abound.  In
particular, Haskell's type system makes possible strong static
guarantees about access to resources, critical to building reliable web
applications. We hope that the release of this suite of libraries to the
community will push further the adoption of Haskell in the domain of web
programming.
    
This release brought to you by:

    Iavor Diatchki
    Trevor Elliott
    Sigbjorn Finne
    Andy Gill
    Eric Mertens
    Isaac Potoczny-Jones
    Don Stewart
    Aaron Tomb

From ahey at iee.org  Mon Apr 21 17:14:47 2008
From: ahey at iee.org (Adrian Hey)
Date: Mon Apr 21 17:09:43 2008
Subject: [Haskell] ANNOUNCE: Generic Haskell 1.80 (Emerald)
In-Reply-To: <49766.82.157.212.81.1208003963.squirrel@squirrel.science.ru.nl>
References: <49766.82.157.212.81.1208003963.squirrel@squirrel.science.ru.nl>
Message-ID: <480D03C7.7080007@iee.org>

Thomas van Noort wrote:
>    Pleasant programming,

Hello,

This looks like good stuff. But having done all this work it seems
a pity not to go the extra mm and cabalise this and make it buildable
on all platforms (at least ghc supported platforms).

The reason I'm interested is this may be useful for the GSoC project
I'm mentoring..

  http://code.google.com/soc/2008/haskell/about.html

But as things are, I'd be unlikely to consider introducing a dependency
on this. Even if it built "out of the box" with cygwin (which it
doesn't BTW) I don't really think many windows users will be keen to
install cygwin and learn how to use it just so they can build GH.

Thanks
--
Adrian Hey
From Malcolm.Wallace at cs.york.ac.uk  Tue Apr 22 07:22:37 2008
From: Malcolm.Wallace at cs.york.ac.uk (Malcolm Wallace)
Date: Tue Apr 22 07:18:54 2008
Subject: [Haskell] GSoC accepted projects
Message-ID: <20080422122237.19470715.Malcolm.Wallace@cs.york.ac.uk>

Haskell.org is pleased to announce that we received 7 funded student
slots from Google for this year's Summer of Code.  Of the 30 proposals
we received, the mentoring group chose the following 7:

  * GHC API Improvements
    by Thomas Schilling, mentored by Simon Marlow

  * Dynamically Loaded Plugins for the Glasgow Haskell Compiler
    by Maximilian Conroy Bolingbroke, mentored by Sean Seefried

  * Haskell API Search as an interface to Hackage
    by Neil Mitchell, mentored by Niklas Broberg

  * Language.C, a standalone parser/pretty printer library for C99
    by Benedikt Huber, mentored by Iavor S. Diatchki

  * Cabal 'make-like' dependency framework
    by Andrea Vezzosi, mentored by Duncan Coutts

  * #1560 Efficient maps using generalised tries
    by Jamie Brandon, mentored by Adrian Charles Hey

  * Data parallel physics engine
    by Roman Cheplyaka, mentored by Manuel M. T. Chakravarty

Slightly fuller details at http://code.google.com/soc/2008/haskell/about.html
Congratulations to these students!  Before coding begins officially at
the end of May, there is a "community bonding period", where the
students and community are encouraged to interact and further refine the
work that will be done.

To those students that did not get funding: do not be disheartened.
Almost all of the proposals were good, and we had some difficult choices
to make.  What's more, since this is Open Source, you can continue to
work on your projects anyway!  Many of them will be useful to the
community.  In fact, Google have said that if any GSoC applicant manages
(in the judgement of the mentors) to complete their project by the end
of the summer, despite not receiving a funded place, they will send you
a goodie-bag of Google swag (including a standard Google T-shirt, not
the special GSoC one).

Regards,
    Malcolm
From jgoerzen at complete.org  Tue Apr 22 09:20:09 2008
From: jgoerzen at complete.org (John Goerzen)
Date: Tue Apr 22 09:15:13 2008
Subject: [Haskell] Re: [Haskell-cafe] ANNOUNCE: Galois web libraries for
	Haskell released
In-Reply-To: <20080421181119.GB8601@scytale.galois.com>
References: <20080421181119.GB8601@scytale.galois.com>
Message-ID: <200804220820.10015.jgoerzen@complete.org>

On Mon April 21 2008 1:11:19 pm Don Stewart wrote:
> Galois, Inc. is pleased to announce the open source release of a suite of
> web programming libraries for Haskell!

Lots of cool stuff here!  A few questions:

>   * xml
>         A simple, lightweight XML parser/generator.
>
>         http://hackage.haskell.org/cgi-bin/hackage-scripts/package/xml

Can you describe how this compares to HaXml?  Were there deficiencies in 
HaXml?

>   * sqlite
>         Haskell binding to sqlite3 <http://sqlite.org/>, a light, fast
>         database.
>
>         http://hackage.haskell.org/cgi-bin/hackage-scripts/package/sqlite

Similar questions here regarding HDBC.  Did HDBC (and HDBC-sqlite3) not 
address some need?

>   * feed
>         Interfacing with RSS (v 0.9x, 2.x, 1.0) and Atom feeds
>
>         http://hackage.haskell.org/cgi-bin/hackage-scripts/package/feed

Sweet.  Might have to refactor hpodder to use this.

>
>   * mime
>         Haskell support for working with MIME types.
>
>         http://hackage.haskell.org/cgi-bin/hackage-scripts/package/mime

FWIW, I have some similar but slightly different functions in MissingH.

http://software.complete.org/static/missingh/doc//MissingH/Data-MIME-Types.html

hsemail and WASH both also have some stuff in this area.  Probably not as 
nice as yours though.

-- John
From P.Achten at cs.ru.nl  Tue Apr 22 10:40:07 2008
From: P.Achten at cs.ru.nl (Peter Achten)
Date: Tue Apr 22 11:04:17 2008
Subject: [Haskell] Second Call for Participation TFP 2008, The Netherlands
Message-ID: <480DF8C7.2000801@cs.ru.nl>

SECOND CALL FOR PARTICIPATION
TRENDS IN FUNCTIONAL PROGRAMMING 2008
RADBOUD UNIVERSITY NIJMEGEN, THE NETHERLANDS
MAY 26-28, 2008
INVITED SPEAKER: PROF. HENK BARENDREGT
http://www.st.cs.ru.nl/AFP_TFP_2008/

[ LATE REGISTRATION FEE IS SAME AS EARLY REGISTRATION FEE ]
[ LATE REGISTRATION CLOSES AT MAY 5 ]

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
through acceptance by extended abstracts and full papers. A formal
post-symposium refereeing process selects the best articles presented
at the symposium for publication in a high-profile volume.

TFP 2008 is hosted by the Radboud University Nijmegen, The Netherlands,
and will be held in the rural setting of Center Parcs ?Het Heijderbos?,
Heijen (in the vicinity of Nijmegen), The Netherlands.

TFP 2008 is co-located with the 6th Int?l. Summer School on Advanced
Functional Programming (AFP?08), which is held immediately before TFP?08.


PROGRAM INFORMATION
We have selected papers in the following themes:

(*) Types
(*) Applications
(*) Parallellism
(*) Refactoring
(*) Reactive Systems
(*) Memory Analysis
(*) Software Construction & Program Transformation
(*) Reasoning

The preliminary program can be found on the site:

http://www.st.cs.ru.nl/AFP_TFP_2008/documents/preliminary_program_TFP_2008.pdf



VENUE INFORMATION
TFP (and AFP) is held in The Netherlands, at Center Parcs ?Het
Heijderbos? which is a holiday resort in the woodlands near the
city of Nijmegen. We accomodate participants in DeLuxe Cottages,
each of which has three separate bed-rooms, shared bathroom,
toilet, kitchen, and terrace. Cottages will be shared by three
participants. If you wish to reduce costs, you can choose to
share a bedroom. The summer school and symposium will take place
in the business center of the venue. Breakfast, lunch and diner
is included within the limits of the venue. The resort features,
amongst others, a sub-tropical swimming pool (free for
participants), restaurants, shops, water sports lake, midget golf
court, squash court, and outdoor and indoor tennis courts.

Nijmegen is considered to be the oldest city of the Netherlands,
being approximately 2000 years old. Nijmegen is located at the
east border of the Netherlands, near Germany. Nijmegen can be
reached easily from several airports such as Schiphol airport,
Eindhoven airport, and D?sseldorf airport, as well as by train
and car. Conveniently close to Center Parcs ?Het Heijderbos? you
will find airport Weeze in Germany. The venue Center Parcs ?Het
Heijderbos? can be reached from Nijmegen by t