Horváth Zoltán | 1 Mar 17:28 2011

CEFP 2011 summer school - CFP



  June 14-24, 2011




  The Central-European Functional Programming School is an
  intensive summer school in the field of functional programming.
  The invited lecturers are the most prominent researchers in the
  field in Europe, and they will present state-of-the-art functional
  programming techniques:

  * Andrew Butterfield (University of Dublin, Ireland): Reasoning about
  I/O in functional programs
  * Clemens Grelck (University of Amsterdam, The Netherlands): Multicore
  * Johan Jeuring (Utrecht University, The Netherlands): Strategies for
  learning functional programming
  * Rita Loogen (Philipps University Marburg, Germany): Eden
  * Simon Marlow (Microsoft Research, United Kingdom): Parallel and Concurrent Haskell
(Continue reading)

Janis Voigtländer | 1 Mar 17:39 2011



Call for Papers

20th International Workshop on Functional and (Constraint) Logic Programming
WFLP 2011
Odense, Denmark
July 19, 2011
Co-located with PPDP 2011, LOPSTR 2011, AAIP 2011

Conference Overview:

The 20th International Workshop on Functional and (Constraint) Logic 
Programming will
take place in July 2011 in Odense, Denmark.
The Workshop on Functional and (Constraint) Logic Programming aims at 
bringing together
researchers interested in functional programming, (constraint) logic 
programming, as well as
the integration of the two paradigms. It promotes the cross-fertilizing 
exchange of ideas and
experiences among researchers and students from the different 
communities interested in the
foundations, applications and combinations of high-level, declarative 
programming languages
and related areas.

WFLP 2011 solicits papers in all areas of functional and (constraint) 
(Continue reading)


PhD Position: Bioinformatics / Graph Optimization


if you know a student interested in applying her or his knowledge in
algorithms (especially graph optimization) please note her or him of
this opening or forward to interested parties.

PhD Position: Bioinformatics / Graph Optimization

We are looking for a Diploma / Masters student to join our group in
Vienna, Austria within the newly formed "InitiativKolleg Computational

The InitiativKolleg ties together groups from computer science, applied
mathematics, physics, and bioinformatics.

Possible topics (in our group) include RNA folding dynamics or
evolvability of metabolic networks.

We offer the opportunity to work within a highly motivated group of
people, with a lot of interesting work being offered. We strongly
encourage independent research, meaning that you have the possibility
to bring your own ideas and carry out your own research.

Our institute is conveniently located directly in Vienna, one of the
cities most worth living in.

Applications should be done via the job center of the University of
Vienna, https://univis.univie.ac.at/ausschreibungstellensuche/
identifier 1800 until March 15, 2011.

(Continue reading)

Michael Hanus | 1 Mar 22:56 2011

CfP: PPDP 2011

                           CALL FOR PAPERS

                               PPDP 2011
               13th International ACM SIGPLAN Symposium on
            Principles and Practice of Declarative Programming
                  July 20-22, 2011, Odense, Denmark

     (in cooperation with ACM SIGPLAN, co-located with LOPSTR 2011)

PPDP 2011 aims to provide 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,
AI languages and knowledge representation languages used, for example,
in the semantic web. The goal is to stimulate research in the use of
logical formalisms and methods for specifying, performing, and
analyzing computations, including mechanisms for mobility, modularity,
concurrency, object-orientation, security, and static analysis. Papers
related to the use of declarative paradigms and tools in industry and
education are especially solicited.

The conference will held in cooperation with ACM SIGPLAN
and take place in July 2011 in Odense, Denmark, co-located
with the 21st International Symposium on Logic-Based Program
Synthesis and Transformation (LOPSTR 2011).

(Continue reading)

Marco Gaboardi | 1 Mar 23:43 2011

Oregon Programming Languages Summer School 2011 - Call For Participation


Call For Participation

Types, Semantics and Verification
10th Annual Oregon Programming Languages Summer School (OPLSS 2011)
University of Oregon, Eugene. June 16  - July 1, 2011

=> Registration Deadline: March 4, 2011


The focus of this summer school is the mix or interplay of theory and  
practice in program verification. The main aim is to enable  
participants to conduct research in the area, thereby contributing to  
improve software quality.

The Oregon Programming Languages Summer School (OPLSS) has been held  
at the University of Oregon each summer since 2002. This year, in the  
occasion of the tenth anniversary of the summer school, two plenary  
lectures will complement the technical program.


Technical Program

Logical Relations
Amal Ahmed - Indiana University

(Continue reading)

Temur Kutsia | 2 Mar 12:50 2011

Last CfP: JAL Special Issue on Automated Specification and Verification of Web Systems

[Apologies for multiple copies]

Special Issue on Automated Specification and Verification of Web Systems


