- Haskell - Haskell.org

Possible Hackathon at MSR Cambridge this summer
by Simon Marlow 07 May '11

07 May '11

Hi Folks, We're looking into the possibility of holding a Haskell Hackathon at Microsoft Research, Cambridge, UK, this summer. The available dates are 22-24 July 12-14 August both Friday-Sunday. If you're interested in coming, use the following link to let us know which date you prefer: http://doodle.com/6iz8stzuinvduv27 please vote today or tomorrow (Tuesday), I'll close the poll on Wednesday. If you don't have a preference, there's no need to vote. Cheers, Simon

4 4

CFP: APLAS 2011, Kenting, Taiwan
by Shin-Cheng Mu 06 May '11

06 May '11

========================================================== APLAS 2011 Call For Papers Ninth Asian Symposium on Programming Languages and Systems Kenting, Taiwan, December 5--7, 2011 (co-located with CPP 2011) http://flolac.iis.sinica.edu.tw/aplas11/ ========================================================== BACKGROUND: APLAS aims at stimulating programming language research by providing a forum for the presentation of latest results and the exchange of ideas in topics concerned with programming languages and systems. APLAS is based in Asia, but is an international forum that serves the worldwide programming language community. APLAS is sponsored by the Asian Association for Foundation of Software (AAFS) founded by Asian researchers in cooperation with many researchers from Europe and the USA. The past APLAS symposiums were successfully held in Shanghai ('10), Seoul ('09), Bangalore ('08), Singapore ('07), Sydney ('06), Tsukuba ('05), Taipei ('04) and Beijing ('03) after three informal workshops. Proceedings of the past symposiums were published in Springer-Verlag's LNCS 6461, 5904, 5356, 4807, 4279, 3780, 3302, and 2895. The 2011 edition will be held at Kenting, a seaside resort in Southern Taiwan. TOPICS: The symposium is devoted to both foundational and practical issues in programming languages and systems. Papers are solicited on, but not limited to, the following topics: + semantics, logics, foundational theory; + design of languages and foundational calculi; + type systems; + compilers, interpreters, abstract machines; + program derivation and transformation; + program analysis, verification, model-checking, software security; + concurrency, constraints, domain-specific languages; + tools for programming, verification, implementation. APLAS 2011 is not limited to topics discussed in previous symposiums. Papers identifying future directions of programming and those addressing the rapid changes of the underlying computing platforms are especially welcome. Demonstration of systems and tools in the scope of APLAS are welcome to the System and Tool presentations category. Authors concerned about the appropriateness of a topic are welcome to consult with Program Chair prior to submission. IMPORTANT DATES: Abstract Deadline: June 13, 2011 Submission Deadline: June 17, 2011 (GMT) Notification: August 29, 2011 Camera-Ready: September 19, 2011 INVITED SPEAKERS: Nikolaj Bjorner, Microsoft Research Redmond Ranjit Jhala, UC San Diego Peter O'Hearn, Queen Mary U. London Sriram Rajamani, Microsoft Research India SUBMISSION INFORMATION: We solicit submissions in two categories: Regular research papers, describing original research results, including tool development and case studies, from a perspective of scientific research. Regular research papers should not exceed 16 pages in the Springer LNCS format, including bibliography and figures. They should clearly identify what has been accomplished and why it is significant. Submissions will be judged on the basis of significance, relevance, correctness, originality, and clarity. In case of lack of space, proofs, experimental results, or any information supporting the technical results of the paper could be provided as Appendix or a link to a web page. System and Tool presentations, describing systems or tools that support theory, program construction, reasoning, and/or program execution in the scope of APLAS. Unlike presentations of regular research papers, presentation of accepted papers in this category is expected to be centered around a demonstration. The paper and the demonstration should identify the novelties of the tools and use motivating examples. System and Tool papers should not exceed 8 pages in the Springer LNCS format, including bibliography and figures. Submissions will be judged based on both the papers and the systems or tools as described in the papers. It is highly desirable that the tools are available on the web. Papers should be submitted electronically via the submission web page at http://www.easychair.org/conferences/?conf=aplas2011. Acceptable formats are PostScript or PDF, viewable by Ghostview or Acrobat Reader. Submitted papers must be unpublished and not submitted for publication elsewhere. Papers must be written in English. The proceedings are planned to be published as a volume in Springer-Verlag's Lecture Notes in Computer Science series. Accepted papers must be presented at the conference. GENERAL CHAIR: Tyng-Ruey Chuang, Academia Sinica, Taiwan PROGRAM CHAIR: Hongseok Yang, Queen Mary U. London aplas2011(a)easychair.org PROGRAM COMMITTEE: Lars Birkedal (ITU, Denmark) James Brotherston (Imperial College, UK) Kung Chen (National Chengchi U., Taiwan) Wenguang Chen (Tsinghua U., China) Wei-Ngan Chin (NUS, Singapore) Javier Esparza (TUM, Germany) Xinyu Feng (USTC, China) Jerome Feret (INRIA, France) Matthew Fluet (RIT, USA) Rajiv Gupta (UC Riverside, USA) Masahito Hasegawa (Kyoto U., Japan) Radha Jagadeesan (Depaul U., USA) Naoki Kobayashi (Tohoku U., Japan) Daniel Kroning (U. Oxford, UK) Rupak Majumdar (MPI-SWS, Germany) Andrzej Murawski (U. Leicester, UK) Paulo Oliva (Queen Mary U. London, UK) Doron Peled (Bar Ilan U., Israel) Sukyoung Ryu (KAIST, Korea) Sriram Sankaranarayanan (U. Colorado, USA) Armando Solar-Lezama (MIT, USA) Sam Staton (U. Cambridge, UK) Viktor Vafeiadis (MPI-SWS, Germany) Kapil Vaswani (MSR, India) Martin Vechev (IBM, USA) Peng Wu (IBM, USA) Hongseok Yang (Queen Mary U. London, UK) Pen-Chung Yew (Academia Sinica, Taiwan) ORGANIZERS: Mike Dodds, U. Cambridge (Poster chair) Shin-Cheng Mu, Academia Sinica, Taiwan (Local arrangement chair) Noam Rinetzky, Queen Mary U. London (Publicity chair) Yih-Kuen Tsay, National Taiwan University (Finance chair)

