May 2012 - Haskell - Haskell.org

Final CFP: Workshop on Generic Programming (WGP) 2012
by Andres Löh 28 May '12

28 May '12

The deadline is on Friday! Cheers, Andres

1 0

Lectureship in Functional Programming at St Andrews
by Kevin Hammond 25 May '12

25 May '12

We have a vacancy in functional programming at St Andrews, supporting the existing research team and engaging with other groups in the School. The deadline is June 22nd. Please forward to any of your colleagues who may be good candidates and/or point me at anyone who you think may be a good candidate! https://www.vacancies.st-andrews.ac.uk//ViewVacancy.aspx?enc=mEgrBL4XQK0+ld… Best Wishes, Kevin -------- Kevin Hammond, Professor of Computer Science, University of St Andrews T: +44-1334 463241 F: +44-1334-463278 W: http://www.cs.st-andrews.ac.uk/~kh In accordance with University policy on electronic mail, this email reflects the opinions of the individual concerned, may contain confidential or copyright information that should not be copied or distributed without permission, may be of a private or personal nature unless explicitly indicated otherwise, and should not under any circumstances be taken as an official statement of University policy or procedure (see http://www.st-and.ac.uk) The University of St Andrews is a charity registered in Scotland : No SC013532

1 0

Haskell Weekly News: Issue 228
by Daniel Santa Cruz 24 May '12

24 May '12

