- Haskell - Haskell.org

LOLA 2012: Call for Talk Proposals (deadline extended)
by Amal Ahmed 14 Apr '12

14 Apr '12

*** Submission deadline extended to April 19th *** ============================================================ *** CALL FOR TALK PROPOSALS *** LOLA 2012 Syntax and Semantics of Low Level Languages Sunday 24th June 2012, Dubrovnik, Croatia A LICS 2012-affiliated workshop http://www.ccs.neu.edu/home/amal/lola2012 ============================================================ IMPORTANT DATES Submission deadline Thursday 19th April 2012 (extended) Author notification Monday 30th April 2012 Workshop Sunday 24th June 2012 SUBMISSION LINK The submissions will be made by easychair at https://www.easychair.org/conferences/?conf=lola2012 DESCRIPTION OF THE WORKSHOP It has been understood since the late 1960s that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high level programming languages, and to the development of reasoning principles for such languages. Yet low level languages, such as machine code, and the compilation of high level languages into a low level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of this past decade has been that low level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low level languages (such as heaps, registers and code pointers) and low level properties of programs (such as resource usage) goes hand in hand with the some of the most advanced contemporary researches in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and sublinear programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in many aspects of the relationship between logic and low level languages and programs. Topics of interest include, but are not limited to: Typed assembly languages, Certified assembly programming, Certified and certifying compilation, Proof-carrying code, Program optimization, Modal logic and realizability in machine code, Realizability and double orthogonality in assembly code, Parametricity, modules and existential types, General references, Kripke models and recursive types, Continuations and concurrency, Implicit complexity, sublinear programming and Turing machines, Closures and explicit substitutions, Linear logic and separation logic, Game semantics, abstract machines and hardware synthesis, Monoidal and premonoidal categories, traces and effects. SUBMISSION INFORMATION: LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants, welcoming proposals for talks on work in progress, overviews of larger programmes, position presentations and short tutorials as well as more traditional research talks describing new results. The programme committee will select the workshop presentations from submitted proposals, which may take the form either of a short abstract or of a longer (published or unpublished) paper describing completed work. PROGRAM CO-CHAIRS: Amal Ahmed (Northeastern University) Aleksandar Nanevski (IMDEA Software) PROGRAM COMMITTEE: Cristiano Calcagno (Imperial College London and Monoidics Limited) Robert Dockins (Princeton University) Martin Hofmann (LMU Munich) Xavier Leroy (INRIA Rocquencourt) Andrzej Murawski (University of Leicester) Sungwoo Park (Pohang University of Science and Technology) Dusko Pavlovic (Royal Holloway, University of London) Andreas Rossberg (Google)

1 0

ANNOUNCE: notcpp-0.0.1
by Ben Millwood 13 Apr '12

13 Apr '12

I'm pleased to announce my first genuinely original Hackage package: notcpp-0.0.1! http://hackage.haskell.org/package/notcpp This was inspired after someone submitted a patch to another of my packages, applicative-quoters, to improve behaviour on later GHC versions by using the new lookupValueName function where appropriate. The patch used CPP to determine if the package versions were such that lookupValueName would exist. But I never liked using CPP: it completely defeats haskell-src-exts and hence things like SourceGraph, and anyway it's not designed for Haskell and doesn't at all understand its structure, or fit with its syntax. With a little thought, I wondered if creative use of template haskell might not achieve the same goal. It turned out it did, and emboldened with this knowledge I set out to write a new package making this technique available to others. Along the way, a second technique occurred to me along the way that this could provide a hack fix for particularly nasty orphan instances; provide the class name, type, and method definitions, and my code detects if an instance exists. If so, it throws away your hard work and uses that; if not it synthesises (crudely, and probably inaccurately in some cases) an instance from your information and includes it in your code. One way or another, the instance will exist. I should emphasise that the way this is done is strange, and I have possibly hit a GHC bug or two, so I invite people to test, to -ddump-splices and make sure the package is behaving, and to let me know what they discover :) I'm off to fetch a GHC HEAD and see if it is any more co-operative. Ben Millwood (second attempt at sending this, since the first was from an address not subscribed the the list, whoops)

1 0

Last CfP: UNIF 2012 - 26th International Workshop on Unification
by Santiago Escobar 13 Apr '12

13 Apr '12

