June 2011 - Haskell - Haskell.org

ANNOUNCE: Release of 'randproc' package v0.1
by David Banas 23 Jun '11

23 Jun '11

Announcing the release of v0.1 of 'randproc', a library for working with random processes. http://www.haskell.org/haskellwiki/Random_Processes

1 0

ANNOUNCE: hspec-0.4.3 (color output and alternate mondaic api)
by Trystan Spangler 22 Jun '11

22 Jun '11

hspec version 0.4.3, Behavior Driven Development for Haskell, is now available! Improvements include red/yellow/green color output and writing output as the tests are running. Also, you can import Test.Hspec.Monadic rather than Test.Hspec if you want to use a WriterMonad based api. http://hackage.haskell.org/package/hspec https://github.com/trystan/hspec As always, any advice, comments, or questions are welcome, Trystan Spangler For those who would like to see an example, using the new alternate monadic api, running this program: > import Test.Hspec.Monadic > import Test.Hspec.HUnit > import Test.Hspec.QuickCheck (property) > import Test.HUnit (assertBool, assertEqual) > > main = hspec specs > > specs = describe "hspec 0.4.3" $ do > 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) > > it "still shows a list of failed examples" > (undefined :: Bool) -- expected to fail > > it "still collects better data from failed HUnit examples" > (assertEqual "this should fail" 1 2) -- expected to fail > > it "still collects better data from failed QuickCheck examples" > (property $ \ i -> (i::Int) * 2 - 2 /= i) -- expected to fail > > it "now allows a monadic api" > (pending "I'm still not sure how to test this but this example is good evidence....") > > it "now outputs in color when writing to stdout" > (pending "I'm still not sure how to test this but trust me it works....") should send this to stdout in glorious red, yellow, and green: hspec 0.4.3 - still allows a Bool expression to act as an example - still allows HUnit assertions to act as examples - still allows QuickCheck properties to act as examples x still shows a list of failed examples FAILED [1] x still collects better data from failed HUnit examples FAILED [2] x still collects better data from failed QuickCheck examples FAILED [3] - now allows a monadic api # I'm still not sure how to test this but this example is good evidence.... - now outputs in color when writing to stdout # I'm still not sure how to test this but trust me it works.... 1) hspec 0.4.3 still shows a list of failed examples FAILED Prelude.undefined 2) hspec 0.4.3 still collects better data from failed HUnit examples FAILED this should fail expected: 1 but got: 2 3) hspec 0.4.3 still collects better data from failed QuickCheck examples FAILED *** Failed! Falsifiable (after 6 tests): 2 Finished in 0.0520 seconds 8 examples, 3 failures

1 2

VSTTE 2012 : Second Call for Papers
by Gudmund Grov 22 Jun '11

22 Jun '11