Welcome to issue 228 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of May 13 to 19, 2012. Announcements Stefan Wehr issued a call for presentations for the Commercial Users of Functional Programmers (CUFP 2012) conference to be held in Copenhagen, Denmark during September 13 to 15, 2012. [1] http://goo.gl/Rl1T9 Quotes of the Week * hpc measures understanding in angstroms per (second * liter) ^ (1/15) Top Reddit Stories * ANNOUNCE: forthcoming O'Reilly book on Parallel and Concurrent Haskell Domain: haskell.org, Score: 101, Comments: 13 On Reddit: [2] http://goo.gl/UY9L6 Original: [3] http://goo.gl/oqLo6 * GHC 7.6 will have support for deferred type errors Domain: hackage.haskell.org, Score: 55, Comments: 4 On Reddit: [4] http://goo.gl/sPknX Original: [5] http://goo.gl/ieM9s * What happens when you mix three research programming languages together Domain: blog.ezyang.com, Score: 41, Comments: 7 On Reddit: [6] http://goo.gl/ujmF1 Original: [7] http://goo.gl/jME65 * Reactive-Banana 0.6: FRP in Haskell, supports both WxHaskell and generation to Javascript! Domain: apfelmus.nfshost.com, Score: 39, Comments: 3 On Reddit: [8] http://goo.gl/XrFxl Original: [9] http://goo.gl/Uanl6 * Keter: It's Alive! (Web app deployment system for Haskell) Domain: yesodweb.com, Score: 35, Comments: 6 On Reddit: [10] http://goo.gl/RyuLI Original: [11] http://goo.gl/EVcDT * Reasoning about Stream Processing with Effects Domain: personal.cis.strath.ac.uk, Score: 26, Comments: 26 On Reddit: [12] http://goo.gl/TI8bj Original: [13] http://goo.gl/n2rS0 * Patches for the new GHC-iPhone (v4) builds but needs a little more debugging Domain: hip-to-be-square.com, Score: 26, Comments: 27 On Reddit: [14] http://goo.gl/7QvqK Original: [15] http://goo.gl/zLCzr * Commutative Edits and Exceptions -- Categorically Dual(ish)? Domain: bosker.wordpress.com, Score: 24, Comments: 2 On Reddit: [16] http://goo.gl/1quI5 Original: [17] http://goo.gl/ET2ym * Parallel Haskell Digest 10: SPJ on Cloud Haskell, concurrent channels, meta-par, Accelerate, and StackOverflow'ing like crazy Domain: well-typed.com, Score: 21, Comments: 3 On Reddit: [18] http://goo.gl/z1UiV Original: [19] http://goo.gl/iPiAx * Interactive Programming with LambdaCalc Domain: dynamicaspects.org, Score: 20, Comments: 6 On Reddit: [20] http://goo.gl/IeEis Original: [21] http://goo.gl/n3Bqo * BitParser - RFC on a new parsing library for parsing data at the bit level. Similar in functionality to Erlang's bit syntax Domain: github.com, Score: 18, Comments: 8 On Reddit: [22] http://goo.gl/a7Qmq Original: [23] http://goo.gl/SL1u4 Top StackOverflow Questions * Haskell: Between a list and a tuple votes: 10, answers: 3 Read on SO: [24] http://goo.gl/6eiPg * Why is it so uncommon to use type signatures in where clauses? votes: 9, answers: 4 Read on SO: [25] http://goo.gl/ih3cK * Is there any good Haskell indentation script for Vim? votes: 9, answers: 2 Read on SO: [26] http://goo.gl/t1D3Y * Haskell “exceptions” votes: 8, answers: 2 Read on SO: [27] http://goo.gl/5WfTT * Is it possible to program and check invariants in haskell? votes: 8, answers: 3 Read on SO: [28] http://goo.gl/5wNE6 * The “handle” function and Real World Haskell votes: 7, answers: 2 Read on SO: [29] http://goo.gl/K8WK0 * Haskell: Flatten binary tree votes: 7, answers: 2 Read on SO: [30] http://goo.gl/eSokk * How can I uninstall a version of a Cabal package? votes: 6, answers: 1 Read on SO: [31] http://goo.gl/Gl1Mi * Fault tolerant JSON parsing votes: 6, answers: 1 Read on SO: [32] http://goo.gl/NBsVH * Can a Haskell or Haskell OS thread waiting on Network.Socket.accept not be killed on Windows? votes: 6, answers: 1 Read on SO: [33] http://goo.gl/8NHKB * efficient functional data structure for finite bijections votes: 6, answers: 2 Read on SO: [34] http://goo.gl/bXA1Ke Until next time, Daniel Santa Cruz References 1. http://permalink.gmane.org/gmane.comp.lang.haskell.general/19157 2. http://www.haskell.org/pipermail/haskell/2012-May/023328.html 3. http://www.reddit.com/r/haskell/comments/trf72/announce_forthcoming_oreilly… 4. http://hackage.haskell.org/trac/ghc/wiki/Status/May12 5. http://www.reddit.com/r/haskell/comments/tm1mc/ghc_76_will_have_support_for… 6. http://blog.ezyang.com/2012/05/what-happens-when-you-mix-three-research-pro… 7. http://www.reddit.com/r/haskell/comments/tptuo/what_happens_when_you_mix_th… 8. http://apfelmus.nfshost.com/blog/2012/05/15-frp-banana-0-6.html 9. http://www.reddit.com/r/haskell/comments/toghk/reactivebanana_06_frp_in_has… 10. http://www.yesodweb.com/blog/2012/05/keter-its-alive 11. http://www.reddit.com/r/haskell/comments/tsyv5/keter_its_alive_web_app_depl… 12. https://personal.cis.strath.ac.uk/~raa/posts/2012-01-06-streams.html 13. http://www.reddit.com/r/haskell/comments/tm7ur/reasoning_about_stream_proce… 14. http://hip-to-be-square.com/~blackh/ghc-iphone-new/v4/ 15. http://www.reddit.com/r/haskell/comments/tnnqc/patches_for_the_new_ghciphon… 16. http://bosker.wordpress.com/2012/05/10/on-editing-text/ 17. http://www.reddit.com/r/haskell/comments/ts3sz/commutative_edits_and_except… 18. http://www.well-typed.com/blog/66 19. http://www.reddit.com/r/haskell/comments/tta8y/parallel_haskell_digest_10_s… 20. http://dynamicaspects.org/blog/2012/05/15/back-to-the-future/ 21. http://www.reddit.com/r/haskell/comments/tokmh/interactive_programming_with… 22. https://github.com/axman6/BitParser/tree/bs-state 23. http://www.reddit.com/r/haskell/comments/tmhca/bitparser_rfc_on_a_new_parsi… 24. http://stackoverflow.com/questions/10626943/haskell-between-a-list-and-a-tu… 25. http://stackoverflow.com/questions/10609936/why-is-it-so-uncommon-to-use-ty… 26. http://stackoverflow.com/questions/10663888/is-there-any-good-haskell-inden… 27. http://stackoverflow.com/questions/10611382/haskell-exceptions 28. http://stackoverflow.com/questions/10656402/is-it-possible-to-program-and-c… 29. http://stackoverflow.com/questions/10578572/the-handle-function-and-real-wo… 30. http://stackoverflow.com/questions/10592920/haskell-flatten-binary-tree 31. http://stackoverflow.com/questions/10576868/how-can-i-uninstall-a-version-o… 32. http://stackoverflow.com/questions/10604808/fault-tolerant-json-parsing 33. http://stackoverflow.com/questions/10608602/can-a-haskell-or-haskell-os-thr… 34. http://stackoverflow.com/questions/10669217/efficient-functional-data-struc…

