ANNOUNCE: hs-json-rpc 0.0.0.1

Dear Haskellers,

I am happy (and slightly intimidated) to present my first Haskell project: hs-
json-rpc, a JSON-RPC library written in Haskell.

It is inspired by HaXR and its use is, I hope, simple.

It supports JSON-RPC versions 1 and 2 with HTTP POST as transport. It may in 
the future support more transports and also server-side applications.

hs-json-rpc is available:
  * On Hackage: http://hackage.haskell.org/package/hs-json-rpc
  * Source repo: http://patch-tag.com/r/Azel/hs-json-rpc

Feedback is very welcome, and as it is my first published Hackage package, I 
expect quite a few.

Best regards,
ARJANEN Loïc

Haskell Weekly News: Issue 214

_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell

[ANNOUNCE] JuicyPixels 1.1 - image loading library (maintenance release)

Hello list,

   This is a maintenance release without new functionality, the central change is the switch from Haskell
Array to Data.Vector (to ease it's use for OpenGL texture loading).

Juicy.Pixels 1.1 change log :

 - Fixing automatic bitmap decoding, the decodeImage function wasn't trying to decode bitmap
 - Converting Haskell array types to Data.Vector (thanks to Jason Dagit)
 - Some tiny documentation enhancement

Hackage : http://hackage.haskell.org/package/JuicyPixels
GitHub    : https://github.com/Twinside/Juicy.Pixels

Thanks
Vincent Berthoux

ANNOUNCE: system-filepath 0.4.5 and system-fileio 0.3.4

Both packages now have much-improved support for non-UTF8 paths on
POSIX systems. There are no significant changes to Windows support in
this release.

system-filepath 0.4.5:
Hackage: http://hackage.haskell.org/package/system-filepath-0.4.5
API reference: https://john-millikin.com/software/haskell-filesystem/reference/system-filepath/0.4.5/

system-fileio 0.3.4:
Hackage: http://hackage.haskell.org/package/system-fileio-0.3.4
API reference: https://john-millikin.com/software/haskell-filesystem/reference/system-fileio/0.3.4/Filesystem/

-----

In GHC  7.2 and later, file path handling in the platform libraries
was changed to treat all paths as text (encoded according to locale).
This does not work well on POSIX systems, because POSIX paths are byte
sequences. There is no guarantee that any particular path will be
valid in the user's locale encoding.

system-filepath and system-fileio were modified to partially support
this new behavior, but because the underlying libraries were unable to
represent certain paths, they were still "broken" when built with GHC
7.2+. The changes in this release mean that they are now fully
compatible (to the best of my knowledge) with GHC 7.2 and 7.4.

Important changes:

* system-filepath has been converted from GHC's escaping rules to its
own, more compatible rules. This lets it support file paths that
cannot be represented in GHC 7.2's escape format.

* The POSIX layer of system-fileio has been completely rewritten to
use the FFI, rather than System.Directory. This allows it to work with
arbitrary POSIX paths, including those that GHC itself cannot handle.
The Windows layer still uses System.Directory, since it seems to work
properly.

* The POSIX implementation of createTree will no longer recurse into
directory symlinks that it does not have permission to remove. This is
a change in behavior from the directory package's implementation. See
http://www.haskell.org/pipermail/haskell-cafe/2012-January/098911.html
for details and the reasoning behind the change. Since Windows does
not support symlinks, I have not modified the Windows implementation
(which uses removeDirectoryRecursive).

CFP TFPIE 2012

CALL FOR PAPERS/PRESENTATIONS TFPIE 2012
International Workshop on Trends in Functional Programming in Education 2012
June 11 2012
University of St Andrews, Scotland
http://www.cs.ru.nl/P.Achten/TFPIE_2012/TFPIE_2012_home.html

The first International Workshop on Trends in Functional Programming
in Education, TFPIE 2012, will be co-located with TFP 2012 at the
University of St Andrews in Scotland. The goal of TFPIE is to gather
researchers, professors, teachers, and all professionals that use or
are interested in the use of functional programming in education.
TFPIE aims to be a venue where novel ideas, classroom-tested ideas,
and work in progress on the use of functional programming in education
are discussed. The one-day workshop will foster a spirit of open
discussion by having a review process for publication after the
workshop.

The program chairs of TFPIE 2012 will screen submissions to ensure
that all presentations are within scope and are of interest to
participants. Potential presenters are invited to submit an extended
abstract (4-6 pages) or an article (up to 16 pages). The authors of
all accepted presentations will have their preprints and their slides
made available on the workshop's website/wiki. Any visitors to the
TFPIE 2012 website/wiki will be able to add comments. This includes
presenters who may respond to comments and questions as well as
provide pointers to improvements and follow-up work. After the
workshop, the program committee will review, using prevailing academic
standards, the articles accepted for presentation to select the best
for publication in Electronic Proceedings in Theoretical Computer
Science (EPTCS). Articles rejected for presentation and all extended
abstracts will not be formally reviewed by the PC.

TOPICS OF INTEREST

TFPIE 2012 welcomes submissions describing practical techniques used
in the classroom, tools used and/or developed, and any creative use of
functional programming (FP) to aid education in or outside Computer
Science. Topics of interest include, but are not limited to:

FP and beginning CS students
FP in Artificial Intelligence
FP in Robotics
FP and Music
Advanced FP for undergraduates
FP in graduate education
Engaging students in research using FP
FP in Programming Languages
FP in the high school curriculum
FP as a stepping stone to other CS topics
FP and Philosophy

If you are not sure if your work is appropriate for TFPIE 2012, please
contact the PC chairs by e-mail at: tfpie2012 <at> cs.ru.nl .

Program Committee

Peter Achten, Radboud University Nijmegen
Jost Berthold, University of Copenhagen
Marc Feeley, University of Montreal
Ralf Hinze, University of Oxford
Shriram Krishnamurthi, Brown University
Michel Mauny, ENSTA Paris Tech
James McKinna, UK
Marco T. Morazan, Seton Hall University
Rinus Plasmeijer, Radboud University Nijmegen
Simon Thompson, University of Kent

Important Dates

May 20        submission of abstract or article
May 25        notification of acceptance
June 11       TFPIE
July 6        submission of formal paper
September 10  notification of acceptance
October 1     camera-ready paper

Venue

The University of St Andrews is Scotland's first university and the
third oldest in the English-speaking world, founded in 1413. Over six
centuries it has established a reputation as one of Europe's leading
and most distinctive centers for teaching and research. St Andrews is
situated on the east coast of Fife, Scotland, UK. The town is
approximately 50 miles north-east of Edinburgh, 14 miles south-east of
Dundee, 78 miles south of Aberdeen, and 82 miles east of Glasgow
making it easily accessible by any means of transportation. Help on
traveling to St Andrews can be found at:
http://www.st-andrews.ac.uk/visiting/GettingtoStAndrews/ .

Questions?

If you have any questions, do not hesitate to contact us at:
tfpie2012 <at> cs.ru.nl .

--

-- 

Cheers,

Marco

_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell

ANNOUNCE: GHC version 7.4.1

   =============================================================
    The (Interactive) Glasgow Haskell Compiler -- version 7.4.1
   =============================================================

The GHC Team is pleased to announce a new major release of GHC, 7.4.1.

Here are some of the highlights of the 7.4 branch since 7.2 and 7.0:

  * The Num class no longer has Eq or Show superclasses.

  * There is a new feature Safe Haskell (-XSafe, -XTrustworthy, -XUnsafe).
    The design has changed since 7.2.

  * There is a new feature kind polymorphism (-XPolyKinds).
    A side-effect of this is that, when the extension is not enabled, in
    certain circumstances kinds are now defaulted to * rather than being
    inferred.

  * There is a new feature constraint kinds (-XConstraintKinds).

  * It is now possible to give any sort of declaration at the ghci prompt.
    For example, you can now declare datatypes within ghci.

  * The profiling and hpc implementations have been merged and overhauled.
    Visible changes include renaming of profiling flags, and a new
    semantics for the cost-centre stacks (which should in most cases
    result in more useful and intuitive profiles). The +RTS -xc flag now
    also gives a stack trace.

  * It is now possible to write compiler plugins.

  * DPH support has been significantly improved.

  * There is now preliminary support for registerised compilation using
    LLVM on the ARM platform.

Full release notes are here:

  http://www.haskell.org/ghc/docs/7.4.1/html/users_guide/release-7-4-1.html

How to get it
~~~~~~~~~~~~~

The easy way is to go to the web page, which should be self-explanatory:

        http://www.haskell.org/ghc/

We supply binary builds in the native package format for many
platforms, and the source distribution is available from the same
place.

Packages will appear as they are built - if the package for your
system isn't available yet, please try again later.

Background
~~~~~~~~~~

Haskell is a standard lazy functional programming language.

GHC is a state-of-the-art programming suite for Haskell.  Included is
an optimising compiler generating good code for a variety of
platforms, together with an interactive system for convenient, quick
development.  The distribution includes space and time profiling
facilities, a large collection of libraries, and support for various
language extensions, including concurrency, exceptions, and foreign
language interfaces (C, whatever).  GHC is distributed under a
BSD-style open source license.

A wide variety of Haskell related resources (tutorials, libraries,
specifications, documentation, compilers, interpreters, references,
contact information, links to research groups) are available from the
Haskell home page (see below).

On-line GHC-related resources
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Relevant URLs on the World-Wide Web:

GHC home page              http://www.haskell.org/ghc/
GHC developers' home page  http://hackage.haskell.org/trac/ghc/
Haskell home page          http://www.haskell.org/

Supported Platforms
~~~~~~~~~~~~~~~~~~~

The list of platforms we support, and the people responsible for them,
is here:

   http://hackage.haskell.org/trac/ghc/wiki/Contributors

Ports to other platforms are possible with varying degrees of
difficulty.  The Building Guide describes how to go about porting to a
new platform:

    http://hackage.haskell.org/trac/ghc/wiki/Building

Developers
~~~~~~~~~~

We welcome new contributors.  Instructions on accessing our source
code repository, and getting started with hacking on GHC, are
available from the GHC's developer's site run by Trac:

  http://hackage.haskell.org/trac/ghc/

Mailing lists
~~~~~~~~~~~~~

We run mailing lists for GHC users and bug reports; to subscribe, use
the web interfaces at

    http://www.haskell.org/mailman/listinfo/glasgow-haskell-users
    http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs

There are several other haskell and ghc-related mailing lists on
www.haskell.org; for the full list, see

    http://www.haskell.org/mailman/listinfo/

Some GHC developers hang out on #haskell on IRC, too:

    http://www.haskell.org/haskellwiki/IRC_channel

Please report bugs using our bug tracking system.  Instructions on
reporting bugs can be found here:

    http://www.haskell.org/ghc/reportabug

PhD studentship in Nottingham (closing date 10th February)

Dear all,

I am currently advertising a PhD Studentship in Functional
Programming at the University of Nottingham in the UK:

   http://www.nottingham.ac.uk/jobs/currentvacancies/ref/SCI1088

The closing date is *** Friday 10th February 2012 ***.   If
you would like to apply, please follow the instructions in
the advert, rather than clicking on "apply online".

Many thanks,

Graham Hutton

--  
Prof Graham Hutton
Functional Programming Lab
School of Computer Science
University of Nottingham, UK
http://www.cs.nott.ac.uk/~gmh

This message and any attachment are intended solely for the addressee and may contain confidential
information. If you have received this message in error, please send it back to me, and immediately delete
it.   Please do not use, copy or disclose the information contained in this message or in any attachment.  Any
views or opinions expressed by the author of this email do not necessarily reflect the views of the
University of Nottingham.

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.

WING 2012: First Call for Papers

[Please post - apologies for multiple copies.]

----------------------------------------------------
WING 2012 - 4th International Workshop on INvariant Generation
         http://cs.nyu.edu/acsys/wing2012/
                June 30, 2012
   Manchester, UK (a satellite Workshop of IJCAR 2012)
----------------------------------------------------
        --- First Call for Papers ---

General
-------

The ability to automatically extract and synthesize auxiliary
properties of programs has had a profound effect on program analysis,
testing, and verification over the last several decades. A key
impediment for program verification is the overhead associated with
providing, debugging, and verifying auxiliary invariant
annotations. Releasing the software developer from this burden is
crucial for ensuring the practical relevance of program verification.
In the context of testing, suitable invariants have the potential of
enabling high-coverage test-case generation. Thus, invariant
generation is a key ingredient in a broad spectrum of tools that help
to improve program reliability and understanding. As the design and
implementation of reliable software remains an important issue, any
progress in this area will have a significant impact.

The increasing power of automated theorem proving and computer algebra
has opened new perspectives for computer-aided program verification;
in particular for the automatic generation of inductive assertions in
order to reason about loops and recursion. Especially promising
breakthroughs are invariant generation techniques by Groebner bases,
quantifier elimination, and algorithmic combinatorics, which can be
used in conjunction with model checking, theorem proving, static
analysis, and abstract interpretation. The aim of this workshop is to
bring together researchers from these diverse fields.

Scope
-----

We encourage submissions presenting work in progress, tools under
development, as well as work by PhD students, such that the
workshop can become a forum for active dialogue between the groups
involved in this new research area.

Relevant topics include (but are not limited to) the following:

* Program analysis and verification
* Inductive Assertion Generation
* Inductive Proofs for Reasoning about Loops
* Applications to Assertion Generation using the following tools:
- Abstract Interpretation,
- Static Analysis,
- Model Checking,
- Theorem Proving,
- Theory Formation,
- Algebraic Techniques
* Tools for inductive assertion generation and verification
* Alternative techniques for reasoning about loops

Committee
-----------------

Program Chairs:

* Gudmund Grov (University of Edinburgh, UK)
* Thomas Wies (New York University, USA)

Program Committee:

* Clark Barrett (New York University, USA) 
* Nikolaj Bjorner (Microsoft Research, USA)
* Gudmund Grov (University of Edinburgh, UK)
* Ashutosh Gupta (IST Austria)
* Bart Jacobs (Katholieke Universiteit Leuven, Belgium) 
* Moa Johansson (Chalmers University of Technology, Sweden)
* Laura Kovacs (Vienna University of Technology, Austria)
* David Monniaux (VERIMAG, France)
* Enric Rodriguez Carbonell (Technical University of Catalonia, Spain) 
* Helmut Veith (Vienna University of Technology, Austria)
* Thomas Wies (New York University, USA)

Important Dates
---------------

Submission deadline: April 06, 2012
Notification of acceptance: May 04, 2012
Final version due: June 08, 2012
Workshop: June 30, 2012

Submission
----------

WING 2012 encourages submissions in the following two categories:

* Original papers: contain original research (simultaneous submissions
are not allowed) and sufficient detail to assess the merits and
relevance of the submission. Given the informal style of the
workshop, papers describing work in progress, with sufficient detail
to assess the contribution, are also welcome. Original papers should
not exceed 15 pages. 

* Extended abstracts: contain preliminary reports of work in progress,
case studies, or tool descriptions. These will be judged based on
the expected level of interest for the WING community. They will be
included in the CEUR-WS proceedings. Extended abstracts should not
exceed 5 pages. 

All submissions should conform to Springer's LNCS format. Formatting style 
files can be found at 

 http://www.springer.de/comp/lncs/authors.html 

Technical details may be included in an appendix to be read at the reviewers' 
discretion and to be omitted in the final version.

Please prepare your submission in accordance with the rules described above and 
submit a pdf file via

 https://www.easychair.org/?conf=wing2012

Publication
-----------

All submissions will be peer-reviewed by the program committee.
Accepted contributions will be published in archived electronic notes,
as a volume of CEUR Workshop Proceedings.

A special issue of the Journal of Science of Computer Programming with
extended versions of selected papers will be published after the workshop.

--

-- 
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.

ANNOUNCE multiarg - parser combinators for command line parsing

multiarg is a parser combinator library to build command line parsers.
With it you can easily create parsers with options that take more than
one option argument--for example, I created multiarg due to the apparent
lack of such ability amongst other parsers. Its basic design is loosely
inspired by Parsec.

Provides ParserT, a monad you use to build parsers. ParserT is a monad
transformer, so you can layer it on top of other monads. For instance
you could layer it on the IO monad so that your parser can perform IO.

It also has a simple, pre-built parser built with the underlying
combinators, which works for many situtations and shields you from the
underlying complexity if you don't need it. 

Any feedback you might have is much appreciated. You can email or fork
it on github. The Haddock comments are extensive so those should be able
to get you started.

multiarg on Hackage:

http://hackage.haskell.org/package/multiarg

multiarg's git repository:

https://github.com/massysett/multiarg

CFP: PPDP 2012 in Leuven, Belgium

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

                          Call for papers
           14th International ACM SIGPLAN Symposium on
        Principles and Practice of Declarative Programming
                            PPDP 2012

 	Special Issue of Science of Computer Programming (SCP)

             Leuven, Belgium, September 18-20, 2012
                  (co-located with LOPSTR 2012)

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

PPDP 2012 is a forum that brings together researchers from the declarative 
programming communities, including those working in the logic, constraint and 
functional programming paradigms, but also embracing a variety of other 
paradigms such as visual programming, executable specification languages, 
database languages, and knowledge representation languages. The goal is to 
stimulate research in the use of logical formalisms and methods for specifying, 
performing, and analysing computations, including mechanisms for mobility, 
modularity, concurrency, object-orientation, security, verification and static 
analysis. Papers related to the use of declarative paradigms and tools in 
industry and education are especially solicited. Topics of interest include, 
but are not limited to:

*	Functional programming
*	Logic programming
*	Answer-set programming
*	Functional-logic programming
*	Declarative visual languages
*	Constraint Handling Rules
*	Parallel implementation and concurrency
*	Monads, type classes and dependent type systems
*	Declarative domain-specific languages
*	Termination, resource analysis and the verification of declarative programs
*	Transformation and partial evaluation of declarative languages
*	Language extensions for security and tabulation
*	Probabilistic modelling in a declarative language and modelling reactivity
*	Memory management and the implementation of declarative systems
*	Practical experiences and industrial application

This year the conference will be co-located with the 22nd International 
Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2012) and 
held in cooperation with ACM SIGPLAN.  The conference will be held in Leuven, 
Belgium. Previous symposia were held at Odense (Denmark), Hagenberg (Austria), 
Coimbra (Portugal), Valencia (Spain), Wroclaw (Poland), Venice (Italy), Lisboa 
(Portugal), Verona (Italy), Uppsala (Sweden), Pittsburgh (USA), Florence 
(Italy), Montreal (Canada), and Paris (France).

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). Proceedings will be published by ACM Press*

