- Haskell - Haskell.org

ANNOUNCE: GHC version 7.0.2
by Ian Lynagh 04 Mar '11

04 Mar '11

============================================================= 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: http://www.haskell.org/ghc/docs/7.0.2/html/users_guide/release-7-0-2.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

3 2

ANN: haskell-pgm 0.1.2
by Frederick Ross 04 Mar '11

04 Mar '11

I am pleased to announce the release haskell-pgm 0.1.2, a minor upgrade to the library to make it work with GHC 7. Sergey Astanin did all the work in this upgrade, so big thanks to him. What a delight to receive functioning code in my inbox... haskell-pgm is a pure Haskell library for reading and writing PGM images. It supports multiple images per file and encoding arbitrary metadata into the image headers. -- Frederick Ross Bioinformatics and Biostatistics Core Facility Life Sciences, EPFL http://bbcf.epfl.ch/ +41 21 693 14 39

1 0

ANN: hmpfr-0.3.2 (requires integer-simple, supports mpfr 3.0.0)
by Michal Konečný 03 Mar '11

03 Mar '11

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: http://code.google.com/p/hmpfr/wiki/GHCWithoutGMP 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 http://hackage.haskell.org/trac/ghc/wiki/ReplacingGMPNotes#BinaryDropinRepl… to replace gmp with a modified gmp in ghc is implemented and made the default. Best regards, Michal -- |o| Michal Konecny <mikkonecny(a)gmail.com> |o| http://www-users.aston.ac.uk/~konecnym/ |o| office: (+42) (0)121 204 3462 |o| PGP key http://www-users.aston.ac.uk/~konecnym/ki.aston

1 0

Haskell Weekly News: Issue 171
by Daniel Santa Cruz 03 Mar '11

