June 2012 - Haskell - Haskell.org

Call for Papers: PEPM 2013, Partial Evaluation and Program Manipulation
by Shin-Cheng Mu 15 Jun '12

15 Jun '12

C A L L F O R P A P E R S === P E P M 2013 === ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation http://www.program-transformation.org/PEPM13 January 20-21, 2013 Rome, Italy (Affiliated with POPL 2013) ** SUBMISSION DEADLINE: ** late September/early October (precise date to be announced on the website shortly) SCOPE The PEPM Symposium/Workshop series aims at bringing together researchers and practitioners working in the areas of program manipulation, partial evaluation, and program generation. PEPM focuses on techniques, theory, tools, and applications of analysis and manipulation of programs. The 2013 PEPM workshop will be based on a broad interpretation of semantics-based program manipulation and continue recent years' successful effort to expand the scope of PEPM significantly beyond the traditionally covered areas of partial evaluation and specialization and include practical applications of program transformations such as refactoring tools, and practical implementation techniques such as rule-based transformation systems. In addition, the scope of PEPM covers manipulation and transformations of program and system representations such as structural and semantic models that occur in the context of model-driven development. In order to reach out to practitioners, a separate category of tool demonstration papers will be solicited. Topics of interest for PEPM'13 include, but are not limited to: * Program and model manipulation techniques such as: supercompilation, partial evaluation, fusion, on-the-fly program adaptation, active libraries, program inversion, slicing, symbolic execution, refactoring, decompilation, and obfuscation. * Program analysis techniques that are used to drive program/model manipulation such as: abstract interpretation, termination checking, binding-time analysis, constraint solving, type systems, automated testing and test case generation. * Techniques that treat programs/models as data objects including metaprogramming, generative programming, embedded domain-specific languages, program synthesis by sketching and inductive programming, staged computation, and model-driven program generation and transformation. * Application of the above techniques including case studies of program manipulation in real-world (industrial, open-source) projects and software development processes, descriptions of robust tools capable of effectively handling realistic applications, benchmarking. Examples of application domains include legacy program understanding and transformation, DSL implementations, visual languages and end-user programming, scientific computing, middleware frameworks and infrastructure needed for distributed and web-based applications, resource-limited computation, and security. To maintain the dynamic and interactive nature of PEPM, we will continue the category of `short papers' for tool demonstrations and for presentations of exciting if not fully polished research, and of interesting academic, industrial and open-source applications that are new or unfamiliar. Student attendants 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 programme, see its web page. All accepted papers, short papers included, will appear in formal proceedings published by ACM Press. In addition to printed proceedings, accepted papers will be included in the ACM Digital Library. Like for recent PEPMs, selected papers will be invited for a journal special issue dedicated to PEPM'13. PEPM has established a Best Paper award. The winner will be announced at the workshop. Authors must transfer copyright to ACM upon acceptance (for government work, to the extent transferable), but retain various rights. Authors are encouraged to publish auxiliary material with their paper (source code, test data, etc.); they retain copyright of auxiliary material. The SIGPLAN Republication Policy and ACM's Policy and Procedures on Plagiarism apply. SUBMISSION GUIDELINES, CATEGORIES, AND PROCEEDINGS Regular Research Papers must not exceed 10 pages in ACM Proceedings style. Tool demonstration papers must not exceed 4 pages in ACM Proceedings style. At least one author of each accepted contribution must attend the workshop and present the work. In the case of tool demonstration papers, a live demonstration of the described tool is expected. Suggested topics, evaluation criteria, and writing guidelines for both research and tool demonstration papers will be made available on the PEPM'13 Web-site. Papers should be submitted electronically via the workshop web site. PROGRAM CO-CHAIRS Elvira Albert (Complutense University of Madrid, Spain) Shin-Cheng Mu (Academia Sinica, Taiwan) PEPM 2013 PROGRAM COMMITTEE * Maria Alpuente (Technical University of Valencia, Spain) * Kenichi Asai (Ochanomizu University, Japan) * Maria Garcia de la Banda (Monash University, Australia) * James R. Cordy (Queen's University, Canada) * R. Kent Dybvig (Cisco and Indiana University, USA) * Joao Fernandes (University of Minho, Portugal) * Samir Genaim (Complutense University of Madrid, Spain) * Roberto Giacobazzi (Verona University, Italy) * Andy Gill (University of Kansas, USA) * Jurriaan Hage (Utrecht University, Netherlands) * Martin Hofmann (Ludwig-Maximilians-Universität München, Germany) * Julia Lawall (INRIA, France) * Yanhong Annie Liu (Stony Brook University, USA) * Kazutaka Matsuda (University of Tokyo, Japan) * Keisuke Nakano (University of Electro-Communications, Japan) * Klaus Ostermann (University of Marburg, Germany) * Sergei A. Romanenko (Russian Academy of Sciences, Russia) * Jeremy Siek (University of Colorado at Boulder, USA) * Walid Mohamed Taha (Halmstad University, Sweden) * Tarmo Uustalu (Tallinn University of Technology, Estonia) * Janis Voigtlaender (University of Bonn, Germany) * Dana N. Xu (INRIA, France)