After the symposium, a selection of the best papers will be invited to extend 
their submissions in the light of the feedback solicited at the symposium.  The 
papers are expected to include at least 25% extra material over and above the 
PPDP version. Then, after another round of reviewing, these revised papers will 
be published in a special issue of SCP with a target publication date by 
Elsevier of 2013.

Important Dates

 	Abstract Submission: 		May 28, 2012
 	Paper submission: 		May 31, 2012
 	Notification: 			July 6, 2012
 	Camera-ready: 			July 18, 2012

 	Symposium: 			September 19-21, 2012

 	Invites for SCP: 		September 26, 2012
 	Submission of SCP: 		December 12, 2012
 	Notification from SCP: 		February 7, 2013
 	Camera-ready for SCP: 		March 7, 2013

Authors should submit an electronic copy of the paper (written in English) in 
PDF. Each submission must include on its first page the paper title; authors 
and their affiliations; abstract; and three to four keywords. The keywords will 
be used to assist us in selecting appropriate reviewers for the paper. Papers 
should consist of no more than 12 pages, formatted following the ACM SIG 
proceedings template (option 1). The 12 page limit must include references but 
excludes well-marked appendices not intended for publication. Referees are not 
required to read the appendices, and thus papers should be intelligible without 
them.

Program Committee:

Slim Abdennadher 	German University in Cairo, Egypt
Puri Arenas		Complutense University of Madrid, Spain
Marcello Balduccini	Kodak Research Labs, USA
Amir Ben-Amram		Tel-Aviv Academic College, Israel
Philip Cox		Dalhousie University, Canada
Marina De Vos		University of Bath, UK
Martin Erwig		Oregon State University, USA
Martin Gebser		University of Potsdam, Germany
Jacob Howe		City University London, UK
Joxan Jaffar 		National University of Singapore, Singapore
Gabriele Keller 	University of New South Wales, Australia
Andy King		University of Kent, UK
Julia Lawall 		INRIA Paris, France
Rita Loogen 		Philipps-Universitat Marburg, Germany
Greg Michaelson		Heriot-Watt University, UK
Matthew Might		University of Utah, USA
Henrik Nilsson		University of Nottingham, UK
Catuscia Palamidessi	INRIA Saclay and Ecole Polytechnique, France
Kostis Sagonas 		Uppsala University, Sweden and NTUA, Greece
Taisuke Sato		Tokyo Institute of Technology, Japan
Peter Schneider-Kamp	University of Southern Denmark, Denmark
Tom Schrijvers		University of Ghent, Belgium
Terrance Swift		Universidade Nova de Lisboa, USA
Mirek Truszczynski	University of Kentucky, USA
Stephanie Weirich 	University of Pennsylvania, USA