VSTTE 2012 Verified Software: Theories, Tools and Experiments January 28-29, 2012 Philadelphia, USA (co-located with POPL and VMCAI) https://sites.google.com/site/vstte2012/ The Fourth International Conference on Verified Software: Theories, Tools, and Experiments will take place on January 28-29, 2012. The focus of the conference is the development of systematic methods for specifying, building, and verifying software. The goal of this conference is to advance the state of the art through the interaction of theory development, tool evolution, and experimental validation. Historically, the conference came out of the Verified Software Initiative (VSI), a cooperative, international initiative directed at the scientific challenges of large-scale software verification. An informal verification competition will be held in parallel to the conference. More information will be available from the website. Topics of interest include: * Specification and verification techniques * Tool support for specification languages * Tool for various design methodologies * Tool integration and plug-ins * Automation in formal verification * Tool comparisons and benchmark repositories * Combination of tools and techniques (e.g. formal vs. semiformal, software specification vs. engineering techniques) * Customizing tools for particular applications * Challenge problems * Refinement methodologies * Requirements modeling * Specification languages * Specification/verification case-studies * Software design methods * Program logic SUBMISSIONS Submitted research papers and system descriptions must be original and not submitted for publication elsewhere. Research paper submissions are limited to 15 proceedings pages in LNCS format and must include a cogent and self-contained description of the ideas, methods and results, together with a comparison to existing work. System descriptions are also limited to 15 proceedings pages in LNCS format. Authors are encouraged to submit work in progress, particularly if the work involves collaboration, theory unification, and tool integration. Papers can be submitted at https://www.easychair.org/conferences/?conf=vstte2012 Submissions that arrive late, are not in the proper format, or are too long will not be considered. The proceedings of VSTTE 2012 will be published by Springer-Verlag in the LNCS series. Authors of accepted papers will be requested to sign a form transferring copyright of their contribution to Springer-Verlag. IMPORTANT DATES August 31, 2011: Conference Paper Submission Deadline October 20, 2011: Notification of acceptance November 15, 2011: Final conference paper versions due January 28-29, 2012: Main conference CONFERENCE CHAIR Ernie Cohen, European Microsoft Innovation Center PROGRAM CHAIRS Rajeev Joshi, NASA Jet Propulsion Laboratory Peter Müller, ETH Zurich Andreas Podelski, University of Freiburg PROGRAM COMMITTEE Clark Barrett, New York University Lars Birkedal, IT University of Copenhagen Patrick Cousot, Ecole normale Supérieure, Paris and New York University Leonardo De Moura, Microsoft Research Jean-Christophe Filliatre, CNRS Université Paris Sud John Hatcliff, Kansas State University Bart Jacobs, Katholieke Universiteit Leuven Ranjit Jhala, University of California, San Diego Rajeev Joshi, NASA JPL Gerwin Klein, NICTA Viktor Kuncak, EPF Lausanne Gary T. Leavens, University of Central Florida Rustan Leino, Microsoft Research Panagiotis Manolios, Northeastern University Peter Müller, ETH Zurich Tobias Nipkow, Technische Universität München Matthew Parkinson, Microsoft Research Corina Pasareanu, NASA Ames Wolfgang Paul, Saarland University Andreas Podelski, University of Freiburg Natasha Sharygina, University of Lugano Willem Visser, University of Stellenbosch Thomas Wies, IST Austria PUBLICITY CHAIR Gudmund Grov, University of Edinburgh VERIFICATION COMPETITION ORGANISER Jean-Christophe Filliatre, CNRS Université Paris Sud STEERING COMMITTEE Tony Hoare, Microsoft Research Andrew Ireland, Heriot-Watt University Jay Misra, UT Austin Natarajan Shankar, SRI International Jim Woodcock, University of York -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336.

1 0

Re: [Haskell] PhD studentship in Functional Programming
by Graham Hutton 22 Jun '11

22 Jun '11

Dear all, Just a quick reminder that the deadline for receiving applications for this PhD studentship position is this Friday (24th June.) Best wishes, Graham > +------------------------------------------------------------------+ > > PhD Studentship in Functional Programming > > School of Computer Science > University of Nottingham, UK > > Applications are invited for a fully-funded PhD studentship in > the Functional Programming Lab in the School of Computer Science > at the University of Nottingham, starting on 1st October 2011, > under the supervision of Prof Graham Hutton. > > The suggested topic for the studentship is to develop a practical > implementation of the worker/wrapper transformation, a simple but > powerful unifying paradigm for program optimisation, but other > ideas for possible topics are welcome too. The studentship is > for three and a half years, and includes a maintenance grant > of 13,590 UK pounds per year, and tuition fees. > > Applicants for the position will require a first-class Honours > degree (or equivalent) in Computer Science and/or Mathematics, > some experience in functional programming, and an aptitude for > mathematical subjects. Additional desirable attributes include > a Masters degree, and/or some experience in programming language > semantics, implementation and optimisation. Due to the nature > of the funding, the position is only open to UK citizens, or EU > citizens who have resided in the UK for the last three years. > > The successful applicant will work under the supervision of Prof > Graham Hutton in the FP Lab in Nottingham, a leading centre for > research on functional programming. The group currently comprises > 5 academic staff, 1 research fellow, and 10 PhD students. > > In order to apply, please submit the following to Prof Graham > Hutton (graham.hutton(a)nottingham.ac.uk) by 24th June 2011: an > up-to-date copy of your CV (including the results of all your > University examinations to date) along with a brief covering > letter that describes your experience in functional programming, > your reasons for wishing to pursue a PhD in this area, and any > ideas you have regarding possible research directions. > > Closing date for applications: 24th June 2011. > > +------------------------------------------------------------------+ > > -- > 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.

1 0

AusHac2011 - The Australasian Haskell Hackathon - July 8-10
by Alex Mason 20 Jun '11

20 Jun '11