1 0

JustHub 'Sherkin' Release
by Chris Dornan 14 Jun '12

14 Jun '12

JustHub 'Sherkin' Release ==================== I am pleased to announce the Sherkin release of the JustHub distribution of Haskell for Enterprise Linux and the release of the Hub source code on which the distribution is based to Hackage and GitHub. The JustHub distribution is distinctive in providing a comprehensive back-catalogue of GHC tool chains (back to 6.10.4) and major Haskell Platform releases (currently back to 2011.2.0.1) as well as the timely appearance of leading edge GHC releases (such as GHC 7.4.2) in addition to the Haskell Platform de jour (2012.2.0.0), all of which can be deployed simultaneously on the same system. Previous releases of the distribution have been confined to Red Hat Enterprise Linux versions 5 and 6 (and of course CentOS and Scientific Linux); this release expands this coverage to Fedora Linux 16 and 17, which can deployed along side or integrated into Fedora Linux's excellent native Haskell distribution. The JustHub distribution is based on the Hub system for sandbox development that allows each work tree to work in its own sandboxed environment with a specific tool chain and a private user-package database. All of the standard Haskell tools inter-operate cleanly and transparently with the sandboxes and operate in the normal way outside of them. Sandboxed environments (hubs) can be shared between work trees as well as being (re)named, annotated, replicated, swapped, archived, locked and removed. Proper package deletion with the option of garbage collecting orphaned code and documentation is also supported. If anyone would like to incorporate the hub system into a Haskell distribution or port it to a non-Posix system then they are very welcome to contact me (though be warned: time is tight just now). Note that while the distro has had plenty of serious usage (funnily enough it is popular with build-bot admins) it has also been recently extended and revised the software remains in beta testing for now. For news, documentation, articles, download and installation instructions, links to the repositories and trackers etc., see http://justhub.org. Chris Dornan

4 6

Haskell Weekly News: Issue 231
by Daniel Santa Cruz 14 Jun '12

14 Jun '12