Program Chair:

     Andy King
     School of Computing, University of Kent
     Canterbury, CT2 7NF, UK

General Co-Chairs

     Daniel De Schreye and Gerda Janssens
     Department of Computer Science
     K.U.Leuven, Celestijnenlaan 200 A, B-3001 Heverlee, Belgium

* Confirmation pending

CFP: LOPSTR 212 in Leuven, Belgium

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

                       Call for papers
                22nd International Symposium on
        Logic-Based Program Synthesis and Transformation
                          LOPSTR 2012

               http://costa.ls.fi.upm.es/lopstr12
             Leuven, Belgium, September 18-20, 2012
                  (co-located with PPDP 2012)

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

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 that authors can
incorporate this feedback in the published papers.

The 22nd International Symposium on Logic-based Program Synthesis and
Transformation (LOPSTR 2012) will be held in Leuven, Belgium; previous
symposia were held in Hagenberg, Coimbra, Valencia, Lyngby, Venice,
London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester,
Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, Manchester and
Odense (you might have a look at the contents of past LOPSTR
symposia). LOPSTR 2012 will be co-located with PPDP 2012
(International ACM SIGPLAN Symposium on Principles and Practice of
Declarative Programming).

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. Both full
papers and extended abstracts 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
     * verification
     * analysis
     * specialization
     * composition
     * certification
     * transformational techniques in SE
     * synthesis
     * transformation
     * optimisation
     * inversion
     * program/model manipulation
     * security
     * applications and tools

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).
Proceedings