1 0

TFP 2011: Call for participation (May 16th-18th)
by Ricardo Peña 05 May '11

05 May '11

-------------------------------------------------------- CALL FOR PARTICIPATION 12th International Symposium Trends in Functional Programming 2011 Madrid, Spain May 16-18, 2011 http://dalila.sip.ucm.es/tfp11 -------------------------------------------------------- --------------------- About TFP 2011 --------------------- The symposium on Trends in Functional Programming (TFP) is an international forum for researchers with interests in all aspects of functional programming, taking a broad view of current and future trends in the area. It aspires to be a lively environment for presenting the latest research results, and other contributions. TFP 2011 will be held in Madrid (Spain), on May 16th-18th, in the premises of the Computer Science Faculty of the Universidad Complutense de Madrid, one of the biggest universities in Europe (85.000 students). A visit to Toledo, (a well preserved Middle Age city, capital of Spain in the XVI century), is foreseen in the social program. Immediately after TFP 2011, the 2nd International Workshop on Foundational and Practical Aspects of Resource Analysis (FOPARA 2011) (http://dalila.sip.ucm.es/fopara11/) will be held in the same location. --------------------- Registration --------------------- Registration on-line is possible at http://dalila.sip.ucm.es/tfp11/?page_id=137 --------------------- Invited talk --------------------- Neil Mitchell http://community.haskell.org/~ndm/ Finding functions from types --------------------- Accepted papers --------------------- Thomas Schilling. Constraint-free Type Error Slicing. Adam Gundry. Type Inference for Units of Measure. Julien Signoles. An OCaml Library for Dynamic Typing. Vladimir Komendantsky. Subtyping by folding an inductive relation into a coinductive one. Maria Christakis, Konstantinos Sagonas. Static Detection of Deadlocks in Erlang. Attila Gobi, Olha Shkaravska, Marko Van Eekelen. Size Analysis of Higher-Order Functions. Stefan Holdermans, Jurriaan Hage. Refinement Types for Pattern-match Analysis. Edwin Brady. Epic --- A Library for Generating Compilers. Laurence E. Day, Graham Hutton. Towards Modular Compilers for Effects. Jocelyn Serot, Greg Michaelson. Compiling Hume down to gates. Jean-Christophe Filliatre, K. Kalyanasundaram. Functory: A Distributed Computing Library for Objective Caml. Barnabas Kralik, Viktoria Zsok, Zoltan Istenes. An Application of D-Clean Distributed Functional Programming for the Navigation of Robots. Jost Berthold, Ken Friis Larsen, Fritz Henglein, Andrzej Filinski, Mogens Steffensen, Brian Vinter. Functional High Performance Financial IT - The HIPERFIT Research Center in Copenhagen. Mustafa Aswad, Phil. W. Trinder, Hans-Wolfgang Loidl. Architecture Aware Parallel Programming in Glasgow Parallel Haskell (GPH). Christopher Brown, Hans-Wolfgang Loidl, Kevin Hammond. Refactoring Parallel Haskell Programs. Silvia Clerici, Cristina Zoltan. Exploiting Parallelism by Customizing Evaluation. Michael Lesniak. Thread-safe Priority Queues in Haskell based on Skiplists. Milan Straka. Adams' Trees Revisited - Correct and Efficient Implementation. Marco T. Morazan. The Time of Space Invaders Will Come to Pass: A Video Game Journey from Structural Recursion to Accumulative Recursion in CS1. Jeroen Henrix, Rinus Plasmeijer, Peter Achten. GiN: a graphical language and tool for defining iTask workflows. Pieter Koopman, Rinus Plasmeijer. Effective Test Set Generation. Gergely Devai. Restricted Function Patterns. German Andres Delbianco, Mauro Jaskelioff, Alberto Pardo. Applicative Shortcut Fusion. Christoph Herrmann, Edwin Brady, Kevin Hammond. Dependently-typed Programming by Composition from Functional Building Blocks. --------------------- TFP 2011 organization --------------------- Symposium Organization Chair: Ricardo Pe~na --------------------- Sponsors --------------------- Computer Science Faculty, Universidad Complutense de Madrid Spanish Ministry of Science and Innovation