It's almost that time of year again! Next month is the second annual AusHac event, at UNSW in Sydney, and you are invited! But if you want to come, we need to hear from you soon, as we need to organise access to the university network for you. If you're an Australian Haskell hacker, enthusiast, newbie or professional, we would love to see you there. Below is the announcement, if you have any questions, please just hit reply, and Ivan or I will get back to you. We would absolutely love to see you there if you can make it, we'd love for this year to be even more awesome than last year. -- Alex Mason ------------------------------------------------------------------------------ ==== Attention all Australasian Haskellers! ==== After last year’s fantastic turnout for the first Australian Haskell Hackathon - AusHac 2010 - we’ve decided to organise another. As it’s rather boring to have a Hackathon with only two people, we encourage and welcome anyone interested in Haskell in Australia, New Zealand and surrounding areas (or further afield if you want!) to come and join us. Last year we had more than 25 Haskellers come from Brisbane, Canberra, Melbourne, Sydney and even two from as far away as New Zealand. AusHac 2011 will be held from Friday July 8th until Sunday July 10th, again at UNSW’s Computer Science building in Sydney. There’s no need to come for the entire weekend, just for whenever you’re able to. Last year, people worked on several projects including: • Accelerate: a high performance library for array computations using various backends (CUDA, LLVM, etc.) being written at UNSW. • Leksah: the Haskell IDE written in Haskell • DDC: the compiler for the Haskell-like language Disciple, which has strict evaluation by default, region, effect and closure typing and other interesting language features. • Hubris: the Haskell/Ruby bridge for calling Haskell from Ruby and vice-versa. • haskell-mpi: bindings to MPI, the message passing interface used frequently on high performance super-computers to allow programs to run on many nodes in parallel with easy communication. • There was even some work on LLVM to produce HTML output showing register allocations (as an aid to those writing new code generators etc.), which has now been included upstream. This work did not use Haskell, but it did happen at AusHac 2010. • And much more! This is a great chance to collaborate with others and get feedback on your work, while having heaps of fun and meeting other Haskellers, to verify they do actually exist! And don’t worry if you can’t think of a project to work on; just come along and pitch in with whatever strikes your fancy! If you’re interested in coming and have a project you’d like to work on, check out the wikipage http://www.haskell.org/haskellwiki/AusHac2011 where you can add your project ideas, or just take a look and see what others will be working on that you can help out with. People of all skill levels are welcome, from complete beginners to Oleg-level sage masters. We’re more than happy to help you learn Haskell if you’re just starting out or help you solve that little niggly bit in your code. If you’re interested in coming along, fill out our registration form http://axman6.wufoo.com/forms/aushac-2011-sign-up/. Registration is required so we know numbers and for you to get access to the university Wifi. Even if you’re not sure, fill it in to express your interest, obligation free. We’d rather know we have room for too many people than not enough. So come along! And if for some reason you don’t enjoy yourself, registration comes with a money-back guarantee! Hope to see you there, -- Alex Mason and Ivan Miljenovic, AusHac organisers ------------------------------------------------------------------------------

1 0

ANNOUNCE: Groundhog, a database connectivity library
by Boris Lykah 17 Jun '11

17 Jun '11