Call for Papers UNIF 2012 The 26th International Workshop on Unification http://unif2012.cs.man.ac.uk July 1st, 2012, Manchester, UK Satellite event of IJCAR 2012 UNIF 2012 is the 26th event in a series of international meetings devoted to unification theory and its applications. UNIF 2012 is a satellite event of the the 6th International Joint Conference on Automated Reasoning (IJCAR 2012) which is part of the Alan Turing Year 2012, and collocated with The Alan Turing Centenary Conference. Previous editions of UNIF have taken place mostly in Europe, but also in USA and Japan. For more details on previous UNIF workshops, please see the UNIF homepage at <http://www.pps.jussieu.fr/~treinen/unif/>. The aim of UNIF 2012, as that of the previous meetings, is to bring together researchers interested in unification theory and related topics, to present recent (even unfinished) work, and discuss new ideas and trends in this and related fields. This includes scientific presentations, but also descriptions of applications and software using unification as a strong component. A non-exhaustive list of topics of interest includes: unification algorithms, calculi and implementations, equational unification and unification modulo theories, unification in modal, temporal and description logics, admissibility of inference rules, narrowing, matching algorithms, constraint solving, combination problems, disunification, higher-order unification, type checking and reconstruction, typed unification, complexity issues, query answering, implementation techniques and applications of unification. Submissions and Publication: Before the workshop, authors are invited to submit an extended abstract (max. 5 pages) to be formatted in LNCS style through the EasyChair submission site: https://www.easychair.org/account/signin.cgi?conf=unif2012 Accepted abstracts will be presented at the workshop and included in the preliminary proceedings, available at the workshop. We envisage publication of a special issue of a journal dedicated to UNIF after the event. Important Dates: # Submission: April 27 # Notification: May 18 # Final version: June 1 # Workshop: July 1 Programme Committee: # Franz Baader, TU Dresden, Germany # Christoph Benzmueller, Free University Berlin, Germany # Santiago Escobar, Universitat Politecnica de Valencia, Spain (co-chair) # Maribel Fernandez, King's College London, UK # Silvio Ghilardi, Universita degli Studi di Milano, Italy # Rosalie Iemhoff, Utrecht University, The Netherlands # Konstantin Korovin, University of Manchester, UK (co-chair) # Jordi Levy, IIIA - CSIC, Spain # Christopher Lynch, Clarkson University, USA # George Metcalfe, Vanderbilt University, USA # Paliath Narendran, University at Albany, USA # Vladimir Rybakov, Manchester Metropolitan University, UK (co-chair) For more information, please contact any of the three chairs Santiago Escobar, Konstantin Korovin, Vladimir Rybakov

1 0

Haskell Weekly News: Issue 222
by Daniel Santa Cruz 12 Apr '12

12 Apr '12

