- Haskell - Haskell.org

Call for Participation: HOR'12, Nagoya
by Makoto Hamana 09 May '12

09 May '12

===================================================================== Call for Participation 6th International Workshop on Higher-Order Rewriting HOR 2012 June 2, 2012, Nagoya, Japan Colocated with RTA'12 http://www.cs.gunma-u.ac.jp/events/hor/ ====================================================================== HOR is a forum to present work concerning all aspects of higher-order rewriting. The aim is to provide an informal and friendly setting to discuss recent work and work in progress concerning higher-order rewriting. Invited speaker --------------- * Zhenjiang Hu (National Institute of Informatics, Japan) Can Graph Transformation be Bidirectionalized? -- Bidirectional Semantics of Structural Recursion on Graphs -- Special Session: Current Status of Higher-Order Termination Tools ----------------------------------------------------------------- * Carsten Fuhs: Haskell termination tool * Rene Thiemann: Isabelle termination tool * Aoto,Yamada: Simply-typed TRS termination tool * Cynthia Kop: WANDA, termination tool for AFS Accepted papers --------------- * Beniamino Accattoli and Delia Kesner: The permutative lambda-calculus (The original paper was presented at LPAR'12, LNCS 7180, pp.381-395) * Thibaut Balabonski: A Unified Approach to Fully Lazy Sharing (The original paper was presented at POPL'12, pp.233-246) * Yuki Chiba and Takahito Aoto: Pattern Matching Algorithm for Higher Order Program Transformations * Jean-Pierre Jouannaud and Jian-Qi Li: Termination of higher-order rewriting in dependent type calculi * Vincent van Oostrom: Confluence via Critical Valleys * Kristoffer Rose: Higher Order Rewriting for Real Programmers

1 0

Creating a factorial function in GHC
by Angus Comber 09 May '12

09 May '12

I am trying to create a factorial function in GHC. I am following the online learnyouahaskell.com book (specifically types-and-typeclasses page). Bear in mind this is my day 1 of learning Haskell. The book suggests: factorial :: Integer -> Integer factorial n = product [1..n] But if I enter first line then press <Enter> I see: <interactive>:1:1 Not in scope: 'factorial' What am I doing wrong? Angus

2 1

FINAL CFP: TFPIE 2012
by Marco Morazan 07 May '12

07 May '12

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 *** NEW: SUBMISSIONS ARE NOW OPENED! *** The deadline to submit articles/abstracts to TFPIE is May 20 *** See the TFPIE 2012 website for instructions. 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(a)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(a)cs.ru.nl . -- Cheers, Marco

1 0

CFP: Workshop on Generic Programming 2012 (co-located with ICFP)
by Andres Löh 07 May '12

07 May '12

====================================================================== CALL FOR PAPERS WGP 2012 8th ACM SIGPLAN Workshop on Generic Programming Copenhagen, Denmark Sunday, September 9th, 2012 http://www.wgp-sigplan.org/2012 Co-located with the International Conference on Functional Programming (ICFP 2012) ====================================================================== Goals of the workshop --------------------- Generic programming is about making programs more adaptable by making them more general. Generic programs often embody non-traditional kinds of polymorphism; ordinary programs are obtained from them by suitably instantiating their parameters. In contrast with normal programs, the parameters of a generic program are often quite rich in structure; for example they may be other programs, types or type constructors, class hierarchies, or even programming paradigms. Generic programming techniques have always been of interest, both to practitioners and to theoreticians, and, for at least 20 years, generic programming techniques have been a specific focus of research in the functional and object-oriented programming communities. Generic programming has gradually spread to more and more mainstream languages, and today is widely used in industry. This workshop brings together leading researchers and practitioners in generic programming from around the world, and features papers capturing the state of the art in this important area. We welcome contributions on all aspects, theoretical as well as practical, of * generic programming, * programming with (C++) concepts, * meta-programming, * programming with type classes, * programming with modules, * programming with dependent types, * type systems for generic programming, * polytypic programming, * adaptive object-oriented programming, * component-based programming, * strategic programming, * aspect-oriented programming, * family polymorphism, * object-oriented generic programming, * implementation of generic programming languages, * static and dynamic analyses of generic programs, * and so on. Program Committee ----------------- Anya Helene Bagge, University of Bergen Jacques Carette, McMaster University Manuel Chakravarty, University of New South Wales Ronald Garcia (co-chair), University of British Columbia Jacques Garrigue, Nagoya University Andy Gill, University of Kansas Douglas Gregor, Apple Andrew Kennedy, Microsoft Research Cambridge Neelakantan Krishnaswami, Max Planck Institute for Software Systems Andres Löh (co-chair), Well-Typed LLP Zoltan Porkolab, Eötvös Loránd University Chung-chieh Shan, University of Tsukuba Proceedings and Copyright ------------------------- We plan to have formal proceedings, published by the ACM. Authors must transfer copyright to ACM upon acceptance (for government work, to the extent transferable), but retain various rights (http://www.acm.org/publications/policies/copyright_policy) Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. Submission details ------------------ Deadline for submission: Friday 2012-06-01 Notification of acceptance: Wednesday 2012-06-27 Final submission due: Tuesday 2012-07-10 Workshop: Sunday 2012-09-09 Papers should be submitted via EasyChair at https://www.easychair.org/conferences/?conf=wgp2012 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines (two-column, 9pt). The length is restricted to 12 pages. Travel Support -------------- Student attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC program, see its web page (http://www.sigplan.org/PAC.htm) History of the Workshop on Generic Programming ---------------------------------------------- Earlier Workshops on Generic Programming have been held in * Tokyo, Japan 2011 (affiliated with ICFP11), * Baltimore, Maryland, US 2010 (affiliated with ICFP10), * Edinburgh, UK 2009 (affiliated with ICFP09), * Victoria, BC, Canada 2008 (affiliated with ICFP), * Portland 2006 (affiliated with ICFP), * Ponte de Lima 2000 (affiliated with MPC), * Marstrand 1998 (affiliated with MPC). Furthermore, there were a few informal workshops * Utrecht 2005 (informal workshop), * Dagstuhl 2002 (IFIP WG2.1 Working Conference), * Nottingham 2001 (informal workshop). There were also (closely related) DGP workshops in Oxford (June 3-4 2004), and a Spring School on DGP in Nottingham (April 24-27 2006, which had a half-day workshop attached). WGP Steering Committee ---------------------- Patrik Jansson (chair) Sibylle Schupp Bruno Oliveira Marcin Zalewski Jaako Järvi Shin-Cheng Mu Jeremy Gibbons Magne Haveraaen Tim Sheard

1 0

Haskell Weekly News: Issue 225
by Daniel Santa Cruz 03 May '12

03 May '12

Welcome to issue 225 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of April 22 to 28, 2012. Announcements Matthias Fischmann made a call for participation to the Hong Kong Haskell hackathon, with tentative dates of May 11-13 or 25-27. Follow to link for more information. [1] http://goo.gl/9sRLF HacPhi, the hackathon in Philadelphia, Pennsylvania, USA, will be held between August 3-5, 2012. [2] http://goo.gl/Rm2qH Quotes of the Week * lambdabot was last seen on #haskell 1 hour, 37 minutes and 46 seconds ago, saying: <IO ()> * elliott: oh, it's not haskell-cafe? that explains the reasonable responses ["it" = GHC mailing list] * Morandat: "The astute reader will have noticed that the above example clashes with our claim that R is lexically scoped. As is often the case, R is lexically scoped up to the point it is not." * quicksilver: lisp doesn't have equational reasoning so there is nothing to lose :) * JoeyA: One thing I like about Haskell versus C++ is that abusing language features tends to give more satisfying results. monochrom: that seems to be a criterion for drugs rather than languages :) Top Reddit Stories * Darcs 2.8: faster, better annotate; patch stash (obliterate -O); revert hunk split; and more! Domain: wiki.darcs.net, Score: 63, Comments: 21 On Reddit: [3] http://goo.gl/4tj4i Original: [4] http://goo.gl/R7TpP * The Haskell / Snap ecosystem is as productive (or more) than Ruby/Rails. Domain: blog.dbpatterson.com, Score: 63, Comments: 46 On Reddit: [5] http://goo.gl/cP3NC Original: [6] http://goo.gl/23alh * Cabal is now hosted on GitHub Domain: github.com, Score: 44, Comments: 20 On Reddit: [7] http://goo.gl/yBqCC Original: [8] http://goo.gl/0ze9y * Eight Haskell Google Summer of Code projects accepted Domain: google-melange.com, Score: 40, Comments: 25 On Reddit: [9] http://goo.gl/c2KXg Original: [10] http://goo.gl/vu681 * “Live” code update for Haskell Domain: self.haskell, Score: 31, Comments: 17 On Reddit: [11] http://goo.gl/ZZDb6 Original: [12] http://goo.gl/ZZDb6 * Functional Programming in C++ Domain: altdevblogaday.com, Score: 30, Comments: 12 On Reddit: [13] http://goo.gl/pFuHk Original: [14] http://goo.gl/aG6iP * Why do we not define IO as a Free monad? Domain: self.haskell, Score: 28, Comments: 47 On Reddit: [15] http://goo.gl/jiSdb Original: [16] http://goo.gl/jiSdb * Elm: Source code and Compiler/Server now available. Write FRP code for the web! Domain: self.haskell, Score: 27, Comments: 11 On Reddit: [17] http://goo.gl/9hE6X Original: [18] http://goo.gl/9hE6X * An experiment with Bayesian Networks in Haskell Domain: alpheccar.org, Score: 27, Comments: On Reddit: [19] http://goo.gl/21VDw Original: [20] http://goo.gl/2piKL * More Client Side Yesod: todo sample Domain: yesodweb.com, Score: 25, Comments: 10 On Reddit: [21] http://goo.gl/LGO75 Original: [22] http://goo.gl/QGsrZ * C Style Haskell Domain: kormacode.blogspot.com, Score: 24, Comments: 21 On Reddit: [23] http://goo.gl/VsShj Original: [24] http://goo.gl/o75jn Top StackOverflow Questions * Avoiding IORefs in pure code votes: 19, answers: 1 Read on SO: [25] http://goo.gl/327fO * How can I get JHC to cooperate with the android ndk? votes: 11, answers: 1 Read on SO: [26] http://goo.gl/oGMQ9 * Is there a name for this function or pattern? votes: 11, answers: 2 Read on SO: [27] http://goo.gl/HJixe * Haskell rank two polymorphism compile error votes: 11, answers: 2 Read on SO: [28] http://goo.gl/hYdRX * Python faster than compiled Haskell? votes: 11, answers: 5 Read on SO: [29] http://goo.gl/sUXMa * How does one release a *nix project? votes: 10, answers: 2 Read on SO: [30] http://goo.gl/JTgCz * Optimizing partial computation in Haskell votes: 8, answers: 1 Read on SO: [31] http://goo.gl/Dncn7 * Proper way to treat global flags in Haskell votes: 8, answers: 2 Read on SO: [32] http://goo.gl/di2Ld * Generating code for another language in Haskell votes: 7, answers: 1 Read on SO: [33] http://goo.gl/OlRCI * Why does haskell enumerator based IO call sigprocmask so often? votes: 7, answers: 4 Read on SO: [34] http://goo.gl/kfTSy * confused about function as instance of Functor in haskell votes: 7, answers: 5 Read on SO: [35] http://goo.gl/aX9JA Until next time, Daniel Santa Cruz References 1. http://permalink.gmane.org/gmane.comp.lang.haskell.cafe/98038 2. http://www.haskell.org/haskellwiki/Hac_%CF%86 3. http://wiki.darcs.net/Releases/2.8 4. http://www.reddit.com/r/haskell/comments/snyvh/darcs_28_faster_better_annot… 5. http://blog.dbpatterson.com/post/21885034168 6. http://www.reddit.com/r/haskell/comments/suj5s/the_haskell_snap_ecosystem_i… 7. https://github.com/haskell/cabal 8. http://www.reddit.com/r/haskell/comments/smwft/cabal_is_now_hosted_on_githu… 9. http://www.google-melange.com/gsoc/org/google/gsoc2012/haskell 10. http://www.reddit.com/r/haskell/comments/sqr4r/eight_haskell_google_summer_… 11. http://www.reddit.com/r/haskell/comments/stcwz/live_code_update_for_haskell/ 12. http://www.reddit.com/r/haskell/comments/stcwz/live_code_update_for_haskell/ 13. http://www.altdevblogaday.com/2012/04/26/functional-programming-in-c/ 14. http://www.reddit.com/r/haskell/comments/suxv8/functional_programming_in_c/ 15. http://www.reddit.com/r/haskell/comments/swffy/why_do_we_not_define_io_as_a… 16. http://www.reddit.com/r/haskell/comments/swffy/why_do_we_not_define_io_as_a… 17. http://www.reddit.com/r/haskell/comments/subvk/elm_source_code_and_compiler… 18. http://www.reddit.com/r/haskell/comments/subvk/elm_source_code_and_compiler… 19. http://www.alpheccar.org/content/98.html 20. http://www.reddit.com/r/haskell/comments/swfud/an_experiment_with_bayesian_… 21. http://www.yesodweb.com/blog/2012/04/yesod-js-todo 22. http://www.reddit.com/r/haskell/comments/snzsa/more_client_side_yesod_todo_… 23. http://kormacode.blogspot.com/2011/11/c-style-haskell_10.html 24. http://www.reddit.com/r/haskell/comments/sxoof/c_style_haskell/ 25. http://stackoverflow.com/questions/10298664/avoiding-iorefs-in-pure-code 26. http://stackoverflow.com/questions/10305909/how-can-i-get-jhc-to-cooperate-… 27. http://stackoverflow.com/questions/10319659/is-there-a-name-for-this-functi… 28. http://stackoverflow.com/questions/10345809/haskell-rank-two-polymorphism-c… 29. http://stackoverflow.com/questions/10357663/python-faster-than-compiled-has… 30. http://stackoverflow.com/questions/10279508/how-does-one-release-a-nix-proj… 31. http://stackoverflow.com/questions/10266954/optimizing-partial-computation-… 32. http://stackoverflow.com/questions/10285454/proper-way-to-treat-global-flag… 33. http://stackoverflow.com/questions/10268052/generating-code-for-another-lan… 34. http://stackoverflow.com/questions/10273696/why-does-haskell-enumerator-bas… 35. http://stackoverflow.com/questions/10294272/confused-about-function-as-inst…

1 0

ANN: HacPhi 2012
by Chris Casinghino 02 May '12

02 May '12

Greetings, I am very pleased to officially announce Hac Phi 2012, a Haskell hackathon/get-together to be held August 3-5 at the University of Pennsylvania in Philadelphia. The hackathon will officially kick off at 2:30 Friday afternoon, and go until 5pm on Sunday (with breaks for sleep, of course). Last year's Hac Phi was a lot of fun, drawing more than 30 Haskellers, and many people have already expressed interest in coming back this year. Come meet your Haskelly comrades-in-arms! I want to stress that everyone is welcome - you do not have to be a Haskell guru. Helping hack on someone else's project could be a great way to increase your Haskell-fu. If you plan on coming, please officially register [1]. Registration, travel, lodging and many other details can be found on the Hac Phi wiki [2]. This year, we are making a public list of attendees' names and nicks - please let us know if you'd prefer not to be listed when you register. We're also looking for a few people interested in giving short (15-20 min.) talks, probably on Saturday afternoon. Anything of interest to the Haskell community is fair game - a project you've been working on, a paper, a quick tutorial. If you'd like to give a talk, add it on the wiki [3]. Hac Phi 2012 is supported by contributions from Amgen and Jane Street. Hope to see you in Philadelphia! - The Hac Phi 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 [3] http://www.haskell.org/haskellwiki/Hac_%CF%86/Talks

1 0

ANNOUNCE: planar-graph-1.0
by Ivan Lazar Miljenovic 28 Apr '12

28 Apr '12

I uploaded this [1] yesterday, posted the blog article [2] about it... but forgot to send a message to the lists! [1]: http://hackage.haskell.org/package/planar-graph [2]: http://ivanmiljenovic.wordpress.com/2012/04/27/announcing-planar-graph/ planar-graph is an implementation of, strangely enough, planar graphs (that is, a graph that contains an embedding on a surface, can be drawn with no edge crossings and has a specific ordering of edges). It handles graphs on planes and spheres, but I'm not sure about other surfaces (and there seems to be little demand for such). This probably won't be of many use to people, but as I described in the blog post, I've been using this as a test bed for graph library design (specifically usage of abstract node/edge identifiers, using half-edges and the serialisation/encoding setup). -- Ivan Lazar Miljenovic Ivan.Miljenovic(a)gmail.com http://IvanMiljenovic.wordpress.com

3 3

Re: [Haskell] ANN: Portackage - a hackage portal
by Andrew Seniuk 27 Apr '12

27 Apr '12

Hi Derek, Thanks for your comments. Yes, I am probably going to focus on making it work as a web service and stay away from platform-specific mobile apps. Not been thinking mobile much at all, since the quantities of data are taxing even to my laptop, and also I'm inclined to believe people are mostly at a laptop or desktop when coding Haskell. However, I'm planning to try server-side sorting and filtering, and compare performance. No DB is used on the server yet, but it would be simple enough I suppose -- all this is quite new territory for me. Also my shared hosting resource limits may become a problem if this gets a lot of use. On the other hand, was planning to use persistence (cookies i guess?) to save the data on the client, so that patches based on Hackage RSS could be applied incrementally. Also, I think the sorting could be faster by sending per-column lists of indices. But maybe it is just the browser rendering which is taking all the time? I'll take this opportunity to announce a few improvements: - shift-click a row to see the Hackage page (bare click does nothing) - per-column filtering widgets Presently working on getting the "last updated" column, this information is not in a .cabal file but I'm hoping it is in the TAR metadata... The link again: http://www.fremissant.net/portackage A.

1 0

ANN: Portackage - a hackage portal
by Andrew Seniuk 27 Apr '12

27 Apr '12

Hello, This is to announce a provisional webpage to summarise hackage.haskell.org. http://www.fremissant.net/portackage It is a lot of data, so will be a bit slow to load. Columns can be sorted by clicking the headers, but this will also take some seconds on a typical client. The initial sort is by module name. Clicking a table row links to the project page on hackage. Although I believe this is a complete list of all packages/modules in hackage, it is probably still buggy, so if you see anything amiss please let me know. Also, a subsequent version in the near future will update automatically based on the http://hackage.haskell.org/packages/archive/recent.rss RSS feed, but for now it's based on a recent snapshot. Haskell code which prepares the page will be released after a few more days testing and refinement. Some previous work [1] provided a list of all modules, but is not being maintained, and I was unable to rearouse the author's interest. Feature requests and suggestions are welcome! Kind Reg'ds, Andrew Seniuk [1] http://folk.ntnu.no/hammar/explore-hackage/

3 4

CHR 2012: Call for Papers
by Jon Sneyers 27 Apr '12

27 Apr '12

========================================================================= Call for Papers Ninth International Workshop on Constraint Handling Rules CHR 2012 http://dtai.cs.kuleuven.be/CHR/CHR2012/ Budapest (Hungary), September 4th, 2012 (co-located with ICLP 2012) ========================================================================= Introduction The CHR 2012 Workshop will be held on September 4th, 2012 in Budapest, Hungary, at the occasion of the 28th International Conference on Logic Programming (ICLP 2010), the premier international venue for presenting research in logic programming. More information on the venue and the co-located conference and workshops can be found on the ICLP website (http://www.cs.bme.hu/iclp2012/) The Constraint Handling Rules (CHR) language has become a major declara- tive specification formalism and implementation language for constraint reasoning algorithms and applications. Algorithms specified using infe- rence rules, rewrite rules, sequents, proof rules, or logical axioms can often be directly written in CHR. Its clean semantics facilitates pro- gram design, analysis, and transformation. For more information, please visit the CHR website (http://dtai.cs.kuleuven.be/CHR/) The aim of the CHR workshop series is to stimulate and promote interna- tional research and collaboration on topics related to the CHR language. The workshop is a lively, friendly forum for presenting and discussing new results, interesting applications, and work in progress. Previous Workshops on Constraint Handling Rules 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 (Portugal) at ICLP, in 2008 in Hagen- berg (Austria) at RTA, in 2009 in Pasadena (California, US) at ICLP, in 2010 in Edinburgh (Scotland, UK) at ICLP, and in 2011 in Cairo (Egypt), at the 2nd CHR summer school. 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 - Expressiveness 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 submission deadline: July 2nd, 2012 - Notification of acceptance: August 1st, 2012 - Final version due: August 17, 2012 (tentative) - Workshop date: September 4th, 2012 Submission Information The four broad categories for submissions are: 1. technical papers for describing technically sound, innovative ideas that can advance the state of the art of CHR 2. application papers, where the emphasis will be on the use of CHR in the application, on the impact on the application domain, and the lessons learned from this application 3. system and tool papers, emphasising the novelty, practicality, usability and general availability of the systems and tools described 4. short papers, for ongoing work not yet ready for full publication and research project overviews. All papers must describe original, previously unpublished research, and must not simultaneously be submitted for publication elsewhere. They must be written in English. Technical papers must not exceed 15 pages. The limit for short papers is 8 pages, as is the standard page limit for application papers, and system and tool papers. However, particularly strong contributions in the latter two areas may be submitted as technical paper as well. All papers must be in the Springer LNCS format. General information about the Springer LNCS series and the LNCS authors' instructions are available at the Springer LNCS home page (http://www.springer.com/computer/lncs?SGWID=0-164-7-72376-0) Submissions must be made via the EasyChair submission system, available at http://www.easychair.org/conferences/?conf=chr2012 Programme Committee - Henning Christiansen, Roskilde University, Denmark - Veronica Dahl, Simon Fraser University, Canada - François Fages, INRIA Paris-Rocquencourt, France - Thom Frühwirth, Ulm University, Germany (co-chair) - Maurizio Gabbrielli, Universita' di Bologna, Italy - Rémy Haemmerlé, Universidad Politecnica de Madrid, Spain - Thierry Martinez, INRIA Paris-Rocquencourt, France - Eric Monfroy, Université de Nantes, France - Tom Schrijvers, University of Ghent, Belgium - Jon Sneyers, KU Leuven, Belgium (co-chair) - Armin Wolf, Fraunhofer FIRST, Germany Workshop Coordinators Contact: chr2012(a)easychair.org Jon Sneyers Department of Computer Science, KU Leuven Leuven, Belgium http://people.cs.kuleuven.be/~jon.sneyers/ Thom Frühwirth Programmiermethodik und Compilerbau, Ulm University Ulm, Germany http://www.informatik.uni-ulm.de/pm/mitarbeiter/fruehwirth/

1 0