1 0

MPC2012 Call for Participation
by Jeremy.Gibbons＠cs.ox.ac.uk 23 May '12

23 May '12

CALL FOR PARTICIPATION 11th International Conference on Mathematics of Program Construction (MPC 2012) Madrid, Spain, 25-27 June 2012 http://babel.ls.fi.upm.es/mpc2012 Hotel rooms reserved until: *** 30th May 2012 *** Early registration deadline: *** 6th June 2012 *** BACKGROUND The biennial MPC conferences aim to promote the development of mathematical principles and techniques that are demonstrably practical and effective in the process of constructing computer programs, broadly interpreted. The 2012 MPC conference will be held in Madrid, Spain, from 25th to 27th June 2012. VENUE The conference will take place in Madrid, the capital of Spain, in the Sala de Grados of the Facultad de Informática of Universidad Complutense de Madrid, right in Madrid's Ciudad Universitaria (city campus), not far from the city centre and other major tourist attractions. Accommodation has been reserved in a nearby 4-star hotel, the VP Jardin Metropolitano. REGISTRATION Conference registration is now open; see http://babel.ls.fi.upm.es/mpc2012/registration.html Registration fees have been kept low thanks to a grant from the Spanish Ministerio de Economia y Competitividad. The early registration fee is €240, which includes lunches, coffees, and social events. The early registration deadline is 6th June 2012; after this point, the registration fee rises to €340. Hotel reservation is handled separately; see http://babel.ls.fi.upm.es/mpc2012/accom.html We have a block booking of rooms at the conference hotel at a special reduced rate, but only until 30th May 2012; after this point, the rooms will be released and the special rate unavailable. (There are few well-connected budget hotels in the area, and June marks the start of Spain's tourist season with a sharp rise in hotel rates; so we strongly advise you to meet this hotel registration deadline.) INVITED SPEAKERS * Gilles Barthe, IMDEA Software Institute (http://software.imdea.org/people/gilles.barthe/) "Probabilistic Relational Hoare Logics for Computer-Aided Security Proofs" * Dan Ghica, University of Birmingham (http://www.cs.bham.ac.uk/~drg/) "The Geometry of Synthesis: How to Make Hardware out of Software" * Tony Hoare, Microsoft Research (http://research.microsoft.com/en-us/people/thoare/) "The Laws of Programming Unify Process Calculi" ACCEPTED PAPERS * "Scheduler-Independent Declassification" Alexander Lux, Heiko Mantel and Matthias Perner * "Elementary Probability Theory in the Eindhoven Style" Carroll Morgan * "Scheduling and Buffer Sizing of n-Synchronous Systems: Typing of Ultimately Periodic Clocks in Lucy-n" Louis Mandel and Florence Plateau * "Deriving Real-Time Action Systems Controllers from Multiscale System Specifications" Brijesh Dongol and Ian J. Hayes * "Calculating Graph Algorithms for Dominance and Shortest Path" Ilya Sergey, Jan Midtgaard and Dave Clarke * "First-Past-the-Post Games" Roland Backhouse * "Reverse Exchange for Concurrency and Local Reasoning" Han-Hing Dang and Bernhard Möller * "Unifying Correctness Statements" Walter Guttmann * "Dependently Typed Programming based on Automated Theorem Proving" Alasdair Armstrong, Simon Foster and Georg Struth * "An Algebraic Calculus of Database Preferences" Bernhard Möller, Patrick Roocks and Markus Endres * "Modular Tree Automata" Patrick Bahr * "Constructing Applicative Functors" Ross Paterson * "Kan Extensions for Program Optimisation, Or: Art and Dan Explain an Old Trick" Ralf Hinze SOCIAL EVENTS The conference excursion will be a guided tour of Madrid's Royal Palace. The banquet will be Northern Spanish cuisine at the Sidreria-Asador Gaztemanu. PROGRAMME COMMITTEE Jeremy Gibbons University of Oxford, UK (co-chair) Pablo Nogueira Universidad Politécnica de Madrid, ES (co-chair) Ralph Back Åbo Akademi, FI Roland Backhouse University of Nottingham, UK Eerke Boiten University of Kent, UK William Cook University of Texas at Austin, US Jules Desharnais Université Laval, CA Lindsay Groves Victoria University of Wellington, NZ Ian Hayes University of Queensland, AU Ralf Hinze University of Oxford, UK Graham Hutton University of Nottingham, UK Johan Jeuring Utrecht Universiteit, NL Christian Lengauer Universität Passau, DE Larissa Meinicke University of Queensland, AU Bernhard Möller Universität Augsburg, DE Carroll Morgan University of New South Wales, AU Shin-Cheng Mu Academia Sinica, TW Dave Naumann Stevens Institute of Technology, US Jose Oliveira Universidade do Minho, PT Steve Reeves University of Waikato, NZ Wouter Swierstra Utrecht Universiteit, NL Anya Tafliovich University of Toronto Scarborough, CA LOCAL ORGANIZERS Pablo Nogueira Universidad Politécnica de Madrid Ricardo Peña Universidad Complutense de Madrid Alvaro García IMDEA Software Institute and Universidad Politécnica de Madrid Manuel Montenegro Universidad Complutense de Madrid For queries about local matters, please write to pablo(a)babel.ls.fi.upm.es.