Welcome to issue 222 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of April 1 to 7, 2012. Quotes of the Week * tgeeky_: "What I cannot create, I do not understand." -- Richard Feynman, on his blackboard when he died in 1988. * elliott: ... [a] is more of a control structure than a data structure. * Cale: Basically, we've known how to implement first class functions efficiently for 20 or 30 years now, and we've known about their importance to abstraction in programming since before the advent of electronic computers. There's no excuse to still be writing new programs in languages without them. * edwardk: When someone throws an exception at you, duck. * luite: I think it uses levenshtein distance (he invented this distance because nobody could spell his name correctly) * edwardk: 'hey ghc devs can you fix this thing that might or might not be a bug so we can break a huge pile of invariants in your compiler to put go faster stripes on something nobody uses? k thx' Top Reddit Stories * Tfoo, my simple Five in a Row game. Online, with server-sent events, deployed to Heroku, open source. Domain: tfoo.herokuapp.com, Score: 49, Comments: 18 On Reddit: [1] http://goo.gl/Klevh Original: [2] http://goo.gl/PtjKk * Interacting with inner-functions in GHCi [StackOverflow] Domain: stackoverflow.com, Score: 48, Comments: 12 On Reddit: [3] http://goo.gl/23l0G Original: [4] http://goo.gl/2H5kI * ANN: acme-http. 221,693.0 req/s on the PONG benchmark. Domain: groups.google.com, Score: 42, Comments: 4 On Reddit: [5] http://goo.gl/XROlu Original: [6] http://goo.gl/PuOt3 * Recent haskell-mode changes screencast Domain: youtube.com, Score: 39, Comments: 15 On Reddit: [7] http://goo.gl/JyX0s Original: [8] http://goo.gl/VWLIF * An Haskell tutorial. What do you think? Domain: yannesposito.com, Score: 39, Comments: 47 On Reddit: [9] http://goo.gl/eLiQT Original: [10] http://goo.gl/yBDnQ * Galois' Open-Source code available on github Domain: corp.galois.com, Score: 38, Comments: 3 On Reddit: [11] http://goo.gl/xoz4K Original: [12] http://goo.gl/OhlaA * Wadler’s Law Revisited Domain: comonad.com, Score: 27, Comments: 9 On Reddit: [13] http://goo.gl/8p9As Original: [14] http://goo.gl/7iB53 * With Linux supporting x32 ABI, should GHC follow suit? Domain: self.haskell, Score: 23, Comments: 6 On Reddit: [15] http://goo.gl/Nkuob Original: [16] http://goo.gl/Nkuob * cabal-meta: transcending to dependency heaven Domain: yesodweb.com, Score: 22, Comments: 27 On Reddit: [17] http://goo.gl/nsVhn Original: [18] http://goo.gl/U2cDK * [Haskell-cafe] A Modest Records Proposal Domain: haskell.org, Score: 21, Comments: 7 On Reddit: [19] http://goo.gl/MvbRq Original: [20] http://goo.gl/RgaRU Top StackOverflow Questions * What is the best way to test and interact with inner functions defined inside a toplevel function? votes: 44, answers: 1 Read on SO: [21] http://goo.gl/2H5kI * How can a Windows service application be written in Haskell? votes: 15, answers: 1 Read on SO: [22] http://goo.gl/kz8TA * What does ':..' mean in Haskell? votes: 12, answers: 2 Read on SO: [23] http://goo.gl/Whi8a * Is the whole Map copied when a new binding is inserted? votes: 10, answers: 3 Read on SO: [24] http://goo.gl/OabLu * Haskell functions left-to-right votes: 10, answers: 1 Read on SO: [25] http://goo.gl/rhCm3 * How can I avoid writing boilerplate code for functions performing pattern matching? votes: 9, answers: 3 Read on SO: [26] http://goo.gl/6cvXJ * Controlling how test data is generated in QuickCheck votes: 8, answers: 1 Read on SO: [27] http://goo.gl/BNSug * Can I get warnings about overly-restrictive type signatures? votes: 8, answers: 1 Read on SO: [28] http://goo.gl/X7PkN * Slowdown when using parallel strategies in Haskell votes: 8, answers: 1 Read on SO: [29] http://goo.gl/ghV3C * Dealing with boilerplate in Haskell votes: 7, answers: 2 Read on SO: [30] http://goo.gl/Um4Fm Until next time, Daniel Santa Cruz References 1. http://tfoo.herokuapp.com/ 2. http://www.reddit.com/r/haskell/comments/rx20z/tfoo_my_simple_five_in_a_row… 3. http://stackoverflow.com/questions/9987739/what-is-the-best-way-to-test-and… 4. http://www.reddit.com/r/haskell/comments/rr7se/interacting_with_innerfuncti… 5. https://groups.google.com/group/happs/browse_thread/thread/9b078d23b59a7374 6. http://www.reddit.com/r/haskell/comments/ro77b/ann_acmehttp_2216930_reqs_on… 7. http://www.youtube.com/watch?v=E6xIjl06Lr4 8. http://www.reddit.com/r/haskell/comments/rtctu/recent_haskellmode_changes_s… 9. http://yannesposito.com/Scratch/en/blog/Haskell-the-Hard-Way/ 10. http://www.reddit.com/r/haskell/comments/rw61r/an_haskell_tutorial_what_do_… 11. http://corp.galois.com/blog/2012/4/4/galois-open-source-projects-on-github.… 12. http://www.reddit.com/r/haskell/comments/rt8m3/galois_opensource_code_avail… 13. http://comonad.com/reader/2012/wadlers-law-revisited/ 14. http://www.reddit.com/r/haskell/comments/rpyhr/wadlers_law_revisited/ 15. http://www.reddit.com/r/haskell/comments/rpbcx/with_linux_supporting_x32_ab… 16. http://www.reddit.com/r/haskell/comments/rpbcx/with_linux_supporting_x32_ab… 17. http://www.yesodweb.com/blog/2012/04/cabal-meta 18. http://www.reddit.com/r/haskell/comments/rurn4/cabalmeta_transcending_to_de… 19. http://www.haskell.org/pipermail/haskell-cafe/2012-April/100527.html 20. http://www.reddit.com/r/haskell/comments/rnwgn/haskellcafe_a_modest_records… 21. http://stackoverflow.com/questions/9987739/what-is-the-best-way-to-test-and… 22. http://stackoverflow.com/questions/10037654/how-can-a-windows-service-appli… 23. http://stackoverflow.com/questions/9996740/what-does-mean-in-haskell 24. http://stackoverflow.com/questions/10002956/is-the-whole-map-copied-when-a-… 25. http://stackoverflow.com/questions/10003796/haskell-functions-left-to-right 26. http://stackoverflow.com/questions/10024455/how-can-i-avoid-writing-boilerp… 27. http://stackoverflow.com/questions/9977734/controlling-how-test-data-is-gen… 28. http://stackoverflow.com/questions/9986508/can-i-get-warnings-about-overly-… 29. http://stackoverflow.com/questions/10009361/slowdown-when-using-parallel-st… 30. http://stackoverflow.com/questions/9969638/dealing-with-boilerplate-in-hask…

1 0

LOLA 2012: Final Call for Talk Proposals
by Amal Ahmed 11 Apr '12

11 Apr '12