Hi, everyone! I am happy to announce a new persistence library, Groundhog. http://hackage.haskell.org/package/groundhog http://hackage.haskell.org/package/groundhog-sqlite Groundhog does mapping between datatypes and database like Persistent in Haskell or Hibernate in Java and makes dealing with database very easy. The API is inspired by Persistent, a great framework by Michael Snoyman, from which I used some ideas and code. At first I wanted to enhance Persistent, but many useful ideas don't fit into its design. Groundhog offers features I wanted to see in a modern Haskell database library. My intent was to create a package which you can plug into your existing project and it would just work. So it does not require defining datatypes using its own mechanisms (quasiquotation, XML, etc). You can use your own types defined anywhere. The restrictions on type structure are very mild. Groundhog uses data families and GADTs and they did not play nicely together until GHC 7, so GHC 6.12.x and earlier is not supported. Currently there is support only for Sqlite but I hope to add more backends soon. Sqlite backend is based on direct-sqlite package by Dan Knapp. I modified it to improve performance and provide better error messages. Now it is bundled with groundhog-sqlite but I hope to merge it with direct-sqlite. On simple datatypes performance is ~2.5 times higher compared to Persistent. Some of this gain is achieved because of Sqlite specific optimisations, but I expect to see high performance on other backends as well. In fact, it could be even faster. I sacrificed ~30% of backend-independent performance for flexibility when I chose DbPersist to be a monad transformer instead of sticking with IO and replaced direct mentions of DbPersist with Monad m in PersistBackend. Features: * Persists datatypes defined in an ordinary way * Supports fields of user-defined types * Supports polymorphic datatypes and datatypes with several constructors * Basic support for lists and tuples * Type safety * Migration from an empty schema * Powerful expression DSL for use in queries * Execution of arbitrary queries * High performance Plans (in priority order): * Add more backends, particularly PostgreSQL * Allow migration when data definition changes * Add Persistent-like quasiquotation syntax Here is an example from the documentation: {-# LANGUAGE GADTs, TypeFamilies, TemplateHaskell #-} import Control.Monad.IO.Class(liftIO) import Database.Groundhog.TH import Database.Groundhog.Sqlite data Customer a = Customer {customerName :: String, details :: a} deriving Show data Item = ProductItem {productName :: String, quantity :: Int, customer :: Customer String} | ServiceItem {serviceName :: String, deliveryAddress :: String, servicePrice :: Int} deriving Show deriveEntity ''Customer $ Just $ do setConstructor 'Customer $ do setConstraints [("NameConstraint", ["customerName"])] deriveEntity ''Item Nothing main = withSqliteConn ":memory:" $ runSqliteConn $ do -- Customer is also migrated because Item contains it runMigration silentMigrationLogger $ migrate (undefined :: Item) let john = Customer "John Doe" "Phone: 01234567" johnKey <- insert john -- John is inserted only once because of the name constraint insert $ ProductItem "Apples" 5 john insert $ ProductItem "Melon" 2 john insert $ ServiceItem "Taxi" "Elm Street" 50 insert $ ProductItem "Melon" 6 (Customer "Jack Smith" "Don't let him pay by check") -- bonus melon for all large melon orders update [QuantityField =. toArith QuantityField + 1] (ProductNameField ==. "Melon" &&. QuantityField >. (5 :: Int)) productsForJohn <- select (CustomerField ==. johnKey) [] 0 0 liftIO $ putStrLn $ "Products for John: " ++ show productsForJohn -- check bonus melon <- select (ProductNameField ==. "Melon") [Desc QuantityField] 0 0 liftIO $ putStrLn $ "Melon orders: " ++ show melon Currently Hackage cannot build it due to technical issues (as Dons assumed several packages it depends on are not exposed), but you can install it with cabal. It is still very early beta and it may have some bugs. I am very interested to hear your feedback. Thanks, Boris Lykah

1 0

Haskell Weekly News: Issue 186
by Daniel Santa Cruz 16 Jun '11

16 Jun '11