Welcome to issue 231 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of June 03 to 09, 2012. Announcements Paolo Capriotti announced the patchlevel release of GHC 7.4.2. "This release contains a number of bugfixes relative to 7.4.1, so we recommend upgrading." [1] http://goo.gl/X3Z85 Quotes of the Week * roconnor: there's a right way, and a wrong way, and then there is the ekmett way. Top Reddit Stories * Haskell Platform 2012.2.0.0 released Domain: hackage.haskell.org, Score: 104, Comments: 33 On Reddit: [2] http://goo.gl/ZNa9h Original: [3] http://goo.gl/JjJg2 * Why free monads matter Domain: haskellforall.com, Score: 61, Comments: 47 On Reddit: [4] http://goo.gl/hfKlc Original: [5] http://goo.gl/JPpsp * 3 Flavors of MVar: Lock, Var, Barrier Domain: neilmitchell.blogspot.com, Score: 43, Comments: 20 On Reddit: [6] http://goo.gl/3eEkO Original: [7] http://goo.gl/ek7Qq * Introducing the HERMIT Equational Reasoning Framework Domain: ittc.ku.edu, Score: 36, Comments: 20 On Reddit: [8] http://goo.gl/UC0sF Original: [9] http://goo.gl/ifS7f * Complicating conduit? Domain: yesodweb.com, Score: 35, Comments: 45 On Reddit: [10] http://goo.gl/W4rfE Original: [11] http://goo.gl/rU0vK * Beautiful Code, Compelling Evidence: OpenGL, Cairo tutorial [PDF, 33 pages] Domain: renci.org, Score: 33, Comments: 2 On Reddit: [12] http://goo.gl/qKY8w Original: [13] http://goo.gl/r5SVj * Forklift - a pattern for performing monadic actions in a worker thread Domain: apfelmus.nfshost.com, Score: 30, Comments: 7 On Reddit: [14] http://goo.gl/B6brV Original: [15] http://goo.gl/mWVAv * Dependently typed programming with singletons (Eisenberg, Weirich)[PDF] Domain: cis.upenn.edu, Score: 29, Comments: 3 On Reddit: [16] http://goo.gl/y3fYv Original: [17] http://goo.gl/RqM5m * Continuation-based relative-time FRP Domain: paolocapriotti.com, Score: 22, Comments: 6 On Reddit: [18] http://goo.gl/CFSK7 Original: [19] http://goo.gl/cP0cJ * Explaining the Prompt monad with a clearer representation Domain: joeysmandatory.blogspot.com, Score: 21, Comments: 42 On Reddit: [20] http://goo.gl/ZZM93 Original: [21] http://goo.gl/Im7SF * Lazily Evaluate length of a list Domain: self.haskell, Score: 21, Comments: 29 On Reddit: [22] http://goo.gl/cKUOt Original: [23] http://goo.gl/cKUOt Top StackOverflow Questions * Killing a thread when MVar is garbage collected votes: 22, answers: 4 Read on SO: [24] http://goo.gl/cvoqw * How does one write efficient Dynamic Programming algorithms in Haskell? votes: 16, answers: 3 Read on SO: [25] http://goo.gl/mkMTp * How to apply a polymorphic function to a Dynamic value votes: 11, answers: 1 Read on SO: [26] http://goo.gl/3jIVr * Haskell Typeclass for Tuples votes: 11, answers: 3 Read on SO: [27] http://goo.gl/pvDah * Monadic expressions in conditionals - GHC compiles, cabal refuses votes: 10, answers: 2 Read on SO: [28] http://goo.gl/QXMXh * GHC Optimization: Collatz conjecture votes: 10, answers: 2 Read on SO: [29] http://goo.gl/AfiEC * Haskell: Lists vs Streams votes: 10, answers: 3 Read on SO: [30] http://goo.gl/qn1dE * Is my program Turing-complete? votes: 9, answers: 2 Read on SO: [31] http://goo.gl/PLf5q * How to find the optimal processing order? votes: 9, answers: 1 Read on SO: [32] http://goo.gl/P3XZ2 * How to do fast data deserialization in Haskell votes: 9, answers: 1 Read on SO: [33] http://goo.gl/Synm2 * What's so bad about OverlappingInstances? votes: 9, answers: 1 Read on SO: [34] http://goo.gl/M17Rp Until next time, Daniel Santa Cruz References 1. http://permalink.gmane.org/gmane.comp.lang.haskell.glasgow.user/22181 2. http://hackage.haskell.org/platform/?2012.2.0.0 3. http://www.reddit.com/r/haskell/comments/uipvz/haskell_platform_2012200_rel… 4. http://www.haskellforall.com/2012/06/you-could-have-invented-free-monads.ht… 5. http://www.reddit.com/r/haskell/comments/utxq2/why_free_monads_matter/ 6. http://neilmitchell.blogspot.com/2012/06/flavours-of-mvar_04.html 7. http://www.reddit.com/r/haskell/comments/uk9wu/3_flavors_of_mvar_lock_var_b… 8. http://www.ittc.ku.edu/csdlblog/?p=105 9. http://www.reddit.com/r/haskell/comments/ujdet/introducing_the_hermit_equat… 10. http://www.yesodweb.com/blog/2012/06/complicating-conduit 11. http://www.reddit.com/r/haskell/comments/urc75/complicating_conduit/ 12. http://www.renci.org/wp-content/pub/tutorials/BeautifulCode.pdf 13. http://www.reddit.com/r/haskell/comments/uqc33/beautiful_code_compelling_ev… 14. http://apfelmus.nfshost.com/blog/2012/06/07-forklift.html 15. http://www.reddit.com/r/haskell/comments/uq44h/forklift_a_pattern_for_perfo… 16. http://www.cis.upenn.edu/~eir/papers/2012/singletons/paper.pdf 17. http://www.reddit.com/r/haskell/comments/uic9g/dependently_typed_programmin… 18. http://paolocapriotti.com/blog/2012/06/04/continuation-based-relative-time-… 19. http://www.reddit.com/r/haskell/comments/uklsq/continuationbased_relativeti… 20. http://joeysmandatory.blogspot.com/2012/06/explaining-prompt-monad-with-sim… 21. http://www.reddit.com/r/haskell/comments/unpaz/explaining_the_prompt_monad_… 22. http://www.reddit.com/r/haskell/comments/uomz4/lazily_evaluate_length_of_a_… 23. http://www.reddit.com/r/haskell/comments/uomz4/lazily_evaluate_length_of_a_… 24. http://stackoverflow.com/questions/10871303/killing-a-thread-when-mvar-is-g… 25. http://stackoverflow.com/questions/10906053/how-does-one-write-efficient-dy… 26. http://stackoverflow.com/questions/10889682/how-to-apply-a-polymorphic-func… 27. http://stackoverflow.com/questions/10899804/haskell-typeclass-for-tuples 28. http://stackoverflow.com/questions/10867300/monadic-expressions-in-conditio… 29. http://stackoverflow.com/questions/10876110/ghc-optimization-collatz-conjec… 30. http://stackoverflow.com/questions/10942450/haskell-lists-vs-streams 31. http://stackoverflow.com/questions/10878846/is-my-program-turing-complete 32. http://stackoverflow.com/questions/10879838/how-to-find-the-optimal-process… 33. http://stackoverflow.com/questions/10902405/how-to-do-fast-data-deserializa… 34. http://stackoverflow.com/questions/10942136/whats-so-bad-about-overlappingi…