============================================================ *** FINAL CALL FOR TALK PROPOSALS *** LOLA 2012 Syntax and Semantics of Low Level Languages Sunday 24th June 2012, Dubrovnik, Croatia A LICS 2012-affiliated workshop http://www.ccs.neu.edu/home/amal/lola2012 ============================================================ IMPORTANT DATES Submission deadline Friday 13th April 2012 Author notification Monday 30th April 2012 Workshop Sunday 24th June 2012 SUBMISSION LINK The submissions will be made by easychair at https://www.easychair.org/conferences/?conf=lola2012 DESCRIPTION OF THE WORKSHOP It has been understood since the late 1960s that tools and structures arising in mathematical logic and proof theory can usefully be applied to the design of high level programming languages, and to the development of reasoning principles for such languages. Yet low level languages, such as machine code, and the compilation of high level languages into a low level ones have traditionally been seen as having little or no essential connection to logic. However, a fundamental discovery of this past decade has been that low level languages are also governed by logical principles. From this key observation has emerged an active and fascinating new research area at the frontier of logic and computer science. The practically-motivated design of logics reflecting the structure of low level languages (such as heaps, registers and code pointers) and low level properties of programs (such as resource usage) goes hand in hand with the some of the most advanced contemporary researches in semantics and proof theory, including classical realizability and forcing, double orthogonality, parametricity, linear logic, game semantics, uniformity, categorical semantics, explicit substitutions, abstract machines, implicit complexity and sublinear programming. The LOLA workshop, affiliated with LICS, will bring together researchers interested in many aspects of the relationship between logic and low level languages and programs. Topics of interest include, but are not limited to: Typed assembly languages, Certified assembly programming, Certified and certifying compilation, Proof-carrying code, Program optimization, Modal logic and realizability in machine code, Realizability and double orthogonality in assembly code, Parametricity, modules and existential types, General references, Kripke models and recursive types, Continuations and concurrency, Implicit complexity, sublinear programming and Turing machines, Closures and explicit substitutions, Linear logic and separation logic, Game semantics, abstract machines and hardware synthesis, Monoidal and premonoidal categories, traces and effects. SUBMISSION INFORMATION: LOLA is an informal workshop aiming at a high degree of useful interaction amongst the participants, welcoming proposals for talks on work in progress, overviews of larger programmes, position presentations and short tutorials as well as more traditional research talks describing new results. The programme committee will select the workshop presentations from submitted proposals, which may take the form either of a short abstract or of a longer (published or unpublished) paper describing completed work. PROGRAM CO-CHAIRS: Amal Ahmed (Northeastern University) Aleksandar Nanevski (IMDEA Software) PROGRAM COMMITTEE: Cristiano Calcagno (Imperial College London and Monoidics Limited) Robert Dockins (Princeton University) Martin Hofmann (LMU Munich) Xavier Leroy (INRIA Rocquencourt) Andrzej Murawski (University of Leicester) Sungwoo Park (Pohang University of Science and Technology) Dusko Pavlovic (Royal Holloway, University of London) Andreas Rossberg (Google)

1 0

2nd Call for papers: LOPSTR 2012
by Jon Sneyers 11 Apr '12

11 Apr '12

============================================================ Call for papers 22nd International Symposium on Logic-Based Program Synthesis and Transformation LOPSTR 2012 http://costa.ls.fi.upm.es/lopstr12 Leuven, Belgium, September 18-20, 2012 (co-located with PPDP 2012) ============================================================ The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in logic-based program development in any language paradigm. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. The 22nd International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2012) will be held in Leuven, Belgium; previous symposia were held in Hagenberg, Coimbra, Valencia, Lyngby, Venice, London, Verona, Uppsala, Madrid, Paphos, London, Venice, Manchester, Leuven, Stockholm, Arnhem, Pisa, Louvain-la-Neuve, Manchester and Odense (you might have a look at the contents of past LOPSTR symposia). LOPSTR 2012 will be co-located with PPDP 2012 (International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming). Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large. Both full papers and extended abstracts describing applications in these areas are especially welcome. Contributions are welcome on all aspects of logic-based program development, including, but not limited to: * specification * verification * analysis * specialization * composition * certification * transformational techniques in SE * synthesis * transformation * optimisation * inversion * program/model manipulation * security * applications and tools Survey papers, that present some aspect of the above topics from a new perspective, and application papers, that describe experience with industrial applications, are also welcome. Papers must describe original work, be written and presented in English, and must not substantially overlap with papers that have been published or that are simultaneously submitted to a journal, conference, or workshop with refereed proceedings. Work that already appeared in unpublished or informally published workshop proceedings may be submitted (please contact the PC chair in case of questions). Proceedings The formal post-conference proceedings will be published by Springer in the Lecture Notes in Computer Science series. Important Dates Abstract submission: May 21,2012 Paper submission: May 25, 2012 Notification (for pre-proceedings): June 29, 2012 Camera-ready (for pre-proceedings): July 8, 2012 Symposium: September 18-20, 2012 Submissions must be formatted in the Lecture Notes in Computer Science style. They cannot exceed 15 pages including references but excluding well-marked appendices not intended for publication. Referees are not required to read the appendices, and thus papers should be intelligible without them. Full papers can be directly accepted for publication in the formal proceedings to be published by Springer in the LNCS series or accepted only for presentation at the symposium. After the symposium, all authors of extended abstracts and full papers accepted only for presentation will be invited to revise and/or extend their submissions in the light of the feedback solicited at the symposium. Then, after another round of reviewing, these revised papers may also be published in the formal proceedings. Authors should submit an electronic copy of the paper (written in English) in PDF or Postscript (Level 2). Each submission must include on its first page the paper title; authors and their affiliations; contact author's email; abstract; and three to four keywords. The keywords will be used to assist us in selecting appropriate reviewers for the paper. If electronic submission is impossible, please contact the program chair for information on how to submit hard copies. Papers should be submitted to the submission website for LOPSTR 2012. Invited speakers: - Tom Schrijvers, University of Ghent, Belgium - Jürgen Giesl, RWTH Aachen, Germany (shared with PPDP) Program Committee: Elvira Albert Complutense University of Madrid, Spain Sergio Antoy Portland State University, US Demis Ballis University of Udine, Italy Henning Christiansen Roskilde University, Denmark Michael Codish Ben-Gurion University of the Negev, Israel Danny De Schreye K.U.Leuven, Belgium Esra Erdem Sabanci University, Istanbul Maribel Fernandez King's College London, UK John Gallagher Roskilde University, Denmark Robert Glück University of Copenhagen, Denmark Miguel Gomez-Zamalloa Complutense University of Madrid, Spain Rémy Haemmerlé Technical University of Madrid, Spain Reiner Hähnle TU Darmstadt, Germany Geoff Hamilton Dublin City University, Ireland Carsten Fuhs University College London, UK Gerda Janssens K.U.Leuven, Belgium Isabella Mastroeni University of Verona, Italy Kazutaka Matsuda University of Tokyo, Japan Paulo Moura Universidade da Beira Interior, Portugal Johan Nordlander Luleå University of Technology, Sweden Andrey Rybalchenko Technische Universität München, Germany Kostis Sagonas Uppsala University, Sweden Francesca Scozzari Università "G. D'Annunzio" di Chieti, Italy Valerio Senni Universtà di Roma "Tor Vergata", Italy German Vidal Technical University of Valencia, Spain Program Chair: Elvira Albert Department of Computer Science (DSIC) Complutense University of Madrid Madrid, Spain General Co-Chairs Daniel De Schreye and Gerda Janssens Department of Computer Science K.U.Leuven, Celestijnenlaan 200 A, B-3001 Heverlee, Belgium