The formal post-conference proceedings will be published by Springer*
in the Lecture Notes in Computer Science series.

Important Dates

       Abstract submission:                  May 21,2012
       Paper submission:                     May 25, 2012
       Notification (for pre-proceedings):   June 29, 2012
       Camera-ready (for pre-proceedings):   July 8, 2012
       Symposium:                            September 18-20, 2012

Submissions must be formatted in the Lecture Notes in Computer Science
style. They cannot exceed 15 pages including references but excluding
well-marked appendices not intended for publication. Referees are not
required to read the appendices, and thus papers should be
intelligible without them.

Full papers can be directly accepted for publication in the formal
proceedings to be published by Springer in the LNCS series or accepted
only for presentation at the symposium. After the symposium, all
authors of extended abstracts and full papers accepted only for
presentation will be invited to revise and/or extend their submissions
in the light of the feedback solicited at the symposium. Then, after
another round of reviewing, these revised papers may also be published
in the formal proceedings.

Authors should submit an electronic copy of the paper (written in
English) in PDF or Postscript (Level 2). Each submission must include
on its first page the paper title; authors and their affiliations;
contact author's email; abstract; and three to four keywords. The
keywords will be used to assist us in selecting appropriate reviewers
for the paper. If electronic submission is impossible, please contact
the program chair for information on how to submit hard copies.