03 Mar '11

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 . Announcements 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 append two lists, but i don't understand all this Monoid business, i hear they're like taco salad" Eduard:_Munteanu [In response to "GHC can go jump out a window" and "GHC has already jumped out a window and flied and left you behind"] Yes, GHC even implements optimizations such as defenestration. Top Reddit Stories * What kind of things are easy in Haskell and hard in Scala, and vice versa?: From (programmers.stackexchange.com) scored 47 with 34 comments. Read on [5]reddit or the [6]original post. * Multiday Debugging GHC: From (blog.ezyang.com) scored 37 with 2 comments. Read on [7]reddit or the [8]original post. * Making OpenCL Simple with Haskell [pdf]: From (developer.amd.com) scored 35 with 11 comments. Read on [9]reddit or the [10]original post. * GHC 7.0.2 RC 2 available. Please test!: From (haskell.org) scored 33 with 5 comments. Read on [11]reddit or the [12]original post. * Minecraft data API for Haskell: HaskellNBT: From (blog.acfoltzer.net) scored 27 with 4 comments. Read on [13]reddit or the [14]original post. * Dependently Typed Programming: an Agda Introduction: From (youtube.com) scored 25 with 5 comments. Read on [15]reddit or the [16]original post. * Minecraft network protocol and proxy in Haskell: From (github.com) scored 25 with 1 comments. Read on [17]reddit or the [18]original post. * Threading State - a short tutorial for new Haskell programmers: From (mtnviewmark.wordpress.com) scored 22 with 3 comments. Read on [19]reddit or the [20]original post. * Solution (code) XCKD: Nerd Snipping: From (pgraycode.wordpress.com) scored 20 with 8 comments. Read on [21]reddit or the [22]original post. * Agda 2.2 released: From (permalink.gmane.org) scored 18 with 1 comments. Read on [23]reddit or the [24]original post. Top StackOverflow Answers * [25]Feed elements of a tuple to a function as arguments in Haskell? votes: 14 Function uncurry converts a two-argument (curried) function into a function on pairs. Here's its type signature: uncurry :: (a -> b -> c) -> (a, b) -> c You need to use it on printf, like this: mapM_ (uncurry $ printf "Values: %d %d\n") [(1,100),(2,350),(3,600),(4,200)] Another solution is to use pattern matching to deconstruct the tuple, ... * [26]What is the difference between different orderings of the same monad transformers? votes: 10 Edit: I originally got the cases backwards. Fixed now. The difference between orderings of monad transformer stacks really only matters when you're peeling off layers of the stack. type Procedure a = MaybeT (State ProcedureState) a In this case, you first run the MaybeT, which results in a stateful computation which returns a Maybe a. type Procedure a ... Top StackOverflow Questions * Real-world applications of zygohistomorphic prepromorphisms (votes: 54, answers: 2) [27]read * How to roll a fast BVH representation in Haskell (votes: 10, answers: 2) [28]read * curious about how âloop = loopâ is evaluated in Haskell (votes: 9, answers: 2) [29]read * What is the difference between different orderings of the same monad transformers? (votes: 8, answers: 3) [30]read * haskell function declaration (votes: 6, answers: 3) [31]read About the Haskell Weekly News To help create new editions of this newsletter, please send stories to dstcruz(a)gmail.com. I'm in dire need of finding good "quotes of the week". If you happen to come across any, please don't hesitate to send it along. Until next time, Daniel Santa Cruz References 1. http://haskell.org/ 2. http://article.gmane.org/gmane.comp.lang.haskell.cafe/86711 3. http://article.gmane.org/gmane.comp.lang.haskell.cafe/86731 4. http://article.gmane.org/gmane.comp.lang.haskell.general/18526 5. http://www.reddit.com/r/haskell/comments/ft6eh/what_kind_of_things_are_easy… 6. http://programmers.stackexchange.com/questions/51245/what-kind-of-things-ar… 7. http://www.reddit.com/r/haskell/comments/fsp4f/multiday_debugging_ghc/ 8. http://blog.ezyang.com/2011/02/multi-day-debugging/ 9. http://www.reddit.com/r/haskell/comments/fqmmu/making_opencl_simple_with_ha… 10. http://developer.amd.com/zones/OpenCLZone/publications/assets/MakingOpenCLS… 11. http://www.reddit.com/r/haskell/comments/fp5e8/ghc_702_rc_2_available_pleas… 12. http://www.haskell.org/pipermail/glasgow-haskell-users/2011-February/020056… 13. http://www.reddit.com/r/haskell/comments/fs2nw/minecraft_data_api_for_haske… 14. http://blog.acfoltzer.net/2010/12/minecraft-data-api-for-haskell-haskellnbt/ 15. http://www.reddit.com/r/haskell/comments/fr5c1/dependently_typed_programmin… 16. http://www.youtube.com/view_play_list?p=44F162A8B8CB7C87 17. http://www.reddit.com/r/haskell/comments/fsgaq/minecraft_network_protocol_a… 18. https://github.com/glguy/minecraft-proxy 19. http://www.reddit.com/r/haskell/comments/fq4k4/threading_state_a_short_tuto… 20. http://mtnviewmark.wordpress.com/2011/02/21/threading-state/ 21. http://www.reddit.com/r/haskell/comments/fr9v7/solution_code_xckd_nerd_snip… 22. http://pgraycode.wordpress.com/2011/02/23/solving-xkcds-nerd-snipping-probl… 23. http://www.reddit.com/r/haskell/comments/fp45s/agda_22_released/ 24. http://permalink.gmane.org/gmane.comp.lang.agda/2566 25. http://stackoverflow.com/questions/5117948/feed-elements-of-a-tuple-to-a-fu… 26. http://stackoverflow.com/questions/5075621/what-is-the-difference-between-d… 27. http://stackoverflow.com/questions/5057136/real-world-applications-of-zygoh… 28. http://stackoverflow.com/questions/5077243/how-to-roll-a-fast-bvh-represent… 29. http://stackoverflow.com/questions/5126759/curious-about-how-loop-loop-is-e… 30. http://stackoverflow.com/questions/5075621/what-is-the-difference-between-d… 31. http://stackoverflow.com/questions/5073058/haskell-function-declaration

1 0

Last CfP: JAL Special Issue on Automated Specification and Verification of Web Systems
by Temur Kutsia 02 Mar '11

02 Mar '11

[Apologies for multiple copies] ======================================================================== JOURNAL OF APPLIED LOGIC Special Issue on Automated Specification and Verification of Web Systems http://www.risc.uni-linz.ac.at/people/tkutsia/jal-wwv.html ======================================================================== SCOPE ----- 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 techniques applied to Web sites, Web services or Web-based applications, such as: * Rule-based approaches to Web systems analysis, certification, specification, verification, and optimization * Algebraic methods for verification and certification of Web systems * Formal models for describing and reasoning about Web systems * Model-checking, synthesis and debugging of Web systems * Abstract interpretation and program transformation applied to the semantic Web * Intelligent tutoring and advisory systems for Web specifications authoring * Web quality and Web metrics * Web usability and accessibility * Testing and evaluation of Web systems and applications SUBMISSION ---------- We expect original articles (typically 15-25 pages; submission of larger papers will be evaluated depending on editorial constraints) that present high-quality contributions that have not been previously published and that must not be simultaneously submitted for publication elsewhere. Submissions must comply with JAL's author guidelines. They must be written in English and should be prepared using the Elsevier LaTeX package. Submissions are encouraged via the EasyChair submission system: http://www.easychair.org/conferences/?conf=jalwwv2010. IMPORTANT DATES --------------- * Submission of papers: March 7, 2011. * Notification: June 6, 2011. GUEST EDITORS -------------- * Laura Kovács (Vienna University of Technology) * Temur Kutsia (RISC, Johannes Kepler University Linz)