1 0

Call for Participation: Tests and Proofs (TAP 2012) in Prague
by Achim D. Brucker 10 Apr '12

10 Apr '12

Apologies for duplicates. ======================================================================== CALL FOR PARTICIPATION TESTS and PROOFS 2012 (TOOLS EUROPE 2012) 6th International Conference on Tests & Proofs May 31 - June 1, 2012, Prague, Czech Republic http://lifc.univ-fcomte.fr/tap2012/ Co-located with: ICMT 2012, SC 2012, MSEPT 2012 as part of TOOLS 2012: http://toolseurope2012.fit.cvut.cz/ ======================================================================== The TAP conference is devoted to the convergence of proofs and tests. It combines ideas from both sides for the advancement of software quality. Keynote Speakers ================ * Andreas Kuehlmann <http://www.eecs.berkeley.edu/%7Ekuehl/>, Coverity The Technology and Psychology of Testing Your Code as You Develop It (abstract <http://lifc.univ-fcomte.fr/tap2012/abstract_talk_Kuehlmann.pdf>) * Corina Pasareanu <http://ti.arc.nasa.gov/profile/pcorina/>, NASA Ames Research Center Combining Model Checking and Symbolic Execution for Software Testing (abstract <http://lifc.univ-fcomte.fr/tap2012/abstract_talk_Pasareanu.pdf>) * Mehdi Jazayeri, University of Lugano. Software Composition: Why, what, and how Registration: ============= Early registration, at a reduced price, will be open until 25 April 2012. http://toolseurope2012.fit.cvut.cz/index.php/registration.html Organization: ============= Conference Chair Bertrand Meyer, ETH Zurich, Eiffel Software, and ITMO Program Chairs Achim D. Brucker, SAP Research, Germany Jacques Julliand, University of Franche-Comté Local Organization Pavel Tvrdik, CTU Prague Michal Valenta, CTU Prague Jindra Vojikova, CTU Prague Jan Chrastina, CTU Prague Program: ======== Thursday 31th May, 09:00-10:30: Invited Talk * Andreas Kuehlmann, Coverity: The Technology and Psychology of Testing Your Code as You Develop It Thursday, 11:00-13:00: Paper session Model-Based Testing * Malte Lochau, Ina Schaefer, Jochen Kamischke and Sascha Lity. Incremental Model-based Testing of Delta-oriented Software Product Lines * Hernan Ponce De Leon, Stefan Haar and Delphine Longuet. Conformance Relations for Labeled Event Structures * Joseph Kiniry, Daniel M. Zimmerman and Ralph Hyland. Testing Library Specifications by Verifying Conformance Tests * Chedor Sebastien, Thierry J?ron and Morvan Christophe. Test generation from recursive tiles systems Thursday, 14:30-15:30: Paper session Scenario and UML-Based Testing * Nadia Creignou, Uwe Egly and Martina Seidl. A Framework for the Specification of Random SAT and QSAT Formulas * Jens Brüning, Martin Gogolla, Lars Hamann and Mirco Kuhlmann. Evaluating and Debugging OCL Expressions in UML Models * Uwe Egly, Sebastian Gabmeyer, Martina Seidl, Hans Tompits, .... Towards Scenario-Based Testing of UML Diagrams Thursday, 16:00-17:00: Tutorial * Nikolay Kosmatov, Nicky Williams. Automated Structural Testing with PathCrawler Friday 1st June, 09:00-10:30: Invited Talk of SC * Mehdi Jazayeri, University of Lugano. Software Composition: Why, what, and how Friday 11:00-13:00: Invited Talk of TAP * Corina Pasareanu. NASA. Combining Model Checking and Symbolic Execution for Software Testing Friday, 14:30-15:30: Paper session Test and Model-checking * Martin Sulzmann and Axel Zechner Constructive Finite Trace Analysis with Linear Temporal Logic * Alessandro Armando, Roberto Carbone, Giancarlo Pellegrino, Alessio Merlo and Davide Balzarotti. From Model-checking to Automated Testing of Security Protocols: Bridging the Gap Friday, 16:00-17:30: Paper session Test of Complex Data Structures * Valerio Senni and Fabio Fioravanti. Generation of test data structures using Constraint Logic Programming * Valeria Bengolea, Nazareno Aguirre, Darko Marinov and Marcelo Frias. Coverage Criteria on RepOK to Reduce Bounded Exhaustive Test Suites * Matthieu Carlier, Catherine Dubois and Arnaud Gotlieb. A first step in the design of a formally verified constraint-based testing tool: FocalTest -- Dr. Achim D. Brucker, SAP Research, Vincenz-Priessnitz-Str. 1, D-76131 Karlsruhe Phone: +49 6227 7-52595, http://www.brucker.ch