Glad you are reading this issue! This is issue 186, not 180... Seems that the last couple of issues got stuck on 180. Hopefully you will find pointers to interesting things happening in the Haskell community. This issue covers the week of June 05 to 11, 2011. Announcements Hakim Cassimally shared with us slides and screencast from Geekup's first ever "Functional Programming Night." http://goo.gl/1oCO8 Johannes Waldmann sent an invite to a Local Haskell Meeting (Stammtisch) in Leipzig, Germany on June 27. http://goo.gl/UM9ci We are very proud of the two Simons, Simon Peyton Jones and Simon Marlow. Isaac Potoczny-Jones relayed the announcement from ACM SIGPLAN of the SIGPLAN Programming Language Software Award. Many congrats! http://goo.gl/sAuVv Quotes of the Week * augustss: So JHC has bad code. GHC had a lot of that a long time ago, and they have slowly been converting to the pure way. It's the only sensible way. * <geheimdienst> monochrom: i thought it maybe would end executing the current do block ... <monochrom> use "when". <mm_freak_> use "goto" <hpc> use Java * cmccann: programming is a lot easier if you avoid working with dates/times, text, or numbers. I say stick to category theory, it's simpler * xplat: the underlying graph of a category is transitive. transitive graphs have no bridges. this is why trolls always have problems with category theory. Top Reddit Stories * SIGPLAN Programming Languages Software Award, to Simon Peyton Jones and Simon Marlow for GHC Domain: permalink.gmane.org, Score: 115, Comments: 12 On Reddit: http://goo.gl/d1yww Original: http://goo.gl/ym5q9 * Haskell gets a new super-fast hash table library Domain: gregorycollins.net, Score: 80, Comments: 20 On Reddit: http://goo.gl/gNcRa Original: http://goo.gl/O6oc6 * Pinpointing space leaks in big programs : Inside T5 Domain: blog.ezyang.com, Score: 47, Comments: 4 On Reddit: http://goo.gl/T3ZVs Original: http://goo.gl/4rL1y * iPad app that is a lisp interpreter written in haskell by David Pollak, creator of the Scala web framework Lift. Domain: github.com, Score: 37, Comments: 16 On Reddit: http://goo.gl/eXf03 Original: http://goo.gl/c859K * Memory footprints of some common data types Domain: blog.johantibell.com, Score: 36, Comments: 23 On Reddit: http://goo.gl/bjvFC Original: http://goo.gl/QVrIN * Gilad Bracha: Types are Anti-Modular Domain: gbracha.blogspot.com, Score: 22, Comments: 22 On Reddit: http://goo.gl/rnbeF Original: http://goo.gl/44kCd * Biggest / most popular / most trafficked web app written in Haskell? Janrain, TypLAB, or ... ? Domain: reddit.com, Score: 19, Comments: 15 On Reddit: http://goo.gl/eMn8Y Original: http://goo.gl/hUzFc * Three Haskell web frameworks Domain: blogs.linux.ie, Score: 17, Comments: 3 On Reddit: http://goo.gl/5HGd6 Original: http://goo.gl/oR6Zu * Parallel GHC project: new opportunity for an organisation to participate Domain: well-typed.com, Score: 17, Comments: 0 On Reddit: http://goo.gl/rppqC Original: http://goo.gl/CB4ZG * Building Ajax Sites With Snap - Imagining Heist-Async Domain: blog.dbpatterson.com, Score: 17, Comments: 0 On Reddit: http://goo.gl/o8jTF Original: http://goo.gl/j1y2o Top StackOverflow Questions * why write type declarations in Haskell? votes: 11, answers: 4 Read on SO: http://goo.gl/SqM4y * Creating functions over Enumerations votes: 11, answers: 5 Read on SO: http://goo.gl/0lguE * Understanding a recursively defined list (fibs in terms of zipWith) votes: 10, answers: 3 Read on SO: http://goo.gl/kbVtC * Speeding up SHA256 in Haskell votes: 10, answers: 1 Read on SO: http://goo.gl/whGhV * Poor performance with transpose and cumulative sum in Repa votes: 10, answers: 1 Read on SO: http://goo.gl/abxuD * Would you mind to explain the code in the forum ? votes: 9, answers: 1 Read on SO: http://goo.gl/ftoI3 About the Haskell Weekly News To help create new editions of this newsletter, please send stories to dstcruz(a)gmail.com. Until next time, Daniel Santa Cruz

1 0

Reminder: HacPhi 2011 registration closing in two weeks
by wagnerdm＠seas.upenn.edu 15 Jun '11

15 Jun '11

Hello all, HacPhi 2011 is drawing near! To help us finalize the arrangements, we plan on closing the registration period on Wednesday, June 29, 2011 at 1430 local time (local to you!) ...one month before the beginning of the festivities. If you plan on coming, please drop us a line so that we know how many people to provide food and wireless for (and we all know which of those two is the more important ;-). Full instructions for registering are available on the wiki page [1], as well as information about making hotel and travel arrangements. The HacPhi wiki [2] has full details, but the skinny is this: we kick off at 1430 on Friday, July 29, and will hack together for three days (until July 31), with breaks for food and sleep. We will have a time for short talks as well -- let us know if you're interested in telling us a bit about your latest exploits. Whether you're a raw recruit or a grizzled code veteran, come join your Haskell-y comrades-in-arms for a weekend of hacking and fun! - The HacPhi team Brent Yorgey (byorgey) Daniel Wagner (dmwit) Chris Casinghino (ccasin) [1] http://www.haskell.org/haskellwiki/Hac_%CF%86/Register [2] http://www.haskell.org/haskellwiki/Hac_%CF%86

1 0

Deadline extension: CHR 2011
by Jon Sneyers 15 Jun '11

15 Jun '11