1 0

Oregon Programming Languages Summer School 2011 - Call For Participation
by Marco Gaboardi 01 Mar '11

01 Mar '11

---------------------------------------------------------------------- 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 http://www.cs.uoregon.edu/Activities/summerschool/ => 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 Software Verification Andrew Appel - Princeton University Monadic Effects Nick Benton - Microsoft Research Metamathematics of Polymorphic Logics - applications Robert Constable - Cornell University Polarization and Focalization Pierre-Louis Curien - pi.r2 team, PPS, CNRS-Paris Diderot University- INRIA Type Theory Foundation Robert Harper - Carnegie Mellon University The Calculus of Inductive Constructions Hugo Herbelin - pi.r2 team, PPS, CNRS-Paris Diderot University-INRIA Compiler Certification Xavier Leroy - INRIA Programming languages in string diagrams Paul-Andre' Mellies - PPS, CNRS-Paris Diderot University Imperative Programming in Coq Greg Morrisett - Harvard University Proof Theory Foundation Frank Pfenning - Carnegie Mellon University Proof Theory in Coq Benjamin Pierce - University of Pennsylvania Semilattices, Domains, and Computability Dana Scott - Carnegie Mellon University - Berkeley University ---------------------------------------------------------------------- Plenary Lectures: Speaker: Dana Scott (Carnegie Mellon University and Berkeley University) Title: What is a Proof? -- Some Challenges for Automated Theorem Proving Speaker: Robert Constable (Cornell University) Title: Metamathematics of Polymorphic Logics - foundations ---------------------------------------------------------------------- Registration Full information on registration are available at: http://www.cs.uoregon.edu/Activities/summerschool/ Registration Deadline: March 4, 2011 ---------------------------------------------------------------------- Some further activities will complement the main program. Coq-labs: Some of the lectures will assume interactive sessions using the interactive proof assistant Coq. Students are encouraged to bring a laptop on which Coq has been installed, and to form small working group during the interactive sessions. Moreover, some Coq-labs will be offered in order to give the participants the opportunity of make more practice in using Coq. Student Sessions: Interested students will have the opportunity to present their work during special sessions. Each presentation will consist of a brief talk about the student research interests and results. These sessions will be an occasion for students to obtain useful feedback on their work by other students and researchers, and also to interact with participants having similar research interests. We hope to see you in Eugene. Zena Ariola Pierre-Louis Curien Marco Gaboardi Robert Harper Hugo Herbelin

1 0

CfP: PPDP 2011
by Michael Hanus 01 Mar '11

01 Mar '11