1 0

Lectureship within the MSP group, Strathclyde
by Robert Atkey 13 Jun '12

13 Jun '12

****************************************************************** *** Lectureship *** *** Mathematically Structured Programming Group *** University of Strathclyde *** ****************************************************************** Applications are invited for lectureship within the MSP group at the University of Strathclyde The applicant's motivation must centre on a desire to discover beautiful mathematics of lasting value. The applicant should also have an innate sense of the wonder of learning allied with the capacity for self-motivation and a track record of academic achievement. The Mathematically Structured Programming Group's vision is to use mathematics to understand the nature of computation, and to then turn that understanding into practical advances within programming languages research. This reflects the symbiotic relationship between mathematics, programming, and the design of programming languages --- we believe that any attempt to sever this connection will diminish each component. In order to achieve these research goals, we mainly use ideas from category theory, type theory, and functional programming. The group consists of a number of internationally leading researchers including Professor Neil Ghani, Dr Patricia Johann, Dr Conor McBride, Dr Peter Hancock, Dr Robert Atkey, and our PhD students. While the lectureship is formally in the area of Program Verification, this is to be interpreted broadly. Very broadly. Anyone interested should in the first instance contact Professor Neil Ghani, whose email address is "neil.ghani at strath.ac.uk" to register interest. Details of the position can be found at http://www.mis.strath.ac.uk/Personnel/open/712012.pdf The closing date for applications is Thursday July 26. Please pass this on to anyone who you think would enjoy the chance to work with us. All the best Neil