1 0

2nd CFP: ACM SIGPLAN 7th Workshop on Generic Programming (WGP 2011)
by Shin-Cheng Mu 05 May '11

05 May '11

====================================================================== CALL FOR PAPERS WGP 2011 7th ACM SIGPLAN Workshop on Generic Programming Tokyo, Japan Sunday, September 18th, 2011 http://flolac.iis.sinica.edu.tw/wgp11/ Collocated with the International Conference on Functional Programming (ICFP 2011) ====================================================================== 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, * polytypic programming, * adaptive object-oriented programming, * component-based programming, * strategic programming, * aspect-oriented programming, * family polymorphism, * object-oriented generic programming, * and so on. Organizers ---------- Co-Chair Jaakko Järvi, Texas A&M University, USA Co-Chair Shin-Cheng Mu, Academia Sinica, Taiwan Programme Committee ------------------- Dave Abrahams, BoostPro Computing, USA Magne Haveraaen, Universitetet i Bergen, Norway Akimasa Morihata, Tohoku University, Japan Pablo Nogueira, Universidad Politécnica de Madrid, Spain Ulf Norell, Chalmers University of Technology and University of Gothenberg, Sweden Ross Paterson, City University London, UK Rinus Plasmeijer, Radboud University Nijmegen, The Netherlands Sibylle Schupp, Technische Universität Hamburg-Harburg, Germany Andrew Sutton, Kent State University, USA Tarmo Uustalu, Institute of Cybernetics, Estonia Important Information --------------------- We plan to have formal proceedings, published by the ACM. Submission details Deadline for submission: Monday 2011-06-06 Notification of acceptance: Tuesday 2011-07-01 Final submission due: Monday 2011-07-25 Workshop: Sunday 2011-09-18 Authors should submit papers, in postscript or PDF format, formatted for A4 paper, to the WGP11 EasyChair instance by the above deadline. The length should be restricted to 12 pages in standard (two-column, 9pt) ACM format. Accepted papers are published by the ACM and will additionally appear in the ACM digital library. History of the Workshop on Generic Programming ---------------------------------------------- This year: * Tokyo, Japan 2011 (affiliated with ICFP11) Earlier Workshops on Generic Programming have been held in * 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). Additional information: The WGP steering committee consists of J. Gibbons, R. Hinze, P. Jansson, J. Järvi, J. Jeuring, B. Oliveira, S. Schupp, and M. Zalewski