====================================================================== CALL FOR PAPERS PPDP 2011 13th International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming http://www-ps.informatik.uni-kiel.de/ppdp11/ 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). TOPICS: - Logic, Constraint, and Functional Programming - Database, AI and Knowledge Representation Languages - Visual Programming - Executable Specification Languages - Applications of Declarative Programming - Methodologies: Program Design and Development - Declarative Aspects of Object-Oriented Programming - Concurrent Extensions to Declarative Languages - Declarative Mobile Computing - Integration of Paradigms - Proof Theoretic and Semantic Foundations - Type and Module Systems - Program Analysis and Verification - Program Transformation - Abstract Machines and Compilation - Programming Environments This list is not exhaustive - submissions describing new and interesting ideas relating broadly to declarative programming are encouraged. IMPORTANT DATES: Abstract submission: March 8, 2011 Paper submission: March 15, 2011 Notification: April 19, 2011 Camera-ready version: May 12, 2011 Symposium: July 20-22, 2011 SUBMISSION GUIDELINES: Papers should be submitted via the submission website for PPDP 2011: http://www.easychair.org/conferences/?conf=ppdp11 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). Papers should consist of the equivalent of 12 pages under the ACM formatting guidelines. These guidelines are available online, along with formatting templates or style files. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. Authors who wish to provide additional material to the reviewers beyond the 12-page limit can do so in clearly marked appendices: reviewers are not required to read such appendices. PROCEEDINGS: The proceedings will be published by ACM Press. Authors of accepted papers will be required to sign a copyright form. PROGRAM COMMITTEE: Peter Achten Radboud University Nijmegen, The Netherlands Sergio Antoy Portland State University, USA Michael Codish Ben-Gurion University of the Negev, Israel Moreno Falaschi Universita di Siena, Italy Amy Felty University of Ottawa, Canada Michael Hanus University of Kiel, Germany (Chair) Andy King University of Kent, UK Helene Kirchner INRIA, France Francisco J. Lopez Fraguas Universidad Complutense de Madrid, Spain Salvador Lucas Universidad Politecnica de Valencia, Spain Simon Peyton Jones Microsoft Research, Cambridge, UK Kostis Sagonas Uppsala University, Sweden Peter Schneider-Kamp University of Southern Denmark, Denmark Doaitse Swierstra Utrecht University, The Netherlands Paul Tarau University of North Texas, USA Peter Thiemann University of Freiburg, Germany Kazunori Ueda Waseda University, Japan Tarmo Uustalu Tallinn University of Technology, Estonia Peter Van Roy Catholic University of Louvain, Belgium For more information, contact the chairs: Program Chair: Michael Hanus University of Kiel, Germany Email: mh(a)informatik.uni-kiel.de Symposium Chair: Peter Schneider-Kamp University of Southern Denmark Email: petersk(a)imada.sdu.dk ----------------------------------------------------------------------

1 0

PhD Position: Bioinformatics / Graph Optimization
by Christian Hoener zu Siederdissen 01 Mar '11

01 Mar '11

Hi, 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 Science". 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. === For more information, contact Ivo Hofacker ivo(a)tbi.univie.ac.at more information about the IK: http://csc.mat.univie.ac.at/ik/

1 0

CFP WFLP 2011
by Janis Voigtländer 01 Mar '11

01 Mar '11

=============================================================================== 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 http://www.wi.uni-muenster.de/pi/konferenzen/wflp2011/wflp2011.htm =============================================================================== 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) logic programming, including but not limited to: • Foundations: formal semantics, rewriting and narrowing, non-monotonic reasoning, dynamics, type theory • Language Design: modules and type systems, multi-paradigm languages, concurrency and distribution • Implementation: abstract machines, parallelism, compile-time and run-time optimizations, interfacing with external • Transformation and Analysis: abstract interpretation, specialization, partial evaluation, program transformation, meta-programming • Software Engineering: design patterns, specification, verification and validation, debugging, test generation • Integration of Paradigms: integration of declarative programming with other paradigms such as imperative, object-oriented, concurrent, and real-time programming • Applications: declarative programming in education and industry, domain-specific languages, visual/graphical user interfaces, embedded systems, WWW applications, knowledge representation and machine learning, deductive databases, advanced programming environments and tools The previous WFLP editions were: WFLP 2010 (Madrid, Spain), WFLP 2009 (Brasilia, Brazil), WFLP 2008 (Siena, Italy), WFLP 2007 (Paris, France), WFLP 2006 (Madrid, Spain), WCFLP 2005 (Tallinn, Estonia), WFLP 2004 (Aachen, Germany), WFLP 2003 (Valencia, Spain), WFLP 2002 (Grado, Italy), WFLP 2001 (Kiel, Germany), WFLP 2000 (Benicassim, Spain), WFLP'99 (Grenoble, France), WFLP'98 (Bad Honnef, Germany), WFLP'97 (Schwarzenberg, Germany), WFLP'96 (Marburg, Germany), WFLP'95 (Schwarzenberg, Germany), WFLP'94 (Schwarzenberg, Germany), WFLP'93 (Rattenberg, Germany), and WFLP'92 (Karlsruhe, Germany). This year the workshop will be colocated with the 13th International Symposium on Principles and Practice of Declarative Programming (PPDP 2011), the 22st International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2011), and the International Workshop on Approaches and Applications of Inductive Programming (AAIP 2011). Proceedings: The proceedings will be published in the LNCS series of Springer-Verlag. Important Dates: Submission of abstract: April 9, 2011 Paper submission: April 10, 2011 Notification: May 1, 2011 Camera-ready: May 10, 2011 Workshop: July 19, 2011 Submission Guidelines: 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). Authors should submit an electronic copy of the full paper in PDF. Papers should be submitted via the submission website for WFLP 2011 at http://www.wi.uni-muenster.de/pi/konferenzen/wflp2011/wflp2011.htm Papers should consist of up to 15 pages under the LNCS formatting guidelines. These guidelines are available at http://www.springer.com/computer/lncs/ (follow link for LNCS authors) along with formatting templates and style files. Submitted papers will be judged on the basis of significance, relevance, correctness, originality, and clarity. They should include a clear identification of what has been accomplished and why it is significant. Program Committee: María Alpuente Universidad Politécnica de Valencia, Spain Sergio Antoy Portland State University, USA Rafael Caballero Roldán Universidad Complutense, Madrid, Spain Olaf Chitil University of Kent, UK Rachid Echahed Institut IMAG - Laboratoire Leibniz, France Santiago Escobar Universidad Politécnica de Valencia, Spain Moreno Falaschi University of Siena, Italy Sebastian Fischer National Institute of Informatics, Tokyo, Japan Michael Hanus Christian-Albrechts-Universität zu Kiel, Germany Herbert Kuchen (chair) Westfälische Wilhelms-Univ. Münster, Germany Julio Mariño y Carballo Universidad Politécnica de Madrid, Spain Janis Voigtländer Universität Bonn, Germany Contact: Herbert Kuchen (kuchen(a)uni-muenster.de)