1 0

Ph.D. position in computer science at DIKU
by Fritz Henglein 13 Jun '12

13 Jun '12

The Department of Computer Science, University of Copenhagen, Denmark (DIKU) invites applications for a PhD scholarship starting September/October 2012. The scholarship is internally financed and *not* subject to requirements of a specific research project or an external funding agent. The Theory and Practice of Programming Languages Lab at DIKU would welcome applications from candidates with a strong background in core computer science (algorithms, languages, systems) and interests in functional programming, including type systems, program transformation, program analysis, parallel computing and database systems. Application deadline: July 2nd, 2012. For more information, see http://diku.dk/ominstituttet/ledige_stillinger/phd_computer_science/ If you have questions, please feel free to contact Fritz Henglein at henglein(a)diku.dk.

1 0

ANN: clckwrks - a Haskell blogging and CMS framework
by Jeremy Shaw 12 Jun '12

12 Jun '12

Hello! I am pleased to announce the launch of clckwrks.com. clckwrks (pronounced, 'clockworks') is a new Haskell-based content management (CMS) and blogging framework: http://www.clckwrks.com/ It is freely available under the BSD3 license. clckwrks is still in early alpha development. We are looking for developers who want to contribute or just like to try bleeding edge software. clckwrks is already being used to power happstack.com and clckwrks.com -- so it is already useful. There are a lot of things we are not happy with yet ranging from code formatting to design issues. But, at the same time, there are a lot of things we are very happy with. If you would like to help get us to clckwrks 1.0, we'd love to have your help! For more information, check out the website and consider joining the mailing list. Thanks! - jeremy

1 0

ANNOUNCE: GHC version 7.4.2
by Paolo Capriotti 10 Jun '12

10 Jun '12

============================================================= The (Interactive) Glasgow Haskell Compiler -- version 7.4.2 ============================================================= The GHC Team is pleased to announce a new patchlevel release of GHC. This release contains a number of bugfixes relative to 7.4.1, so we recommend upgrading. The release notes are here: http://www.haskell.org/ghc/docs/7.4.2/html/users_guide/release-7-4-2.html How to get it ~~~~~~~~~~~~~ The easy way is to go to the web page, which should be self-explanatory: http://www.haskell.org/ghc/ We supply binary builds in the native package format for many platforms, and the source distribution is available from the same place. Packages will appear as they are built - if the package for your system isn't available yet, please try again later. Background ~~~~~~~~~~ Haskell is a standard lazy functional programming language. GHC is a state-of-the-art programming suite for Haskell. Included is an optimising compiler generating good code for a variety of platforms, together with an interactive system for convenient, quick development. The distribution includes space and time profiling facilities, a large collection of libraries, and support for various language extensions, including concurrency, exceptions, and foreign language interfaces (C, whatever). GHC is distributed under a BSD-style open source license. A wide variety of Haskell related resources (tutorials, libraries, specifications, documentation, compilers, interpreters, references, contact information, links to research groups) are available from the Haskell home page (see below). On-line GHC-related resources ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Relevant URLs on the World-Wide Web: GHC home page http://www.haskell.org/ghc/ GHC developers' home page http://hackage.haskell.org/trac/ghc/ Haskell home page http://www.haskell.org/ Supported Platforms ~~~~~~~~~~~~~~~~~~~ The list of platforms we support, and the people responsible for them, is here: http://hackage.haskell.org/trac/ghc/wiki/Contributors Ports to other platforms are possible with varying degrees of difficulty. The Building Guide describes how to go about porting to a new platform: http://hackage.haskell.org/trac/ghc/wiki/Building Developers ~~~~~~~~~~ We welcome new contributors. Instructions on accessing our source code repository, and getting started with hacking on GHC, are available from the GHC's developer's site run by Trac: http://hackage.haskell.org/trac/ghc/ Mailing lists ~~~~~~~~~~~~~ We run mailing lists for GHC users and bug reports; to subscribe, use the web interfaces at http://www.haskell.org/mailman/listinfo/glasgow-haskell-users http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs There are several other haskell and ghc-related mailing lists on www.haskell.org; for the full list, see http://www.haskell.org/mailman/listinfo/ Some GHC developers hang out on #haskell on IRC, too: http://www.haskell.org/haskellwiki/IRC_channel Please report bugs using our bug tracking system. Instructions on reporting bugs can be found here: http://www.haskell.org/ghc/reportabug