This special issue of the Journal of Applied Logic is related
to the topics of the workshop WWV'10: Automated Specification
and Verification of Web Systems, which took place in Vienna on
July 30-31, 2010. Both participants of the workshop and other
authors are invited to submit contributions.

The increased complexity of Web sites and the explosive growth
of Web-based applications has turned their design and
construction into a challenging problem. Nowadays, many
companies have diverted their Web sites into interactive,
completely-automated, Web-based applications (such as Amazon,
on-line banking, or travel agencies) with a high complexity
that requires appropriate specification and verification
techniques and tools. Systematic, formal approaches to the
analysis and verification can address the problems of this
particular domain with automated and reliable tools that also
incorporate semantic aspects.

We solicit original papers on logic-based methods and
(Continue reading)

Trystan Spangler | 3 Mar 01:49 2011

ANNOUNCE: hspec-0.3.0 (better reporting of failed examples)

hspec version 0.3.0, Behavior Driven Development for Haskell, is now available!

Improvements include fixing a base dependancy problem and better reporting of failed examples.

Much thanks to Greg Weber for fixes and ideas!


As always, any advice, comments, or questions are welcome,
Trystan Spangler

For those who would like to see an example, running this program:

> import Test.Hspec
> import Test.Hspec.HUnit
> import Test.Hspec.QuickCheck (property)
> import Test.HUnit (assertBool, assertEqual)
> main = hspec specs
> specs = describe "hspec 0.3.0" [
>   it "still allows a Bool expression to act as an example"
>       (replicate 5 1 == [1,1,1,1,1]),
>   it "still allows HUnit assertions to act as examples"
>       (assertBool "lame example" True),
>   it "still allows QuickCheck properties to act as examples"
>       (property $ \ i -> (i::Int) == i + 1 - 1),
(Continue reading)

Daniel Santa Cruz | 3 Mar 03:48 2011

Haskell Weekly News: Issue 171

   Welcome to issue 171 of the HWN, a newsletter covering developments
   in the [1]Haskell community. This release covers the week of
   February 20 - 26, 2011 .


   Eric Kow [2]announced that the Darcs project is staring to organize the
   next hacking sprint, which will be "most likely in Paris in this
   spring. If you fancy a weekend of hacking Haskell on a really neat real
   world project, come join...!"

   Jose Pedro Magalhaes [3]informed us of the initial release of htime, a
   library to mimic the unix "time" utility.

   Iain Alexander [4]annouced the initial release of data-type,
   function-combine, and flexiwrap. "data-type contains a number of
   fundamental types and classes useful for type-level programming, such
   as type-level booleans, natural numbers, and lists."

   I'd like to once again recognize some of the members of the community
   that spend their time fielding questions from the new commers. If you
   haven't been in the #haskell irc channel, you are just missing out!
   There are also those who spend their time writting great answers to the
   many questions in haskell's StackOverflow tag. You are what make this
   community an inviting place for all the people interested in Haskell.
   Keep it up!

Quotes of the Week

     kmc: but rarely do beginners come to #haskell and say "i want to
(Continue reading)

Ian Lynagh | 3 Mar 15:41 2011

ANNOUNCE: GHC version 7.0.2

    The (Interactive) Glasgow Haskell Compiler -- version 7.0.2

The GHC Team is pleased to announce a new patchlevel release of GHC.
This release contains a number of bugfixes relative to 7.0.1, so we
recommend upgrading.

The release notes are here:


How to get it

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


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

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


(Continue reading)

Michal Konečný | 3 Mar 17:44 2011

ANN: hmpfr-0.3.2 (requires integer-simple, supports mpfr 3.0.0)

Dear all,

I am pleased to announce hmpfr-0.3.2, a new version of Aleš Bizjak's bindings 
to the MPFR arbitrary precision floating point arithmetic library.  The 
changes in this version are quite small but significant:

- support for MPFR 3.0.0 as well as MPFR 2.4.*
- dependency on integer-simple instead of integer-gmp

The latter is most significant because unfortunately it makes it rather more 
difficult to install hmpfr.   Currently almost all binary distributions of ghc 
have integer-gmp compiled in to provide the Integer type via the standard GMP 
library.  Also haskell platform 2010.2.0.0 assumes that ghc has been compiled 
with integer-gmp although it makes no specific use of it.  Instructions on how 
to compile ghc and haskell platform with integer-simple instead of integer-gmp 
are on:


The rationale for this change is the fact that despite much effort hmpfr is 
very unreliable on ghc that includes integer-gmp due to ghc deallocating GMP 
data that was allocated by MPFR at unpredictable times.

Aleš and I hope that hmpfr can return to using integer-gmp once the proposal 


to replace gmp with a modified gmp in ghc is implemented and made the default.

Best regards,
(Continue reading)