Apologies if you receive multiple copies ________________________________________ The paper abstract registration and submission deadlines have been extended from June 14th/21st to June 20th/27th! Call for Papers ------------------------------------------------------------ Eighth International Workshop on Constraint Handling Rules CHR 2011 September 9, 2011 Cairo, Egypt Co-located with the Second CHR Summer School ------------------------------------------------------------ http://met.guc.edu.eg/events/chr2011/ws.html Introduction ------------ The Constraint Handling Rules (CHR) language has become a major declarative specification formalism and implementation language for constraint reasoning algorithms and applications. Algorithms are often specified using inference rules, rewrite rules, sequents, proof rules or logical axioms that can be directly written in CHR. Its clean semantics facilitates program design, analysis and transformation. See the CHR website (http://dtai.cs.kuleuven.be/CHR/) for more information. The aim of the CHR workshop series is to stimulate and promote international research and collaboration on topics related to the Constraint Handling Rules language. The workshop is a lively, friendly forum for presenting and discussing new results, interesting applications, and work in progress. Previous CHR workshops were organized in 2004 in Ulm (Germany), in 2005 in Sitges (Spain) at ICLP, in 2006 in Venice (Italy) at ICALP, in 2007 in Porto (Portgual) at ICLP, in 2008 in Hagenberg (Austria) at RTA, in 2009 in Pasadena (California, US) at ICLP and in 2010 in Edinburgh (Scotland) at ICLP. The workshop proceedings will be published as a technical report. Topics of Interest ------------------ The workshop calls for full papers and short papers describing ongoing work on any aspect of CHR and related approaches. The following topics are relevant (this list is non-exhaustive): - (Logical) Algorithms - Applications - Comparisons with Related Approaches - Constraint Solvers - Critical Assessment - Expressivity and Complexity - Implementations and Optimization - Language Extensions (Types, Modules, ...) - Program Analysis - Program Transformation and Generation - Programming Environments (Debugging) - Programming Pearls - Programming Tools - Retractable Constraints - Semantics - System Descriptions Important Dates --------------- * Paper Registration (Abstract): June 20, 2011 (NEW) * Paper Submission: June 27, 2011 (NEW) * Notification of Authors: July 21, 2011 * Final version due: August 16, 2011 * Workshop date: September 9, 2011 Submission Information ---------------------- All papers must describe original, previously unpublished research, and must not simultaneously be submitted for publication elsewhere. They must be written in English. There are four submission categories: 1. technical papers for describing technically sound, innovative ideas that can advance the state of the art of logic programming; 2. application papers, where the emphasis will be on their impact on the application domain; 3. system and tool papers, where the emphasis will be on the novelty, practicality, usability and general availability of the systems and tools described; 4. technical communications, aimed at describing recent developments, new projects, and other materials that are not ready for main publication as standard papers. Technical papers, application papers, and system and tool papers must not exceed 15 pages including bibliography. The limit for technical communications is 10 pages. The authors are encouraged to submit their papers in Springer LNCS format. General information about the Springer LNCS series and the LNCS authors' instructions are available at the Springer LNCS/LNAI home page (http://www.springeronline.com/lncs/) Submissions can be made via the Easychair submission system, available at http://www.easychair.org/conferences/?conf=chr2011. Accepted papers will be published in a technical report. Organization ------------ Program Committee: * Slim Abdennadher, German University in Cairo, Egypt * Henning Christiansen, Roskilde University, Denmark * Francois Fages, INRIA Rocquencourt, France * Thom Fruehwirth, Universitaet Ulm, Germany * Maurizio Gabbrielli, Universita di Bologna, Italy * Remy Haemmerle, Universidad Politecnica de Madrid, Spain * Eric Monfroy, Universite de Nantes, France * Paolo Pilozzi, K.U.Leuven, Belgium * Jon Sneyers, K.U.Leuven, Belgium (chair) * Peter J. Stuckey, NICTA Victoria Laboratory, Australia * Armin Wolf, Fraunhofer FIRST, Germany Workshop Coordinator: * Jon Sneyers, K.U.Leuven (Belgium) Disclaimer: http://www.kuleuven.be/cwis/email_disclaimer.htm

1 0

ANNOUNCE: GHC version 7.0.4
by Ian Lynagh 15 Jun '11

15 Jun '11

============================================================= The (Interactive) Glasgow Haskell Compiler -- version 7.0.4 ============================================================= The GHC Team is pleased to announce a new patchlevel release of GHC. This release contains a handful of bugfixes relative to 7.0.3, so we recommend upgrading. The release notes are here: http://www.haskell.org/ghc/docs/7.0.4/html/users_guide/release-7-0-4.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

1 0