1 0

LOPSTR'12 deadline extension
by Jon Sneyers 23 May '12

23 May '12

============================================================ LOPSTR'12 DEADLINE EXTENSION 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 NEW DEADLINES Abstract submission: June 4, 2012 Paper submission: June 10, 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: June 4, 2012 Paper submission: June 10, 2012 Notification (for pre-proceedings): July 13, 2012 Camera-ready (for pre-proceedings): July 20, 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 Papers: Implementation and Application of Functional Languages 2012
by Tom Harper 23 May '12

23 May '12

------------------------------------------------------------------------------- CALL FOR PAPERS 24th Symposium on Implementation and Application of Functional Languages (IFL 2012) University of Oxford, UK, August 30-September 1, 2012 http://www.cs.ox.ac.uk/conferences/IFL2012/ This year IFL will be hosted by the University of Oxford, within the idyllic setting of the dreaming spires and picturesque colleges, which have been the home to academic endeavour and research for over nine centuries. The symposium will be held between 30 August and 1 September, 2012. Scope ----- The goal of the IFL symposia is to bring together researchers actively engaged in the implementation and application of functional and function-based programming languages. IFL 2012 will be a venue for researchers to present and discuss new ideas and concepts, work in progress, and publication-ripe results related to the implementation and application of functional languages and function-based programming. Following the IFL tradition, IFL 2012 will use a post-symposium review process to produce formal proceedings which will be published by Springer Verlag in the Lecture Notes in Computer Science series. All participants in IFL 2012 are invited to submit either a draft paper or an extended abstract describing work to be presented at the symposium. Work submitted to IFL must not be submitted simultaneously to other venues; submissions must adhere to ACM SIGPLAN's republication policy: http://www.sigplan.org/republicationpolicy.htm. The submissions will be screened by the program committee chair to make sure they are within the scope of IFL, and will appear in the draft proceedings distributed at the symposium. Submissions appearing in the draft proceedings are not peer-reviewed publications. After the symposium, authors will be given the opportunity to incorporate the feedback from discussions at the symposium and will be invited to submit a revised full article for the formal review process. From the revised submissions, the program committee will select papers for the formal proceedings considering their correctness, novelty, originality, relevance, significance, and clarity. Topics ------ IFL welcomes submissions describing practical and theoretical work as well as submissions describing applications and tools. If you are not sure that your work is appropriate for IFL 2012, please contact the PC chair at ralf.hinze(a)cs.ox.ac.uk. Topics of interest include, but are not limited to: language concepts type checking contracts compilation techniques staged compilation run-time function specialization run-time code generation partial evaluation (abstract) interpretation generic programming automatic program generation array processing concurrent/parallel programming concurrent/parallel program execution functional programming and embedded systems functional programming and web applications functional programming and security novel memory management techniques run-time profiling and performance measurements debugging and tracing virtual/abstract machine architectures validation and verification of functional programs tools and programming techniques (industrial) applications of functional programming Submission details ------------------ Presentation submission deadline: July 30th, 2012 Notification of acceptance: August 1st, 2012 Early registration deadline: August 10th, 2012 IFL 2012 Symposium: August 30-September 1, 2012 Submission for (post) review process: November 30th, 2012 Notification Accept/Reject: February 4th, 2013 Camera ready version: March 18th, 2013 Prospective authors are encouraged to submit papers or extended abstracts to be published in the draft proceedings and to present them at the symposium. All contributions must be written in English, conform to the Springer-Verlag LNCS series format and not exceed 16 pages. The draft proceedings will appear as a technical report of the Department of Computer Science of the University of Oxford. (We are more liberal with the draft proceedings, where longer papers or SIGPLAN 2 column 12 page papers are acceptable. For other formats please contact the chair at ralf.hinze(a)cs.ox.ac.uk. For consideration for the final proceedings, only the 16 page LNCS format will be accepted.) Papers are to be submitted via the conference's EasyChair submission page: https://www.easychair.org/conferences/?conf=ifl2012 Peter Landin Prize ------------------ The Peter Landin Prize is awarded to the best paper presented at the symposium every year. The honoured article is selected by the program committee based on the submissions received for the formal review process. The prize carries a cash award equivalent to 150 Euros. Programme committee ------------------- Edwin Brady, University of St. Andrews, UK Andrew Butterfield, University of Dublin, Ireland Matthew Flatt, University of Utah, US Andy Gill, University of Kansas, US Stephan Herhut, Intel Labs, Santa Clara, US Ralf Hinze (Chair), University of Oxford, UK Zhenjiang Hu, National Institute of Informatics, Japan Patrik Jansson, Chalmers University of Technology, Sweden Mauro Jaskelioff, Universidad Nacional de Rosario, Argentina Gabriele Keller, University of New South Wales, Australia Simon Marlow, Microsoft Research, UK Pablo Nogueira, Technical University of Madrid, Spain Bruno Oliveira, Seoul National University, Korea José Nuno Oliveira, University of Minho, Portugal Rinus Plasmeijer, Radboud University Nijmegen, Netherlands Tom Schrijvers, Ghent University, Belgium Tim Sheard, Portland State University, US Wouter Swierstra, University of Utrecht, Netherlands Peter Thiemann, University of Freiburg, Germany Simon Thompson, University of Kent, UK Steve Zdancewic, University of Pennsylvania, US