1 0

Haskell Weekly News - Issue 180
by Daniel Santa Cruz 05 May '11

05 May '11

Welcome to issue 180 of the HWN, a newsletter covering developments in the [1]Haskell community. This release covers the week of April 24 to 30, 2011. Announcements Eric Kow suggested (http://goo.gl/bc4JM) the creation of a Haskell User Group starter kit. If you have ideas in this department, please see what Eric has started! Christopher Done wrote (http://goo.gl/2m7AJ) a response to a blog from Cedric entitled "Why Scala's Option and Haskell's Maybe types won't save you from Null." A lively conversation followed. Henning Thielemann started an very interesting thread (http://goo.gl/FWyDE) with the title "Python is lazier than Haskell." (See the quotes of the week for the full quote) Quotes of the Week These quotes are taken from the #haskell channel, and from the haskell/haskell-cafe mailing lists. * Henning Thielemann: If Haskell is great because of its laziness, then Python must be even greater, since it is lazy at the type level. * Ben Lippmeier: Laziness at the value level causes space leaks, and laziness at the type level causes mind leaks. Neither are much fun. When people start wanting laziness at the kind level we'll have to quarantine them before the virus spreads... * Gregg Reynolds: If the designers could find a way to support laziness at the programmer level, I for one would be very grateful. * Felipe Almeida Lessa: But I am sure that john-millikin-is-great.txt must be increasing like a memory leak ;) * James Cook: I think Haskell questions on SO tend to the opposite extreme; no matter how poorly thought-out the question, the Haskell community will descend on it like a swarm of helpful piranhas. * Philippa: C++ seeing a renaissance as a functional language, is this a bit like rusty nails seeing a renaissance as sex toys for masochists? * #haskell: <aristid> preflex: seen FunctorSalad * preflex_ is now known as preflex. * copumpkin is now known as postflex. * xplat is now known as circumflex. <circumflex> FunctorSalad was never seen on #haskell-world-conquest -4 years, 3 days, 7i minutes and 0 seconds ago, saying: RELEASE THE KRAKEN! * tolkad: Without a standard you are lost, adrift in a sea of unspecified semantics. Hold fast to the rules of the specification lest you be consumed by ambiguity. * Saizan: it's much easier via type theory, 1) prove bottom 2) ???? 3) quodlibet * dons: Think of a monad as a spacesuit full of nuclear waste in the ocean next to a container of apples. Now, you can't put oranges in the space suite or the nuclear waste falls in the ocean, *but* the apples are carried around anyway, and you just take what you need. * tolkad: Perhaps by using it we could modernise haskell by applying the principles of the new kind of science Top Reddit Stories * The Irish Times: "Functional programming is more than just esoteric; it's becoming somewhat cool." Domain: irishtimes.com, Score: 44, Comments: 6 On Reddit: http://goo.gl/cfUbb Original: http://goo.gl/1nHEY * Why Silkapp uses Haskell Domain: blog.silkapp.com, Score: 43, Comments: 0 On Reddit: http://goo.gl/IFREi Original: http://goo.gl/1SwNa * Harper again: The real point of laziness Domain: existentialtype.wordpress.com, Score: 38, Comments: 89 On Reddit: http://goo.gl/vA8oD Original: http://goo.gl/hqcpy * Patent 5,893,120 reduced to mathematical formulae (via Haskell) Domain: paulspontifications.blogspot.com, Score: 34, Comments: 13 On Reddit: http://goo.gl/PmB4K Original: http://goo.gl/QknmV * IO evaluates the Haskell heap Domain: blog.ezyang.com, Score: 33, Comments: 3 On Reddit: http://goo.gl/FzaGV Original: http://goo.gl/KNHku * Why Haskell? Domain: blog.mired.org, Score: 33, Comments: 19 On Reddit: http://goo.gl/t1r8I Original: http://goo.gl/cV6KL * Filter and Visualize Data in Seconds with Silk (Haskell-based startup) Domain: thenextweb.com, Score: 33, Comments: 18 On Reddit: http://goo.gl/hA9HF Original: http://goo.gl/NIR3U * Haskell libraries you should use Domain: blog.johantibell.com, Score: 29, Comments: 3 On Reddit: http://goo.gl/PPTWG Original: http://goo.gl/LmbT6 * Tying the Knot - a really mind bending Haskell technique Domain: haskell.org, Score: 27, Comments: 8 On Reddit: http://goo.gl/iEdSM Original: http://goo.gl/5Zg6f * haskell.org GSoC accepted projects are up. Domain: self.haskell, Score: 26, Comments: 32 On Reddit: http://goo.gl/mnrl9 Original: /r/haskell/comments/gxj1h/haskellorg_gsoc_accepted_projects_are_up/ Top StackOverflow Questions * What are the best Haskell libraries to operationalize a program? votes: 57, answers: 3 Read on SO: http://goo.gl/rYQiL * How do you design programs in Haskell or other functional programming languages? [migrated] votes: 24, answers: 0 Read on SO: http://goo.gl/IW7Z5 * Haskell: why the convention to name a helper function "go"? votes: 22, answers: 3 Read on SO: http://goo.gl/CE1O7 * What haskell topics need to be addressed in a Real-World-Haskell style? votes: 21, answers: 5 Read on SO: http://goo.gl/3tgE4 * What are some interesting uses of high order functions? votes: 14, answers: 14 Read on SO: http://goo.gl/WdGeF * How are mutable arrays implemented in Haskell? votes: 10, answers: 3 Read on SO: http://goo.gl/LMK8u * Performance problem with Euler problem and recursion on Int64 types votes: 10, answers: 6 Read on SO: http://goo.gl/CLXD2 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

CfP: Resource Adaptive Compilation and Runtime Environments
by Frank Penczek 04 May '11

04 May '11

RACORE2011 Resource Adaptive Compilation and Runtime Environments http://csa.science.uva.nl/racore2011 A mini-symposium held in conjunction with ParCo2011 Ghent University, Belgium 30 August - September 2011 RACORE2011 is a mini-symposium organized in conjunction with the Parallel Computing conference ParCo2011, to be held in Ghent, Belgium on 30 August - 2 September 2011. Scope ----- The computing landscape is diversifying. On most computing platforms, the number and properties of available computing resources differ, both over space and over time. Space heterogeneity arises in commodity hardware from diverse core counts and combinations of CPUs with companion processors like GPGPUs, streaming units as in IBM's Cell processor or specialised hardware. Time heterogeneity arises from frequency scaling, hardware faults, and dynamic addition or removal of hardware components. Deploying software to such diverse targets inevitably needs to factor in resource adaptability, especially at run-time. The RACORE symposium addresses dynamic adaptation of programs and operating systems to changes in resource availability at run time, either when applications are started or during their execution. We foresee adaptation ranging from, but not limited to, changes to the mapping of computation to resources, adjusting the level of exhibited concurrency, reacting to energy constraints, possibly down to hardware reconfiguration. We solicit papers on all aspects of dynamic adaptation to resource constraints. Topics include but are not limited to: - adaptive mapping of applications to resources (e.g. the set of applications or the set of resources evolves over time) - dynamically adapting code / just-in-time compilation - adaptation of program concurrency at run-time - dynamic trade-offs for resource consumption (e.g. cores vs. memory) - adaptation to comply with energy budgets - dynamically evolving computation resources - dynamically evolving input/output requirements or channel properties Papers ------ Authors are invited to submit a full paper (up to 8 pages) or an extended abstract (at least 2 pages) using the EasyChair submission system. Details regarding the format and other author guidelines are given on the submission page. Deadline for the submission is 15 June 2011. More information: http://csa.science.uva.nl/racore2011/submission/ Committees ---------- Organizing committee: - Frank Penczek, University of Hertfordshire, UK - Raphael Poss, University of Amsterdam. NL - Stephan Herhut, Intel, USA - Clemens Grelck, University of Amsterdam, NL - Sven-Bodo Scholz, University of Hertfordshire, UK - Chris Jesshope, University of Amsterdam, NL Program committee: - Clemens Grelck, University of Amsterdam, NL - Sven-Bodo Scholz, University of Hertfordshire, UK - Alex Shafarenko, University of Hertfordshire, UK - Chris Jesshope, University of Amsterdam, NL - Mats Brorsson, KTH Sweden - Albert Cohen, INRIA France - Benedict Gaster, AMD USA - James P. Held, Intel, USA - Stephan Herhut, Intel, USA - Brad Chamberlain, Cray, USA - John Reppy, University of Chicago, USA Important dates: - June 15th: Deadline for submission - July 22nd: Notification of acceptance - August 22nd: Final papers due

1 0

ANNOUNCE: The SF Haskell Meetup Group
by Mark Erdmann 02 May '11

02 May '11

Hi Everyone, I'm very pleased to announce that there is now an SF Haskell Meetup group ( http://www.meetup.com/The-SF-Haskell-Meetup/) The first meetup is scheduled for May 11th at 7pm. It's being hosted in the dotCloud office, which is located at 180 Sansome St., Suite 1600 (only two blocks from the Montgomery BART stop). If anyone would like to give a talk, please let me know! Best regards, Mark Erdmann Software Engineer http://www.dotcloud.com

1 0

2011 GTTSE/SLE Students' Workshop: Call for extended abstracts
by João Fernandes 30 Apr '11

30 Apr '11

* * * 2011 GTTSE/SLE Students' Workshop * * * July 5, 2011 Braga, Portugal http://gttse.wikidot.com/2011:students-workshop http://planet-sl.org/sle2011/ The co-location of SLE and GTTSE provides us the opportunity to combine their respective Doctoral Symposium and Participants' Workshop to form the GTTSE/SLE Students' Workshop. The students' workshop features presentations by the GTTSE and SLE participants: PhD students, PostDocs, practitioners, and other members of the computer science community. All registered participants are asked to submit an extended abstract in one of two forms: 1. Committed junior researchers may leverage the workshop as a means to present their relevant research and to receive feedback from senior researchers in the field. Submissions of this form should be an extended abstract of 2 pages in Springer LNCS style as a presentation proposal for the workshop. This may describe new ideas or early results, but there are no formal specifications as to the abstracts content. 2. In addition, doctoral students may use the workshop as a way to get feedback on their proposed doctoral research plan. Students should submit a 4 page (LNCS style, excluding references) abstract based on the following outline: - Problem Description and Motivation. - Brief Overview of Related Work, highlighting the gap the work aims to fill. - Proposed Solution, a high-level overview and any hypotheses that you have formulated. - Research Method, describing how you will validate or refute your hypotheses. It is understood that students at different stages of their research will be able to make more or less detailed and stabilized contributions to each of these sections. Therefore, we provide this outline as more of a guide than a strict requirement. Nonetheless, we encourage even early-stage PhD students to consider using this outline. Selection process for the SLE/GTTSE Students' Workshop The organizers will select proposals, with assistance as needed from the GTTSE scientific committee and the SLE program committee, for an interesting program. There are always more presentation proposals than there are slots in the workshop. There are likely to be 10-15 slots for presentations with 10-15 minutes each. The organizers will select a compelling set of presentation topics. This selection process is supposed to be informal and must not be confused with any sort of peer review or selective review. In particular, no formal feedback is returned to the authors of the 2 page abstracts. Authors are merely notified of the selection's outcome. Authors of 4 page doctoral research plans will receive informal feedback from reviewers chosen from the GTTSE scientific committee and SLE program committee. Authors who are not selected and who still wish to present some of their material may exhibit (and present) a poster at GTTSE. All reasonable submissions are distributed in printed form at the workshop. The abstracts will not be published online. The titles of selected presentations appear online though. Presenters may also voluntarily submit their slides for inclusion on the website. The GTTSE/SLE Students' Workshop will feature an award sponsored by SIG (The Software Improvement Group), to be given to the best presentation at the workshop. The awardee will be determined by a committee of senior attendees that is assembled by the organizers. Why present at and participate in the workshop? Each presenter benefits by means of the feedback from the renowned tutorial speakers and other participants. Presentation at the workshop may also spark off new collaborations. The school and conference, as a whole, also benefits from the workshop because the presentations constitute a blend of the current research interests in the GTTSE and SLE communities. Submission The submission deadline is May 27, 2011. This coincides with the end of Early Registration for both GTTSE and SLE. Abstracts must be submitted via EasyChair. See the event web pages (above) for submission details. Notes on the GTTSE post-proceedings After the school, all GTTSE participants (i.e., presenters, non-presenters, and non-submitters to the workshop) are encouraged to submit a contribution for inclusion into the post-proceedings. These contributions are properly reviewed and selection for the post-proceedings is competitive. Successful contributions have to meet high originality and quality standards. Compared to the usual peer-reviewed venue, GTTSE is particularly prepared to provide gentle and detailed feedback to PhD students. Submissions to the post-proceedings can have up to 15 pages. A designated call for contributions to the post-proceedings is distributed after the school. Event co-chair: Joost Visser, Software Improvement Group, The Netherlands Eric Van Wyk, University of Minnesota, United States

1 0

ANNOUNCE: HFusion
by Facundo Domínguez 29 Apr '11

29 Apr '11

I'm pleased to announce the first release of HFusion[1] as a library. http://hackage.haskell.org/package/hfusion HFusion is a tool which transforms a subset of Haskell programs by applying fusion techniques based on hylomorphism, a program scheme by means of which it is possible to express a wide class of recursive functions. Hylomorphisms are automatically derived from user supplied definitions [1]. Related work includes [2,3,4,5]. The HFusion implementation allows to handle some interesting cases like: * primitive recursion * mutual recursion * recursion over multiple arguments * recursion based on regular functors The library is not particularly solid yet, but it may be of use to people interested in program transformations and certainly it would benefit from community feedback. Requests for fixes, explanations and improvements are more than welcome. ======= Use example ======= import HFusion.HFusion import Control.Monad.Trans(lift) import Language.Haskell.Parser(parseModule) fuseDefinitions :: String -> Either FusionError String fuseDefinitions sourceCode = runFusionState newVarGen$ -- Parse input with a Haskell parser. parseResult2FusionState (Language.Haskell.Parser.parseModule sourceCode) -- Convert the haskell AST to the AST used by HFusion. >>= hsModule2HsSyn -- Derive hylomorphisms for the definitions in the program. >>= lift . fmap snd . deriveHylos -- Fuse functions "zip" and "filter", which are expected -- to be defined in the sourceCode parameter, composing -- "filter" on the second argument of "zip" and naming "zf" -- the resulting recursive definition. >>= fuse "zip" 2 "filter" ["zf"] -- Translate the result from HFusion AST to Haskell source code. >>= return . hsSyn2HsSourceCode main = do cs <- readFile "examples.hs" putStr$ either (("There was an error: "++) . show) id$ fuseDefinitions cs --------- [1] http://www.fing.edu.uy/inco/proyectos/fusion [2] P. Johann and E. Visser. Warm fusion in Stratego: A case study in generation of program transformation systems. Annals of Mathematics and A.I., 29(1-4):1–34, 2000. [3] T. Yokoyama, Z. Hu, and M. Takeichi. Calculation rules for warming-up in fusion transformation. In Trends in Func. Programming, pages 399–41, 2005. [4] O. Chitil. Type-Inference Based Deforestation of Functional Programs. PhD thesis, RWTH Aachen, October 2000. [5] L. Németh. Catamorphism-Based Program Transformations for Non-Strict Functional Languages. PhD thesis, Glasgow University, 2000.

1 0

ANNOUNCE: zeno-0.2
by Will Sonnex 28 Apr '11

28 Apr '11

I've recently finished an update to Zeno, a proof system for Haskell program properties. It now outputs programs and proofs as Isabelle/HOL theories and should hopefully be more usable in general. You still express properties to be proven within Haskell, but the syntax has changed. Here are some examples: reverse_twice xs = prove (reverse (reverse xs) :=: xs) elem_append xs ys y = givenBool (elem y ys) $ proveBool (elem y (xs ++ ys)) Lots more details on the wiki page: http://www.haskell.org/haskellwiki/Zeno, and you can try it online using TryZeno: http://www.doc.ic.ac.uk/~ws506/tryzeno. Cheers, Will

1 0