1 0

ANN: plugins-1.5.2.1
by Jeremy Shaw 09 Apr '12

09 Apr '12

Hello! I am pleased to announce the release of plugins-1.5.2.1: http://hackage.haskell.org/package/plugins The plugins library provides facilities to compile and dynamically load/link Haskell code into a running Haskell application. (The related, plugins-auto package adds support for file watching via inontify and automatic recompilation and reloading, http://hackage.haskell.org/package/plugins) There are three important changes in this release: 1. Support for GHC 7.0, 7.2. and 7.4. We have not *knowingly* dropped support for GHC 6.12. So, if you still use an older compiler and we broke it.. we might be willing to fix it still :) 2. New maintainer: Don Stewart has graciously allowed me to take over the project. I do not have any immediate plans for big changes. But I do plan to: keep it compiling, apply patches in a timely manner, and deal with other minor bug fixes. I would certainly love to see some major improvements. I believe plugins predates the GHC API and, accordingly, does not use it as well as it could. If someone wanted to give plugins some major love, that would be awesome. While plugins has not much recent development, there are still a lot of people that are using it, or would like to. 3. the source has moved to patch-tag and darcs 2, http://patch-tag.com/r/stepcut/plugins patch-tag only supports darcs 2 format repositories, so this forced me to run darcs convert to switch from darcs 1 to darcs 2 format. In the end that is a good thing. The only downside is that I can not directly apply any darcs 1 patches to the repo now. But I doubt there are many floating around anyway. And I can still apply them the hard way. - jeremy

1 1

Haskell Weekly News: Issue 221
by Daniel Santa Cruz 05 Apr '12

05 Apr '12