1 0

Re: [Haskell] Summer School on Functional Programming for Parallel and Concurrent Applications
by Francesco Zappa Nardelli 23 May '12

23 May '12

Dear all [apologies for multiple copies] as part of the summer school on FUNCTIONAL PROGRAMMING FOR PARALLEL AND CONCURRENT APPLICATIONS 11-22 June 2012, Castle of Cadarache, Saint Paul Lez Durance, France http://www-hpc.cea.fr/SummerSchools2012-CS.htm we organise an informal meeting between programmers living in the region on the evening of Monday, June 18. If you want to join, please send Olivier Boudeville (olivier . boudeville (at) edf . fr) a note so that we can properly dimension the appetisers. Also, there are a few places still available to attend the school (deadline: may 30 ) Best -francesco

1 0

Re: [Haskell] [Haskell-cafe] ANN: reform - a type-safe form generation and validation library in the spirit of formlets and digestive-functors < 0.2
by Jeremy Shaw 22 May '12

22 May '12

Sounds great! I have some vague ideas about what the comparison might reveal -- but I expect to learn quite a bit in the process, and use that to improve reform. There is definitely room for more than one form validation library. They all have shortcomings, and I am hoping something even better will come along some day :) - jeremy On Tue, May 22, 2012 at 4:31 AM, Jasper Van der Jeugt <m(a)jaspervdj.be> wrote: > Congrats on the release! > > I would like to help out with the full comparison since I have some > knowledge and experience on the subject. Because of the different > approach, I think there's definitely room for two libraries. > > Cheers, > Jasper > > On Tue, May 22, 2012 at 2:23 AM, Felipe Almeida Lessa > <felipe.lessa(a)gmail.com> wrote: >> On Mon, May 21, 2012 at 7:18 PM, Jeremy Shaw <jeremy(a)n-heptane.com> wrote: >>> I hope to do a full comparison of reform vs digestive-functors 0.3 vs >>> yesod forms in a few weeks. >> >> That would be awesome! Just sayin' =). >> >> Cheers, >> >> -- >> Felipe. >> >> -- >> You received this message because you are subscribed to the Google Groups "HAppS" group. >> To post to this group, send email to happs(a)googlegroups.com. >> To unsubscribe from this group, send email to happs%2Bunsubscribe(a)googlegroups.com. >> For more options, visit this group at http://groups.google.com/group/happs?hl=en. >> > > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe(a)haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe

1 0

ANN: reform - a type-safe form generation and validation library in the spirit of formlets and digestive-functors < 0.2
by Jeremy Shaw 22 May '12

22 May '12

I am pleased to annouce the release of 'reform'. A full tutorial is available here: http://www.happstack.com/docs/crashcourse/Reform.html Reform is an HTML form generation and validation library. It follows in the footsteps of formlets and digestive-functors <= 0.2. In fact, much of the code in reform comes from the digestive-functors-0.2 code base. Reform is designed to be usuable with a wide variety of Haskell web servers and templating libraries. You can find the following packages on hackage: * reform - the core library * reform-happstack - support for using reform with the Happstack server * reform-blaze - support for creating forms for blaze-html * reform-hsp - support for creating forms for HSP (another xml/html template library) The source code is available via darcs: darcs get http://patch-tag.com/r/stepcut/reform The darcs repo also includes proof-of-concept support for 'Heist'. Reform will feel very familiar to formlets and digestive-functors <= 0.2 users. The primary motivation behind this library is to provide a supported alternative to digestive-functors 0.2 for users that prefer 0.2 over 0.3. The key new feature in reform is the ability to separate the validation code from the view generation code. This allows library authors to provide validators (known as Proofs) which the users can use when constructing their forms. The proof names appear in the type-signatures. This allows the library author to ensure that the value returned by a user created form is not merely the correct type, but has also passed validation. The reform-happstack package also provides simple and transparent Cross-Site Request Forgery (CSRF) protection, using the double-submit method. This method has some weaknesses. For example, I believe it can be circumvented if your site is vulnerable to cross-site scripting (XSS) attacks. If you have suggestions on how to improve the CSRF protection -- please let us know! I hope to do a full comparison of reform vs digestive-functors 0.3 vs yesod forms in a few weeks. - jeremy

2 1

CUFP 2012: Call for Presentations
by Stefan Wehr 21 May '12

21 May '12