1 0

CfP [revised deadline]: IEEE Software Engineering Workshop (SEW-35), Heraclion, Crete, 12-13 October 2012
by Huibiao Zhu 10 Jun '12

10 Jun '12

[Note revised submission deadline of 1 July 2012.] IEEE Software Engineering Workshop (SEW-35) 12-13 October 2012 Heraclion, Crete, Greece http://www.seworkshop.org Co-located with 5th International Symposium on Leveraging Applications of Formal Methods (ISoLA 2012) http://www.cs.uni-potsdam.de/isola/isola2012/ Sponsored by IEEE Computer Society, Technical Council on Software Engineering (pending). Background The 35th IEEE Software Engineering Workshop, the longest continually running Software Engineering event in the world, will be held in Heraclion, Crete, collocated with ISoLA 2012. Scope The workshop aims to bring together all those with an interest in software engineering. Traditionally, the conference attracts industrial and government practitioners and academics pursuing the advancement of software engineering principles and techniques. The workshop provides a forum for reporting on past experiences, for describing new and emerging results and techniques, and for exchanging ideas on best practice and future directions. Topics of interest include, but are not limited to: * Metrics and experience reports * Software quality assurance * Formal methods and formal approaches to software development * Software engineering processes and process improvement * CMM and CMMI * Requirements engineering * Software architectures * Real-time Software Engineering * Software maintenance, reuse, and legacy systems * Agent-based software systems * Self-managing systems Submissions Long papers (maximum 10 pages in IEEE format) and short industrial/governmental experience reports (maximum 5 pages in IEEE format) are sought for inclusion in the conference program and publication in the postproceedings, which will be published by IEEE CS Press (see http://www.ieee.org/conferences_events/conferences/publishing/templates.html for paper formatting instructions). All submissions will be reviewed for originality, relevance, and technical detail. At least one author per paper will be required to register and present at the workshop. Papers not presented will not be included in the proceedings. All submissions must be made in electronic format (.doc, .pdf, or .ps formats only), via the conference electronic submission site at: http://www.easychair.org/conferences/?conf=sew35 Publication All accepted papers will be published in the conference post proceedings, to be published by IEEE CS Press. Some authors will also be invited to submit a revised version of their paper for inclusion in Innovations in Systems and Software Engineering: A NASA Journal (Springer). Important Dates 1 July 2012 Long and short papers due 17 August 2012 Notification to authors 12-13 October 2012 SEW in Crete 12 December 2012 Final papers due for post-proceedings Enquiries Any program inquiries should be directed by email to the Programme Co-chairs: Jonathan Bowen, London South Bank University/Museophile Limited, UK jonathan.bowen(a)lsbu.ac.uk Huibiao Zhu, East China Normal University, Shanghai, China hbzhu(a)sei.ecnu.edu.cn Any general inquiries should be directed by email to the Workshop Chair: Mike Hinchey, Lero, University of Limerick, Republic of Ireland mike.hinchey(a)lero.ie For faster responses, please include "SEW" in the subject line.

1 0

Announce: Kansas University Rewrite Engine (KURE) 2.0.0
by Neil Sculthorpe 08 Jun '12

08 Jun '12