Welcome to issue 221 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of March 25 to 31, 2012. Quotes of the Week * Tekmo: Now I have a monoid in the category of problems. * hpc: atomically the whole thing * BMeph (in "announcer voice"): In a world, where orphan instances collide, one language holds the key to successful compilation, in our time. * thoughtpolice: if there is a question, edwardk probably has the answer * danharaj: All I have to do is remove me from the program and it works. * anonymous: Caveat implementor. * ski: 'getLine :: IO String' is a recipe for how to interact with the world to acquire a `String' ski: the recipe is not the cake Top Reddit Stories * My Thesis is Finally Complete! "Elm: Concurrent FRP for functional GUIs" Domain: self.haskell, Score: 74, Comments: 31 On Reddit: [1] http://goo.gl/yw2P9 Original: [2] http://goo.gl/yw2P9 * ANNOUNCE: Happstack 7! (Haskell Web Framework) Domain: happstack.com, Score: 51, Comments: 26 On Reddit: [3] http://goo.gl/kwcc7 Original: [4] http://goo.gl/wBBsu * pipes-like conduit Domain: yesodweb.com, Score: 49, Comments: 84 On Reddit: [5] http://goo.gl/nu4Tl Original: [6] http://goo.gl/hWaCj * SIMD Support for the vector library Domain: ghc-simd.blogspot.co.uk, Score: 45, Comments: 6 On Reddit: [7] http://goo.gl/m0PI8 Original: [8] http://goo.gl/NDq2j * Replacing Cabal Domain: yesodweb.com, Score: 40, Comments: 7 On Reddit: [9] http://goo.gl/ulv2o Original: [10] http://goo.gl/86NLW * Summarizing the conduit questions Domain: yesodweb.com, Score: 33, Comments: 13 On Reddit: [11] http://goo.gl/lkLgF Original: [12] http://goo.gl/uK25n * I love `RWST r w s (IO a) ` to ease the transition from imperative programming. Am I cheating? Domain: self.haskell, Score: 31, Comments: 53 On Reddit: [13] http://goo.gl/xq2Jn Original: [14] http://goo.gl/xq2Jn * FRP - Three principles for bidirectional GUI elements Domain: apfelmus.nfshost.com, Score: 30, Comments: 11 On Reddit: [15] http://goo.gl/AFbXE Original: [16] http://goo.gl/xd4Yf * haskell-src-exts-1.12.0: supports the new quasi-quoter syntax Domain: haskell.org, Score: 28, Comments: 6 On Reddit: [17] http://goo.gl/u6ZDx Original: [18] http://goo.gl/XTzJO * Why GADTs are awesome: implementing System F using HOAS Domain: github.com, Score: 25, Comments: 7 On Reddit: [19] http://goo.gl/IG14P Original: [20] http://goo.gl/62iLX * Reactive-banana: new major release Domain: apfelmus.nfshost.com, Score: 24, Comments: 3 On Reddit: [21] http://goo.gl/XYXvm Original: [22] http://goo.gl/u3PAz Top StackOverflow Questions * Does Haskell require a garbage collector? votes: 40, answers: 7 Read on SO: [23] http://goo.gl/hDNT4 * Can you recognize an infinite list in a Haskell program? [closed] votes: 20, answers: 5 Read on SO: [24] http://goo.gl/TcJHt * Confusion regarding a passage in the “Kinds and some type-foo” section of learnyouahaskell.com votes: 12, answers: 1 Read on SO: [25] http://goo.gl/ldKbM * Haskell: Correct practice to specify version in source? votes: 7, answers: 2 Read on SO: [26] http://goo.gl/eUr6X * How to count the number of times a fuction was called, the FP way votes: 7, answers: 2 Read on SO: [27] http://goo.gl/OLNxy * how to translate Haskell into Scalaz? votes: 7, answers: 2 Read on SO: [28] http://goo.gl/1ep62 * In which languages is function abstraction not primitive votes: 7, answers: 7 Read on SO: [29] http://goo.gl/aZG5w * Is it possible to debug pattern matching in a Haskell function? votes: 6, answers: 3 Read on SO: [30] http://goo.gl/qIpDw * Generate cabal file with dependencies on foreign libs votes: 5, answers: 2 Read on SO: [31] http://goo.gl/mRz1o * Is there a monadic version of Arbitrary to use with QuickCheck? votes: 5, answers: 2 Read on SO: [32] http://goo.gl/1IOg4 Until next time, Daniel Santa Cruz References 1. http://www.reddit.com/r/haskell/comments/rkyoa/my_thesis_is_finally_complet… 2. http://www.reddit.com/r/haskell/comments/rkyoa/my_thesis_is_finally_complet… 3. http://www.happstack.com/C/ViewPage/1 4. http://www.reddit.com/r/haskell/comments/rjtwt/announce_happstack_7_haskell… 5. http://www.yesodweb.com/blog/2012/03/pipes-like-conduit 6. http://www.reddit.com/r/haskell/comments/reft1/pipeslike_conduit/ 7. http://ghc-simd.blogspot.co.uk/2012/03/simd-support-for-vector-library.html 8. http://www.reddit.com/r/haskell/comments/reyn9/simd_support_for_the_vector_… 9. http://www.yesodweb.com/blog/2012/04/replacing-cabal 10. http://www.reddit.com/r/haskell/comments/rnd2b/replacing_cabal/ 11. http://www.yesodweb.com/blog/2012/03/summarizing-conduit-questions 12. http://www.reddit.com/r/haskell/comments/rhs0y/summarizing_the_conduit_ques… 13. http://www.reddit.com/r/haskell/comments/rd2t5/i_love_rwst_r_w_s_io_a_to_ea… 14. http://www.reddit.com/r/haskell/comments/rd2t5/i_love_rwst_r_w_s_io_a_to_ea… 15. http://apfelmus.nfshost.com/blog/2012/03/29-frp-three-principles-bidirectio… 16. http://www.reddit.com/r/haskell/comments/rj4l1/frp_three_principles_for_bid… 17. http://www.haskell.org/pipermail/haskell-cafe/2012-March/100421.html 18. http://www.reddit.com/r/haskell/comments/rfn3g/haskellsrcexts1120_supports_… 19. https://github.com/DanBurton/Blog/blob/master/Literate%20Haskell/SystemF.lhs 20. http://www.reddit.com/r/haskell/comments/rk0uf/why_gadts_are_awesome_implem… 21. http://apfelmus.nfshost.com/blog/2012/03/25-frp-banana-0-5.html 22. http://www.reddit.com/r/haskell/comments/rd35t/reactivebanana_new_major_rel… 23. http://stackoverflow.com/questions/9952602/does-haskell-require-a-garbage-c… 24. http://stackoverflow.com/questions/9889347/can-you-recognize-an-infinite-li… 25. http://stackoverflow.com/questions/9892814/confusion-regarding-a-passage-in… 26. http://stackoverflow.com/questions/9857710/haskell-correct-practice-to-spec… 27. http://stackoverflow.com/questions/9920129/how-to-count-the-number-of-times… 28. http://stackoverflow.com/questions/9941199/how-to-translate-haskell-into-sc… 29. http://stackoverflow.com/questions/9944159/in-which-languages-is-function-a… 30. http://stackoverflow.com/questions/9949494/is-it-possible-to-debug-pattern-… 31. http://stackoverflow.com/questions/9857597/generate-cabal-file-with-depende… 32. http://stackoverflow.com/questions/9863451/is-there-a-monadic-version-of-ar…

1 0

Call for Contributions - Haskell Communities and Activities Report, May 2012 edition
by Janis Voigtländer 04 Apr '12

04 Apr '12

Dear all, I would like to collect contributions for the 22nd edition of the ================================================================ Haskell Communities & Activities Report http://www.haskell.org/haskellwiki/Haskell_Communities_and_Activities_Report Submission deadline: 1 May 2012 (please send your contributions to hcar at haskell.org, in plain text or LaTeX format) ================================================================ This is the short story: * If you are working on any project that is in some way related to Haskell, please write a short entry and submit it. Even if the project is very small or unfinished or you think it is not important enough --- please reconsider and submit an entry anyway! * If you are interested in an existing project related to Haskell that has not previously been mentioned in the HCAR, please tell me, so that I can contact the project leaders and ask them to submit an entry. * Feel free to pass on this call for contributions to others that might be interested. More detailed information: The Haskell Communities & Activities Report is a bi-annual overview of the state of Haskell as well as Haskell-related projects over the last, and possibly the upcoming six months. If you have only recently been exposed to Haskell, it might be a good idea to browse the November 2011 edition --- you will find interesting topics described as well as several starting points and links that may provide answers to many questions. Contributions will be collected until the submission deadline. They will then be compiled into a coherent report that is published online as soon as it is ready. As always, this is a great opportunity to update your webpages, make new releases, announce or even start new projects, or to talk about developments you want every Haskeller to know about! Looking forward to your contributions, Janis (current editor) FAQ: Q: What format should I write in? A: The required format is a LaTeX source file, adhering to the template that is available at: http://haskell.org/communities/05-2012/template.tex There is also a LaTeX style file at http://haskell.org/communities/05-2012/hcar.sty that you can use to preview your entry. If you do not know LaTeX, then use plain text. If you modify an old entry that you have written for an earlier edition of the report, you should already have received your old entry as a template (provided I have your valid email address). Please modify that template, rather than using your own version of the old entry as a template. Q: Can I include Haskell code? A: Yes. Please consider using lhs2tex syntax (http://people.cs.uu.nl/andres/lhs2tex/) The report is compiled in mode polycode.fmt. Q: Can I include images? A: Yes, you are even encouraged to do so. Please use .jpg format, then. Q: Should I send files in .zip archives or similar? A: No, plain file attachements are the way. Q: How much should I write? A: Authors are asked to limit entries to about one column of text. This corresponds to approximately one page, or 40 lines of text, with the above style and template. A general introduction is helpful. Apart from that, you should focus on recent or upcoming developments. Pointers to online content can be given for more comprehensive or "historic" overviews of a project. Images do not count towards the length limit, so you may want to use this opportunity to pep up entries. There is no minimum length of an entry! The report aims for being as complete as possible, so please consider writing an entry, even if it is only a few lines long. Q: Which topics are relevant? A: All topics which are related to Haskell in some way are relevant. We usually had reports from users of Haskell (private, academic, or commercial), from authors or contributors to projects related to Haskell, from people working on the Haskell language, libraries, on language extensions or variants. We also like reports about distributions of Haskell software, Haskell infrastructure, books and tutorials on Haskell. Reports on past and upcoming events related to Haskell are also relevant. Finally, there might be new topics we do not even think about. As a rule of thumb: if in doubt, then it probably is relevant and has a place in the HCAR. You can also ask the editor. Q: Is unfinished work relevant? Are ideas for projects relevant? A: Yes! You can use the HCAR to talk about projects you are currently working on. You can use it to look for other developers that might help you. You can use it to write "wishlist" items for libraries and language features you would like to see implemented. Q: If I do not update my entry, but want to keep it in the report, what should I do? A: Tell the editor that there are no changes. The old entry will typically be reused in this case, but it might be dropped if it is older than a year, to give more room and more attention to projects that change a lot. Do not resend complete entries if you have not changed them. Q: Will I get confirmation if I send an entry? How do I know whether my email has even reached the editor, and not ended up in a spam folder? A: Prior to publication of the final report, the editor will send a draft to all contributors, for possible corrections. So if you do not hear from the editor within three weeks after the deadline, it is safer to send another mail and check whether your first one was received.

1 0