1 0

CEFP 2011 summer school - CFP
by Horváth Zoltán 01 Mar '11

01 Mar '11

===================================== 4TH CENTRAL EUROPEAN FUNCTIONAL PROGRAMMING SCHOOL (CEFP 2011) EOTVOS LORAND UNIVERSITY, BUDAPEST, HUNGARY June 14-24, 2011 http://plc.inf.elte.hu/cefp THE REGISTRATION IS OPEN! ===================================== SCOPE OF THE SUMMER SCHOOL 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 SAC * 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 * Greg Michaelson (Heriot-Watt University Edinburgh, Scotland): Box Calculus * Rinus Plasmeijer (Radboud University Nijmegen, The Netherlands): Defining distributed GUI applications with iTasks * Kostis Sagonas (University of Athens, Greece): Multicore Erlang * Mary Sheeran (Chalmers University of Technology, Sweden): Feldspar: Implementation and Application AIMS OF THE SUMMER SCHOOL The main goal of the summer school is to bring together computer scientists, researchers, graduate and PhD students. The programme of the summer school includes: * In depth lectures about a selected number of recently emerged advanced functional programming techniques, taught by experts in the field. * Practical exercises accompanying the lectures to be solved by the students at the school. These exercises guide the students' learning to a great extent. A high quality lab is available at the school site. * Team work is stimulated, such that the students can also learn from each other. * Forum for PhD students. The CEFP school provides a forum for PhD students to present their research results as part of the workshop programme. Abstract submission is before the summer school, full paper version after the summer school. Selected and reviewed papers will be published in the LNCS Volume of the revised lectures. *** IMPORTANT: THE DEADLINE FOR THE ABSTRACTS IS APRIL 30, 2011 *** LOCATION The event is organized and hosted by the Department of Programming Languages and Compilers, Faculty of Informatics, Eötvös Loránd University, Budapest, Hungary. Budapest is the capital of Hungary with nearly 2.000.000 inhabitants. It is divided into two parts by the river Danube. There are nine bridges over the river which connect the two sides. The most beautiful ones are Chain Bridge (Lánchíd), Elisabeth Bridge (Erzsébet híd) and Liberty Bridge (Szabadság híd). One of the best places to walk around is the Castle District. There is a breath-taking view of the city from the Fisherman's Bastion. Across from the Fisherman's Bastion is Matthias Church named after the Hungarian King Matthias. In the Castle District you can find the Sándor Palace, the residence and workplace of the Head of the State. Budapest is richly endowed with natural springs of thermal waters possessing various medicinal properties (Gellért Baths and Hotel, Széchenyi Baths, Lukács Medicinal Baths etc.). The largest building in the country is the building of the Hungarian Parliament, which is situated on the bank of the Danube. The Neo-Gothic building complex was built between 1884 and 1904 according to the plans of Imre Steindl. There are many other sights in Budapest, just like Heroes' Square, St. Stephen's Basilica, Andrássy Avenue, Margaret-island, Gellért Hill and the Citadell etc. For more information about Budapest, please visit the http://www.budapestinfo.hu/ home page. INFORMATION The registration fee is EUR 410. The registration fee does not include the price of the accommodation! For more information please visit our website where you can find more details about the CEFP 2011 School and the programme. Our website is: http://plc.inf.elte.hu/cefp

1 0