KURE 2.0.0 is now available on Hackage. This is a substantial redesign of the previous versions of KURE. Comments or feature requests are welcome. About KURE ---------- The Kansas University Rewrite Engine (KURE) is a DSL for strategic rewriting. KURE shares concepts with Stratego, but unlike Stratego, KURE is strongly typed. KURE is similar to StrategyLib, but has a lightweight generic traversal mechanism using type families rather than SYB. KURE is the engine inside HERMIT, our Equational Rewrite Framework. Homepage: http://www.ittc.ku.edu/csdl/fpg/Tools/KURE Introductory blog post: http://www.ittc.ku.edu/csdlblog/?p=124 Examples -------- Some small examples of using KURE are provided in the source bundle. For a larger, non-trivial, example, see the description of its use in the HERMIT project: http://ittc.ku.edu/csdl/fpg/node/126 Acknowledgement --------------- This work was supported by funding from the NSF, for which we are grateful. Neil Sculthorpe

1 0

6th International School on Rewriting (ISR 2012) - Early registration (250 euro): June 15!!
by Santiago Escobar 08 Jun '12

08 Jun '12

Call for Participation ISR 2012 6th International School on Rewriting http://www.dsic.upv.es/~isr2012 July 16th - 20th, 2012 Universitat Politecnica de Valencia Valencia, Spain !!!!!Early registration until June 15, 2012!!!!! http://www.dsic.upv.es/~isr2012/registration.html Early registration fee: 250 euro Accommodation: between 20 and 28 euro per night Rewriting is a branch of computer science whose origins go back to the origins of computer science itself (with Thue, Church, Post, and many other prominent researchers). It has strong links with mathematics, algebra, and logic, and it is the basis of well-known programming paradigms like functional and equational programming, which are taught at the universitary level in many countries. In these programming paradigms and corresponding languages, the notions of reduction, pattern matching, confluence, termination, strategy, etc., are essential. Rewriting provides a solid framework for understanding, using, and teaching all these notions. Rewriting techniques are also used in many other areas of software engineering (scripting, prototyping, automated transformation of legacy systems, refactoring, web services, etc.) and are implemented in popular systems like Mathematica, Autocad, and others. Rewriting techniques play a relevant role in computing research, education, and industry. The International School on Rewriting is promoted by the IFIP Working Group 1.6 Term Rewriting. The school is aimed at master and PhD students, researchers, and practitioners interested in the study of rewriting concepts and their applications. Two tracks are offered, including the lectures and the courses: - Track A: for newcomers in the field, or just for people who want to obtain a new, updated exposure. * Jose Meseguer. Introduction to Term Rewriting * Albert Rubio. Termination of Rewriting: Foundations and Automation * Santiago Escobar. A Rewriting-Based Specification and Programming Language: Maude * Beatriz Alarcon & Raul Gutierrez. Exercises on Term Rewriting - Track B: for those who want to get deeper in the most recent developments and applications of rewriting. * Maria Alpuente: Narrowing Techniques and Applications * Temur Kutsia: Matching, unification, and generalizations * Pierre Lescanne: Lambda Calculus: extensions and applications * Narciso Marti-Oliet: Rewriting Logic and Applications * Georg Moser: Automated Complexity Analysis of Term Rewriting Systems * Albert Oliveras: SAT and SMT techniques in Proof and Verification * Sophie Tison: Tree Automata, Turing Machines and Term Rewriting * Xavier Urbain: Certification of Rewriting Properties * Andrei Voronkov: Automated Reasoning and Theorem Proving Registration fees: 250 euro (early registration, before June 15, 2012) 350 euro (late registration, after June 15, 2012) Visit our web site for more information about registration and accommodation. Registration is now open! For more information, please visit our web site or contact isr2012(a)dsic.upv.es Organizing Committee: Salvador Lucas (chair) Beatriz Alarcon Santiago Escobar Marco A. Feliu Raul Gutierrez Javier Insa Cabrera Sonia Santiago Alicia Villanueva

1 0