Hi everyone, just a quick reminder: the talk submission proposal for this year's CUPF is 29 June 2012. If you have something interesting to say about commercial applications of functional programming languages (especially Haskell, of course!), please submit a proposal. Thanks, Stefan COMMERCIAL USERS OF FUNCTIONAL PROGRAMMING 2012 CUFP 2012 http://cufp.org/conference CALL FOR PRESENTATIONS Copenhagen, Denmark Sep 13-15 Co-located with ICFP 2012 Sponsored by SIGPLAN Talk Proposal Submission Deadline 29 June 2012 The annual CUFP workshop is a place where people can see how others are using functional programming to solve real world problems; where practitioners meet and collaborate; where language designers and users can share ideas about the future of their favorite language; and where one can learn practical techniques and approaches for putting functional programming to work. Giving a CUFP Talk ================== If you have experience using functional languages in a practical setting, we invite you to submit a proposal to give a talk at the workshop. We're looking for two kinds of talks: Experience reports are typically 25 minutes long, and aim to inform participants about how functional programming plays out in real-world applications, focusing especially on lessons learned and insights gained. Experience reports don't need to be highly technical; reflections on the commercial, management, or software engineering aspects are, if anything, more important. Technical talks are also 25 minutes long, and should focus on teaching the audience something about a particular technique or methodology, from the point of view of someone who has seen it play out in practice. These talks could cover anything from techniques for building functional concurrent applications, to managing dynamic reconfigurations, to design recipes for using types effectively in large-scale applications. While these talks will often be based on a particular language, they should be accessible to a broad range of programmers. If you are interested in offering a talk, or nominating someone to do so, send an e-mail to sperber(at)deinprogramm(dot)de or avsm2(at)cl(dot)cam(dot)ac(dot)uk by 29 June 2012 with a short description of what you'd like to talk about or what you think your nominee should give a talk about. Such descriptions should be about one page long. There will be a short scribes report of the presentations and discussions but not of the details of individual talks, as the meeting is intended to be more a discussion forum than a technical interchange. You do not need to submit a paper, just a proposal for your talk! Program Committee ================= Mike Sperber (Active Group), co-chair Anil Madhavapeddy (University of Cambridge), co-chair Ashish Agarwal (New York University) Thomas Arts (QuviQ AB) Chris Houser (LonoCloud) Tomas Petricek (University of Cambridge) Heiko Seeberger (Typesafe) Stefan Wehr (factis research) Noel Welsh (untyped) More information ================ For more information on CUFP, including videos of presentations from previous years, take a look at the CUFP website at http://cufp.org. Note that presenters, like other attendees, will need to register for the event. Presentations will be video taped and presenters will be expected to sign an ACM copyright release form. Acceptance and rejection letters will be sent out by July 16th. Guidance on giving a great CUFP talk ==================================== Focus on the interesting bits: Think about what will distinguish your talk, and what will engage the audience, and focus there. There are a number of places to look for those interesting bits. Setting: FP is pretty well established in some areas, including formal verification, financial processing and server-side web-services. An unusual setting can be a source of interest. If you're deploying FP-based mobile UIs or building servers on oil rigs, then the challenges of that scenario are worth focusing on. Did FP help or hinder in adapting to the setting? Technology: The CUFP audience is hungry to learn about how FP techniques work in practice. What design patterns have you applied, and to what areas? Did you use functional reactive programming for user interfaces, or DSLs for playing chess, or fault-tolerant actors for large scale geological data processing? Teach us something about the techniques you used, and why we should consider using them ourselves. Getting things done: How did you deal with large software development in the absence of a myriad of pre-existing support that are often expected in larger commercial environments (IDEs, coverage tools, debuggers, profilers) and without larger, proven bodies of libraries? Did you hit any brick walls that required support from the community? Don't just be a cheerleader: It's easy to write a rah-rah talk about how well FP worked for you, but CUFP is more interesting when the talks also spend time on what doesn't work. Even when the results were all great, you should spend more time on the challenges along the way than on the parts that went smoothly.

1 0