May 2013 - Haskell - Haskell.org

ANNOUNCE: ioctl 0.0.1
by Maciej Piechotka 13 Sep '15

13 Sep '15

A package for type-safe I/O control. Currently only ioctl is supported. Currently simply a extract from my tuntap fork TODO: - Return the integer as well as structure (will break the API) - Port for Windows Network.Socket.IOCtl (as soon as I manage to setup some sane environment on this platform) - Wrapping around DeviceIoControl Example (in hsc): data NotRead = NotRead instance NotRead Int where ioctlReq _ = #const FIONREAD notRead s = ioctlsocket' s NotRead Regards

2 1

CFP: Term and Graph rewriting, special issue of MSCS
by Rachid Echahed 13 Feb '14

13 Feb '14

-------------------------------------------------------------------------- First Call for Papers Special Issue of Mathematical Structures in Computer Science (MSCS) on "TERM and GRAPH Rewriting" -------------------------------------------------------------------------- Scope -------------------------------------------------------------------------- Rewriting techniques constitute a foundational theory of computing science. They are being investigated for several structures such as lambda-terms, first-order terms or graphs and have been successfully used in many areas such as programming languages, automated reasoning, program verification, security, etc. This is witnessed by the leading international events ICGT, RTA or TLCA among others. During the last decade, a particular interest has been devoted to the study of the impact of shared structures in term and graph rewriting through the international editions of TERMGRAPH series of workshops. Sharing is indeed ubiquitous in several research areas, for instance: the modelling of first- and higher-order term rewriting by (acyclic or cyclic) graph rewriting, the modelling of biological or chemical abstract machines, the implementation techniques of programming languages. Term and graph rewriting are also used in automated theorem proving and symbolic computation systems working on shared structures... This special issue is devoted to recent developments in all aspects of TERM and GRAPH rewriting. This includes (but is not limited to): term rewriting, graph transformation, proof methods, programming languages, infinitary rewriting, rewrite strategies, semantics, properties of rewriting ... -------------------------------------------------------------------------- Submissions -------------------------------------------------------------------------- Submitted papers must be original and not submitted for publication elsewhere, and will be subject to the standard journal refereeing process of the Mathematical Structures in Computer Science (MSCS) journal. Submissions should be in pdf format following the MSCS instruction for contributors (http://assets.cambridge.org/MSC/MSC_ifc.pdf) and should be submitted electronically via the following easy-chair web site: https://www.easychair.org/conferences/?conf=mscsrewriting2012 -------------------------------------------------------------------------- Important Dates -------------------------------------------------------------------------- January 20, 2012 : Abstract submission February 20, 2012: Paper submission June 15, 2012 : Notification of acceptance -------------------------------------------------------------------------- Guest Editor: -------------------------------------------------------------------------- Rachid Echahed, CNRS LIG Lab., Grenoble, France echahed(a)imag.fr --------------------------------------------------------------------------

1 8

2nd CFP: SCSS 2013
by Temur Kutsia 18 Sep '13

18 Sep '13

[Please post - apologies for multiple copies.] Second Call for Papers SCSS 2013 Symbolic Computation in Software Science 5th International Symposium Castle of Hagenberg, Austria, July 5-6, 2013 Research Institute for Symbolic Computation (RISC) Johannes Kepler University Linz http://www.risc.jku.at/conferences/scss2013/ Scope -------- The purpose of SCSS 2013 is to promote research on theoretical and practical aspects of symbolic computation in software science. The symposium provides a forum for active dialog between researchers from several fields of computer algebra, algebraic geometry, algorithmic combinatorics, computational logic, and software analysis and verification. SCSS 2013 solicits both regular and tool papers on all aspects of symbolic computation and their applications in software science. The topics of the symposium include, but are not limited to the following: - automated reasoning - algorithm (program) synthesis and/or verification - formal methods for the analysis of network security - termination analysis and complexity analysis of algorithms (programs) - extraction of specifications from algorithms (programs) - theorem proving methods and techniques - proof carrying code - generation of inductive assertion for algorithm (programs) - algorithm (program) transformations - formalization and computerization of knowledge (maths, medicine, economy, etc.) - component-based programming - computational origami - query languages (in particular for XML documents) - semantic web and cloud computing Invited Speakers ---------------- Bruno Buchberger (RISC, Johannes Kepler University Linz, Austria) Joel Ouaknine (Oxford University, UK) Program Chair -------------- Laura Kovacs (Vienna University of Technology, Austria and Chalmers University of Technology, Sweden) Program Committee ------------------ María Alpuente (Technical University of Valencia, Spain) Serge Autexier (DFKI, Germany) Nikolaj Bjorner (Microsoft Research) Adel Bouhoula (Higher School of Communications of Tunis, Tunisia) Iliano Cervesato (Carnegie Mellon University — Qatar Campus) Horatiu Cirstea (Loria, France) Jürgen Giesl (RWTH Aachen, Germany) Tetsuo Ida (University of Tsukuba, Japan) Paul Jackson (University of Edinburgh, UK) Tudor Jebelean (RISC, Johannes Kepler University Linz, Austria) Cezary Kaliszyk (University of Innsbruck, Austria) Fairouz Kamareddine (Heriot-Watt University, UK) Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) Stephan Merz (INRIA Lorraine, France) Ali Mili (New Jersey Institute of Technology, USA) Yasuhiko Minamide (University of Tsukuba, Japan) Pierre-Etienne Moreau (INRIA-LORIA Nancy, France) André Platzer (Carnegie Mellon University, USA) Stefan Ratschan (Czech Academy of Sciences) Rachid Rebiha (University of Lugano, Switzerland and IC Unicamp, Brazil) Enric Rodríguez Carbonell (Technical University of Catalonia, Spain) Sorin Stratulat (University of Lorraine, Metz, France) Thomas Sturm (Max Planck Institute for Informatics, Germany) Symposium Chair --------------- Temur Kutsia (RISC, Johannes Kepler University Linz, Austria) Important Dates --------------- April 30, 2013: Abstract submission deadline May 3, 2013: Paper submission deadline June 3, 2013: Notification of acceptance June 17, 2013: Camera-ready copy deadline July 5-6, 2013: SCSS 2013, Castle of Hagenberg, Austria Submission ---------- Submission is via EasyChair: https://www.easychair.org/conferences/?conf=scss2013. Submissions are invited in two categories: regular research papers and tool papers. - Regular research papers must not exceed 12 pages in the EasyChair Class format, with up to 3 additional pages for technical appendices. - Tool papers must not exceed 6 pages in the EasyChair Class format. Publication ---------- The proceedings of SCSS 2013 will be published as a RISC technical report. After the symposium, authors of accepted papers at SCSS 2013 will be invited to submit an extended version of their paper to the special issue of the Journal of Symbolic Computation on SCSS. Submitted papers to the JSC special issue will undergo an additional reviewing.

2 1

Job opening Ph D student in type error diagnosis for domain specific languages in Haskell
by Jurriaan Hage 31 May '13

31 May '13

Dear Haskellers, Apologies in case you have received multiple copies. best, Jur =============================================================================== VACANCY : 1x Phd Student in domain specific type error diagnosis for Haskell =============================================================================== The activities of the Software Systems division at Utrecht University include research on programming methodologies, compiler construction, and program analysis, validation, and verification. For information about the research group of Software Technology, see: http://www.cs.uu.nl/wiki/Center Financed by the Netherlands Organisation for Scientific Research (NWO), we currently have a job opening for: * 1x PhD researcher (Ph D student) Software Technology Domain-specific languages (DSLs) have the potential both to reduce the effort of programming, and to result in programs that are easier to understand and maintain. For various good reasons, researchers have proposed to embed DSLs (then called EDSLs) into a general purpose host language. An important disadvantage of such an embedding is that it is very hard to make type error diagnosis domain-aware, because inconsistencies are by default explained in terms of the host language. We are currently looking for a highly motivated Ph D student to investigate this problem in the context of the functional language Haskell. The basic approach is to scale the concept of specialized type rules as developed by (Heeren, Hage and Swierstra, ICFP '03, see link below) for Haskell '98 to modern day Haskell with all of its type system extensions. The work is both technically challenging, i.e., how do you ensure that modifications to the type diagnositic process do not inadvertently change the type system, and practically immediately useful: making domain-specific type error diagnosis a reality for a full sized language such as Haskell is likely to have a pervasive influence on the field of domain-specific languages, and the language Haskell. The ICFP '03 paper can be found at http://www.cs.uu.nl/people/jur/scriptingthetypeinferencer.pdf A project paper that describes the context and aims of the current project can be found here: http://www.cs.uu.nl/people/jur/tfp2013_submission_2.pdf At first, the work will be prototyped in our own Utrecht Haskell Compiler. If succesfull, the work will also make its way into the GHC. We expect the candidate to communicate the results academically, to present the work at scientific conferences, to supervise Master students, and to assist in teaching courses at Bachelor or Master level. --------------------------------- What we are looking for --------------------------------- The candidate should have an MSc in Computer Science, be highly motivated, speak and write English very well, and be proficient in producing scientific reports. Knowledge of and experience with at least one of the following two areas is essential: * functional programming, and Haskell in particular * type system concepts Furthermore, we expect the candidate to be able to reason formally. Experience in compiler construction is expected to be useful in this project. --------------------------------- What we offer --------------------------------- You are offered a full-time position for 4 years. The gross salary is in the range between € 2083,- and maximum € 2664,- per month. The salary is supplemented with a holiday bonus of 8% and an end-of-year bonus of 8,3% per year. In addition we offer: a pension scheme, a partially paid parental leave, flexible employment conditions. Conditions are based on the Collective Labour Agreement Dutch Universities. We aim to start November 1, 2013 at the latest, but preferably sooner. --------------------------------- In order to apply --------------------------------- To apply please attach a letter of motivation, a curriculum vitae, and (email) addresses of two referees. Make sure to also include a transcript of the courses you have followed (at bachelor and master level), with the grades you obtained, and to include a sample of your scientific writing, e.g., the pdf of your master thesis. It is possible to apply for this position if you are close to obtaining your Master's. In that case include a letter of your supervisor with an estimate of your progress, and do not forget to include at least a sample of your technical writing skills. Application closes on the 20th of June 2013. For application, visit http://www.cs.uu.nl/vacatures/en/583630.html and follow the link to the official job application page at the bottom. --------------- Contact person --------------- For further information you can direct your inquiries to: Dr. Jurriaan Hage Phone: (+31) 30 253 3283 e-mail: J.Hage(a)uu.nl. website: http://www.cs.uu.nl/wiki/Hage/WebHome

1 0

Call for Papers IFL 2013
by publicityifl＠gmail.com 31 May '13

31 May '13

=============================================================================== VACANCY : 1x Phd Student in domain specific type error diagnosis for Haskell =============================================================================== The activities of the Software Systems division at Utrecht University include research on programming methodologies, compiler construction, and program analysis, validation, and verification. For information about the research group of Software Technology, see: http://www.cs.uu.nl/wiki/Center Financed by the Netherlands Organisation for Scientific Research (NWO), we currently have a job opening for: * 1x PhD researcher (Ph D student) Software Technology Domain-specific languages (DSLs) have the potential both to reduce the effort of programming, and to result in programs that are easier to understand and maintain. For various good reasons, researchers have proposed to embed DSLs (then called EDSLs) into a general purpose host language. An important disadvantage of such an embedding is that it is very hard to make type error diagnosis domain-aware, because inconsistencies are by default explained in terms of the host language. We are currently looking for a highly motivated Ph D student to investigate this problem in the context of the functional language Haskell. The basic approach is to scale the concept of specialized type rules as developed by (Heeren, Hage and Swierstra, ICFP '03, see link below) for Haskell '98 to modern day Haskell with all of its type system extensions. The work is both technically challenging, i.e., how do you ensure that modifications to the type diagnositic process do not inadvertently change the type system, and practically immediately useful: making domain-specific type error diagnosis a reality for a full sized language such as Haskell is likely to have a pervasive influence on the field of domain-specific languages, and the language Haskell. The ICFP '03 paper can be found at http://www.cs.uu.nl/people/jur/scriptingthetypeinferencer.pdf A project paper that describes the context and aims of the current project can be found here: http://www.cs.uu.nl/people/jur/tfp2013_submission_2.pdf At first, the work will be prototyped in our own Utrecht Haskell Compiler. If succesfull, the work will also make its way into the GHC. We expect the candidate to communicate the results academically, to present the work at scientific conferences, to supervise Master students, and to assist in teaching courses at Bachelor or Master level. --------------------------------- What we are looking for --------------------------------- The candidate should have an MSc in Computer Science, be highly motivated, speak and write English very well, and be proficient in producing scientific reports. Knowledge of and experience with at least one of the following two areas is essential: * functional programming, and Haskell in particular * type system concepts Furthermore, we expect the candidate to be able to reason formally. Experience in compiler construction is expected to be useful in this project. --------------------------------- What we offer --------------------------------- You are offered a full-time position for 4 years. The gross salary is in the range between Û 2083,- and maximum Û 2664,- per month. The salary is supplemented with a holiday bonus of 8% and an end-of-year bonus of 8,3% per year. In addition we offer: a pension scheme, a partially paid parental leave, flexible employment conditions. Conditions are based on the Collective Labour Agreement Dutch Universities. We aim to start November 1, 2013 at the latest, but preferably sooner. --------------------------------- In order to apply --------------------------------- To apply please attach a letter of motivation, a curriculum vitae, and (email) addresses of two referees. Make sure to also include a transcript of the courses you have followed (at bachelor and master level), with the grades you obtained, and to include a sample of your scientific writing, e.g., the pdf of your master thesis. It is possible to apply for this position if you are close to obtaining your Master's. In that case include a letter of your supervisor with an estimate of your progress, and do not forget to include at least a sample of your technical writing skills. Application closes on the 20th of June 2013. For application, visit http://www.cs.uu.nl/vacatures/en/583630.html and follow the link to the official job application page at the bottom. --------------- Contact person --------------- For further information you can direct your inquiries to: Dr. Jurriaan Hage Phone: (+31) 30 253 3283 e-mail: J.Hage(a)uu.nl. website: http://www.cs.uu.nl/wiki/Hage/WebHome

1 0

Haskell Weekly News: Issue 268
by Daniel Santa Cruz 31 May '13

31 May '13

Welcome to issue 268 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of May 12 to 25, 2013. Quotes of the Week * tikhonjelvis: the lesson is that the fix function exists to "fix" any type problems you may encounter * shachaf: The trouble with peano arithmetic is that it stops at 88. * Peaker: Python's dynamic nature adds slowness and unsafety, but doesn't actually make things more expressive * sj4nz: Programming in weakly-typed languages forever after will feel like working with punch cards. Send in your program to the nodejs interpreter and hope for a result to come back. * xplat: if you want to carry your machete all the time and not make people nervous, you need to constantly blaze trails * otters: heh, F# is just the unboxed version of F * quchen: This was the first time in months that I thought imperatively. Conclusion: 1. it complicated things, 2. it was refreshing * cmccann: I still kind of expect that the next standard will be haskell2017 or something, and all it will do is a minor change to lexical syntax of comments that fixes nothing but nevertheless breaks 20% of hackage. * cmccann: [on reimplementing cryptography in pure Haskell] writing in Haskell lets you use type safety to ensure that all the security holes you create are subtle instead of obvious. Top Reddit Stories * Haskell in Production [slides] Domain: mth.io, Score: 60, Comments: 114 On Reddit: [1] http://goo.gl/ldnv0 Original: [2] http://goo.gl/tMjTd * B-trees with GADTs Domain: matthew.brecknell.net, Score: 56, Comments: 6 On Reddit: [3] http://goo.gl/Sjf9U Original: [4] http://goo.gl/sQnYW * Yearly revisions to the Haskell language: who killed Haskell Prime? Domain: self.haskell, Score: 54, Comments: 19 On Reddit: [5] http://goo.gl/5GWKg Original: [6] http://goo.gl/5GWKg * Elm paper accepted at PLDI: Asynchronous FRP for GUIs! Domain: people.seas.harvard.edu, Score: 51, Comments: 4 On Reddit: [7] http://goo.gl/iYiyh Original: [8] http://goo.gl/98jft * The complete correctness of sorting [Agda] Domain: twanvl.nl, Score: 49, Comments: 5 On Reddit: [9] http://goo.gl/PLH6m Original: [10] http://goo.gl/RQGZn * Anatomy of an MVar operation Domain: blog.ezyang.com, Score: 47, Comments: 7 On Reddit: [11] http://goo.gl/7miao Original: [12] http://goo.gl/3ZHSI * Typing Haskell in Haskell Domain: web.cecs.pdx.edu, Score: 44, Comments: 34 On Reddit: [13] http://goo.gl/q1ghy Original: [14] http://goo.gl/M5csQ * STM in Haskell is better because of types Domain: joeyh.name, Score: 44, Comments: 8 On Reddit: [15] http://goo.gl/wj9Ab Original: [16] http://goo.gl/fmLM1 * Typed Template Haskell ready for testing in GHC Domain: haskell.org, Score: 44, Comments: 13 On Reddit: [17] http://goo.gl/he61y Original: [18] http://goo.gl/YJIZB * A detailed look at GHC's STM implementation from a non-GHC hacker Domain: fryguybob.github.io, Score: 38, Comments: 11 On Reddit: [19] http://goo.gl/pTp2c Original: [20] http://goo.gl/4oe3Y * New Haskell Communities and Activity Report (May 2013) is out Domain: haskell.org, Score: 37, Comments: 2 On Reddit: [21] http://goo.gl/P2kz1 Original: [22] http://goo.gl/YoIE4 * Three examples of problems with Lazy I/O Domain: newartisans.com, Score: 36, Comments: 31 On Reddit: [23] http://goo.gl/reKqZ Original: [24] http://goo.gl/ZagPt * Understanding the Yoneda Lemma Domain: fpcomplete.com, Score: 35, Comments: 48 On Reddit: [25] http://goo.gl/RUZ4h Original: [26] http://goo.gl/xbAJj * Simon Peyton Jones to keynote Haskell eXchange 2013! Domain: skillsmatter.com, Score: 35, Comments: 2 On Reddit: [27] http://goo.gl/DlfRt Original: [28] http://goo.gl/5lpwh * Greg Hale's "Functional programming elevator pitch" Domain: fpcomplete.com, Score: 34, Comments: 8 On Reddit: [29] http://goo.gl/gbhX3 Original: [30] http://goo.gl/QrrxP * FP Complete is looking for a Technical Sales Engineer and Support Specialist Domain: fpcomplete.com, Score: 32, Comments: 1 On Reddit: [31] http://goo.gl/nYNci Original: [32] http://goo.gl/VGCoa * A Typed Markup Language Based On Haskell Domain: blog.functorial.com, Score: 31, Comments: 9 On Reddit: [33] http://goo.gl/eLLjV Original: [34] http://goo.gl/wFxcv * Announcing: Snap Framework v0.12 Domain: snapframework.com, Score: 28, Comments: 2 On Reddit: [35] http://goo.gl/5wYLk Original: [36] http://goo.gl/KibyP * John Wiegley's "Understanding Continuations", on School of Haskell Domain: fpcomplete.com, Score: 27, Comments: 17 On Reddit: [37] http://goo.gl/ZT7d6 Original: [38] http://goo.gl/YitVR Top StackOverflow Questions * Why are if expressions frowned upon in Haskell? votes: 20, answers: 6 Read on SO: [39] http://goo.gl/NejhX * Haskell: `Map (a,b) c` versus `Map a (Map b c)`? votes: 19, answers: 3 Read on SO: [40] http://goo.gl/8f1hf * Why recursive `let` make space effcient? votes: 18, answers: 3 Read on SO: [41] http://goo.gl/QTLYQ * Should do-notation be avoided in Haskell? [duplicate] votes: 16, answers: 7 Read on SO: [42] http://goo.gl/MGiFr * Correspondence between type classes and grammar levels in the Chomsky hierarchy votes: 15, answers: 1 Read on SO: [43] http://goo.gl/LRJy2 * Calling Haskell from C# votes: 14, answers: 2 Read on SO: [44] http://goo.gl/n9QB1 * How do exceptions work in Haskell (part two)? votes: 13, answers: 1 Read on SO: [45] http://goo.gl/U2GDR * Can a monad be a comonad? votes: 11, answers: 5 Read on SO: [46] http://goo.gl/ESrc2 * Dynamic Programming Memoization in Haskell votes: 11, answers: 1 Read on SO: [47] http://goo.gl/Gp7c8 * Employing arrows to fold a list of tuples votes: 11, answers: 1 Read on SO: [48] http://goo.gl/shRWV Until next time, +Daniel Santa Cruz References 1. http://mth.io/talks/haskell-in-production/ 2. http://www.reddit.com/r/haskell/comments/1etssw/haskell_in_production_slide… 3. http://matthew.brecknell.net/post/btree-gadt/ 4. http://www.reddit.com/r/haskell/comments/1efuog/btrees_with_gadts/ 5. http://www.reddit.com/r/haskell/comments/1esmhj/yearly_revisions_to_the_has… 6. http://www.reddit.com/r/haskell/comments/1esmhj/yearly_revisions_to_the_has… 7. http://people.seas.harvard.edu/~chong/pubs/pldi13-elm.pdf 8. http://www.reddit.com/r/haskell/comments/1eie6m/elm_paper_accepted_at_pldi_… 9. http://twanvl.nl/blog/agda/sorting 10. http://www.reddit.com/r/haskell/comments/1exv2t/the_complete_correctness_of… 11. http://blog.ezyang.com/2013/05/anatomy-of-an-mvar-operation/ 12. http://www.reddit.com/r/haskell/comments/1eostu/anatomy_of_an_mvar_operatio… 13. http://web.cecs.pdx.edu/~mpj/thih/TypingHaskellInHaskell.html 14. http://www.reddit.com/r/haskell/comments/1e6s68/typing_haskell_in_haskell/ 15. http://joeyh.name/blog/entry/the_newinwheezy_game:_STM/ 16. http://www.reddit.com/r/haskell/comments/1e8ow9/stm_in_haskell_is_better_be… 17. http://www.haskell.org/pipermail/ghc-devs/2013-May/001255.html 18. http://www.reddit.com/r/haskell/comments/1egfra/typed_template_haskell_read… 19. http://fryguybob.github.io/STM-Commentary/ 20. http://www.reddit.com/r/haskell/comments/1ejgjo/a_detailed_look_at_ghcs_stm… 21. http://haskell.org/communities/05-2013/html/report.html 22. http://www.reddit.com/r/haskell/comments/1e601k/new_haskell_communities_and… 23. http://newartisans.com/2013/05/three-examples-of-problems-with-lazy-io 24. http://www.reddit.com/r/haskell/comments/1e8k3k/three_examples_of_problems_… 25. https://www.fpcomplete.com/user/bartosz/understanding-yoneda 26. http://www.reddit.com/r/haskell/comments/1eelao/understanding_the_yoneda_le… 27. http://skillsmatter.com/event/scala/haskell-exchange/te-7391 28. http://www.reddit.com/r/haskell/comments/1ewq54/simon_peyton_jones_to_keyno… 29. https://www.fpcomplete.com/user/imalsogreg/functional-programming-elevator-… 30. http://www.reddit.com/r/haskell/comments/1ewvhm/greg_hales_functional_progr… 31. https://www.fpcomplete.com/page/product_specialist 32. http://www.reddit.com/r/haskell/comments/1ezeng/fp_complete_is_looking_for_… 33. http://blog.functorial.com/posts/2013-05-18-Typed-Markup-Language.html 34. http://www.reddit.com/r/haskell/comments/1elhj2/a_typed_markup_language_bas… 35. http://snapframework.com/blog/2013/05/15/snap-0.12-released 36. http://www.reddit.com/r/haskell/comments/1ef3kt/announcing_snap_framework_v… 37. https://www.fpcomplete.com/user/jwiegley/understanding-continuations 38. http://www.reddit.com/r/haskell/comments/1e977w/john_wiegleys_understanding… 39. http://stackoverflow.com/questions/16572446/why-are-if-expressions-frowned-… 40. http://stackoverflow.com/questions/16613032/haskell-map-a-b-c-versus-map-a-… 41. http://stackoverflow.com/questions/16632143/why-recursive-let-make-space-ef… 42. http://stackoverflow.com/questions/16726659/should-do-notation-be-avoided-i… 43. http://stackoverflow.com/questions/16607637/correspondence-between-type-cla… 44. http://stackoverflow.com/questions/16615641/calling-haskell-from-c-sharp 45. http://stackoverflow.com/questions/16678165/how-do-exceptions-work-in-haske… 46. http://stackoverflow.com/questions/16551734/can-a-monad-be-a-comonad 47. http://stackoverflow.com/questions/16585741/dynamic-programming-memoization… 48. http://stackoverflow.com/questions/16676758/employing-arrows-to-fold-a-list… 49. https://plus.google.com/105107667630152149014/about

1 0

2nd CFP: Functional High-Performance Computing (FHPC 2013)
by Jost Berthold 30 May '13

30 May '13

===================================================================== 2nd CALL FOR PAPERS FHPC 2013 The 2nd ACM SIGPLAN Workshop on Functional High-Performance Computing Boston, Massachusets September 23, 2013 http://www.hiperfit.dk/fhpc13.html Co-located with the International Conference on Functional Programming (ICFP 2013) Submission Deadline: June 14, 2013 (anywhere on earth) ===================================================================== The FHPC workshop aims at bringing together researchers exploring uses of functional (or more generally, declarative or high-level) programming technology in application domains where large-scale computations arise naturally and high performance is essential. Such computations would typically -- but not necessarily -- involve execution on highly parallel systems ranging from multi-core multi-processor systems to graphics accelerators (GPGPUs), reconfigurable hardware (FPGAs), large-scale compute clusters or any combination thereof. It is becoming apparent that radically new and well founded methodologies for programming such systems are required to address their inherent complexity and to reconcile execution performance with programming productivity. The aim of the meeting is to enable sharing of results, experiences, and novel ideas about how high-level, declarative specifications of computationally challenging problems can serve as highly transparent, maintainable, and portable code that approaches (or even exceeds) the performance of machine-oriented imperative implementations. Each FHPC workshop proposes a particular theme for applications where high-performance computing and/or functional programming technology can be applied. For FHPC 2013, the theme is "Large-Scale Simulation", traditionally one of the main driving forces behind supercomputing. A large fraction of compute cycles in supercomputers worldwide is spent on simulation tasks, for various engineering tasks, drug design and other medical simulations, and in different natural science domains. Declarative languages have potential to radically change development practice and workflow for simulation software in these areas. Hence, we particularly encourage submission of application-oriented contributions in the area of simulation. As a general rule, while proposing the theme, the workshop welcomes submissions from all relevant application domains as well as those describing general work on the theory and practice of declarative high-performance computing. Proceedings: ============ Accepted papers will be published by the ACM and will appear in the ACM Digital Library. * Submission Deadline: 14 June 2013 (anywhere on earth) * Author Notification: 11 July 2013 * Final Papers Due : 25 July 2013 Submitted papers must be in portable document format (PDF), formatted according to the ACM SIGPLAN style guidelines (2-column, 9pt format). See http://www.sigplan.org/authorInformation.htm for more information and style files. The page limit is 12 pages. Submission deadlines and page limit are firm. Contributions to FHPC 2013 should be submitted via Easychair, under https://www.easychair.org/conferences/?conf=fhpc2013. The submission site is now open. The FHPC workshops adhere to the ACM SIGPLAN policies regarding programme committee contributions and republication. Any paper submitted must adhere to ACM SIGPLAN's republication policy. PC member submissions are welcome, but will be reviewed to a higher standard. http://www.sigplan.org/Resources/Policies/Review http://www.sigplan.org/Resources/Policies/Republication Travel Support: =============== Student attendees with accepted papers can apply for a SIGPLAN PAC grant to help cover travel expenses. PAC also offers other support, such as for child-care expenses during the meeting or for travel costs for companions of SIGPLAN members with physical disabilities, as well as for travel from locations outside of North America and Europe. For details on the PAC programme, see its web page (http://www.sigplan.org/PAC.htm) Programme Committee: ==================== Umut Acar (co-chair), Carnegie Mellon U., PA, USA Arvind, MIT, MA, USA Jost Berthold (co-chair), U. of Copenhagen, Denmark Guy Blelloch, Carnegie Mellon U., PA, USA Hassan Chafi, Oracle Labs, CA, USA Dan Spoonhower, Google, CA, USA Sergei Gorlatch, U. Münster, Germany Clemens Grelck, U. of Amsterdam, Netherlands Vinod Grover, NVidia, USA Torsten Grust, U.Tübingen, Germany Zhenjiang Hu, National Inst. of Informatics, Tokyo, Japan Gabriele Keller, U.New South Wales, Sydney, Australia Jens Palsberg, U.California, CA, USA Leaf Peterson, Intel, USA Mike Rainey, MPI-SWS,Kaiserslautern, Germany Suresh Jagannathan, Purdue U., USA Sven-Bodo Scholz, Heriot-Watt U., Edinburgh, UK Guy Steele, Oracle Labs, Burlington, MA, USA Yaron Minsky, Jane Street Capital, NY, USA General Chairs: ==================== Clemens Grelck, University of Amsterdam, NL Fritz Henglein, University of Copenhagen, DK

1 0

Call for Participation: Workshop on Haskell and Rewriting Techniques (June 27, Eindhoven)
by Johannes Waldmann 28 May '13

28 May '13

The list of accepted papers, and preliminary schedule, for the first International Workshop on Haskell And Rewriting Techniques (June 27, Eindhoven/NL, as part of RDP 2013) is available from the workshop web site http://www.imn.htwk-leipzig.de/HART2013/ Register soon - RDP early registration deadline is June 1! Best regards - Kristoffer H Rose and Johannes Waldmann.

1 0

ANN: Haskell Platform 2013.2.0.0
by Mark Lentczner 28 May '13

28 May '13

On behalf of the Haskell Platform team, I'm happy to announce the release of Haskell Platform 2013.2.0.0 *featuring* GHC 7.6.3 52 packages 650+ public modules 4 tools *New packages this release:* attoparsec case-insensitive hashable unordered-containers *and a major upgrade to* OpenGL and GLUT Get it now: Download Haskell Platform <http://www.haskell.org/platform/index.html> — for Windows <http://www.haskell.org/platform/windows.html> — for Mac OS X <http://www.haskell.org/platform/mac.html> — for Linux <http://www.haskell.org/platform/linux.html> (distributions updating soon) *N.B.: You will likely need to explicitly re-fresh those links when visiting in your browser - those pages tend to get cached for very long periods of time.* — Mark "platform wrangler" Lentczner

1 0

Call for Papers IFL 2013
by publicityifl＠gmail.com 27 May '13

27 May '13

Hello, Please, find below the first call for papers for IFL 2013. Please forward these to anyone you think may be interested. Apologies for any duplicates you may receive. best regards, Jurriaan Hage Publicity Chair of IFL CALL FOR PAPERS 25th SYMPOSIUM ON IMPLEMENTATION AND APPLICATION OF FUNCTIONAL LANGUAGES - IFL 2013 RADBOUD UNIVERSITY NIJMEGEN, THE NETHERLANDS ACM In-Cooperation / ACM SIGPLAN AUGUST 28 - 30 2013 "Landgoed Holthurnsche Hof" http://ifl2013.cs.ru.nl We are proud to announce that the 25th edition of the IFL series returns to its roots at the Radboud University Nijmegen in the Netherlands. The symposium is held from 28th to 30th of August 2013. 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 2013 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 2013 will use a post-symposium review process to produce the formal proceedings which will be published in the ACM Digital Library. All participants of IFL 2013 are invited to submit either a draft paper or an extended abstract describing work to be presented at the symposium. At no time may work submitted to IFL be simultaneously submitted to other venues; submissions must adhere to ACM SIGPLAN's republication policy: http://www.sigplan.org/Resources/Policies/Republication 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. Hence, publications that appear only in the draft proceedings do not count as publication for the ACM SIGPLAN republication policy. 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. Invited Speaker --------------- Lennart Augustsson, currently employed by the Standard Chartered Bank, well-known for his work on Haskell, parallel Haskell, Cayenne, and Bluespec, is the invited speaker of IFL 2013. He will be talking about practical applications of functional programming. Submission Details ------------------ Submission deadline draft papers: July 31 Notification of acceptance for presentation: August 2 Early registration deadline: August 7 Late registration deadline: August 14 Submission deadline for pre-symposium proceedings: August 21 25th IFL Symposium: August 28-30 Submission deadline for post-symposium proceedings: November 11 Notification of acceptance for post-symposium proceedings: December 18 Camera-ready version for post-symposium proceedings: February 3 2014 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. Papers must adhere to the standard ACM two columns conference format. For the pre-symposium proceedings we adopt a 'weak' page limit of 12 pages. For the post-symposium proceedings the page limit of 12 pages is firm. A suitable document template for LaTeX can be found at: http://www.acm.org/sigs/sigplan/authorInformation.htm Papers are to be submitted via the conference's EasyChair submission page: https://www.easychair.org/conferences/?conf=ifl2013 Topics ------ IFL welcomes submissions describing practical and theoretical work as well as submissions describing applications and tools in the context of functional programming. If you are not sure whether your work is appropriate for IFL 2013, please contact the PC chair at rinus(a)cs.ru.nl. Topics of interest include, but are not limited to: language concepts type systems, type checking, type inferencing compilation techniques staged compilation run-time function specialization run-time code generation partial evaluation (abstract) interpretation metaprogramming generic programming automatic program generation array processing concurrent/parallel programming concurrent/parallel program execution embedded systems web applications (embedded) domain specific languages security novel memory management techniques run-time profiling performance measurements debugging and tracing virtual/abstract machine architectures validation, verification of functional programs tools and programming techniques (industrial) applications 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 ------------------- Thomas Arts, Quviq, Gothenburg, Sweden Andrew Butterfield, Trinity College, Dublin, Ireland Edwin Brady, University of St. Andrews, UK Clemens Grelck, University of Amsterdam, Netherlands Adam Granicz, IntelliFactory, Budapest, Hungary Jeremy Gibbons, University of Oxford, UK Fritz Henglein, University of Copenhagen, Denmark Stephan Herhut, Intel Labs, Santa Clara, US Ralf Hinze (co-chair), University of Oxford, UK Zoltán Horváth, Eötvös Loránd University, Budapest, Hungary Zhenjiang Hu, University of Tokyo, Japan Mauro Jaskelioff, Universidad Nacional de Rosario, Argentina Johan Jeuring, University of Utrecht, Netherlands Rita Loogen, University of Marburg, Germany Marco T. Morazán, Seton Hall University, New Jersey, US Dominic Orchard, University of Cambridge, UK Rinus Plasmeijer (chair), Radboud University Nijmegen, Netherlands Tim Sheard, Portland State University, US Sam Tobin-Hochstadt, Northeastern University / Indiana University, US Peter Thiemann, University of Freiburg, Germany Simon Thompson, University of Kent, UK Venue ----- The 25th IFL is organized by the Radboud University Nijmegen, Model Based Software Development Department at the Nijmegen Institute for Computing and Information Sciences. The event is held in the Landgoed Holthurnsche Hof, a rural estate in the woodlands surrounding Nijmegen. It can be reached quickly and easily by public transport.

1 0