Papers should be submitted to the submission website for LOPSTR 2012.

Program Committee:

Elvira Albert           Complutense University of Madrid, Spain
Sergio Antoy            Portland State University, US
Demis Ballis            University of Udine, Italy
Henning Christiansen    Roskilde University, Denmark
Michael Codish          Ben-Gurion University of the Negev, Israel
Danny De Schreye        K.U.Leuven, Belgium
Esra Erdem              Sabanci University, Istanbul
Maribel Fernandez       King's College London, UK
John Gallagher          Roskilde University, Denmark
Miguel Gomez-Zamalloa   Complutense University of Madrid, Spain
Robert Glück           University of Copenhagen, Denmark
Rémy Haemmerlé	       Technical University of Madrid, Spain
Reiner Hähnle          TU Darmstadt, Germany
Geoff Hamilton          Dublin City University, Ireland
Carsten Fuhs            RWTH Aachen, Germany
Gerda Janssens          K.U.Leuven, Belgium
Isabella Mastroeni      University of Verona, Italy
Paulo Moura             Universidade da Beira Interior, Portugal
Kazutaka Matsuda        Tohoku University, Japan
Johan Nordlander        Luleå University of Technology, Sweden
Andrey Rybalchenko      Technische Universität München, Germany
Kostis Sagonas  Uppsala University, Sweden
Francesca Scozzari      Università "G. D'Annunzio" di Chieti, Italy
Valerio Senni           Universtà di Roma "Tor Vergata", Italy
German Vidal            Technical University of Valencia, Spain

Program Chair:

     Elvira Albert
     Department of Computer Science (DSIC)
     Complutense University of Madrid
     Madrid, Spain

General Co-Chairs

     Daniel De Schreye and Gerda Janssens
     Department of Computer Science
     K.U.Leuven, Celestijnenlaan 200 A, B-3001 Heverlee, Belgium

* Confirmation pending

_______________________________________________
Haskell mailing list
Haskell <at> haskell.org
http://www.haskell.org/mailman/listinfo/haskell