- Haskell - Haskell.org

repa not running in parallel?
by Alexander Herz 07 Nov '13

07 Nov '13

Hi, I'm new to haskell and I tried to reproduce the perfomance values from the paper "Regular, Shape-polymorphic, Parallel Arrays in Haskell". I modified the repa-mmult example from the repa-example package to use the mmultP from Data.Array.Repa.Algorithms.Matrix. Then I compile it with "ghc -threaded -fglasgow-exts -O Main.hs" but running it with two large matrices : "./Main -random 4096 4096 -random 4096 4096" I can see that only one of my 4 cpus is utilized. What am I doing wrong? Note: The unmodified repa-example also does not run in parallel. Thx, Alex

4 4

Haskell Weekly News: Issue 285
by Daniel Santa Cruz 07 Nov '13

07 Nov '13

Welcome to issue 285 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the weeks of October 20 to November 02, 2013. Quotes of the Week * roconnor: edwardk: is comonad Haskell 1.4? I liked Haskell 1.4. * Peaker: Don't trust the @src, luke * dmwit: If it fits in a tweet, you haven't included enough information to debug it yet. Top Reddit Stories * The Haskell Cast #3 - Simon Peyton Jones on GHC Domain: haskellcast.com, Score: 88, Comments: 11 On Reddit: [1] http://goo.gl/0sGzlg Original: [2] http://goo.gl/wQ4FKi * Elm 0.10 released: faster strings, nice colors, bug fixes, and searchable documentation Domain: elm-lang.org, Score: 74, Comments: 9 On Reddit: [3] http://goo.gl/HJ2fc7 Original: [4] http://goo.gl/xFJJMN * Procrustean Mathematics by Edward Kmett Domain: fpcomplete.com, Score: 71, Comments: 17 On Reddit: [5] http://goo.gl/AsB0CM Original: [6] http://goo.gl/E1iDNM * Haskell hurdle: uninteresting world Domain: gundersen.net, Score: 68, Comments: 58 On Reddit: [7] http://goo.gl/W8l3T1 Original: [8] http://goo.gl/uBVp1f * websockets-0.8 released: with browser shell example + bonus section on pipes vs. conduit vs. io-streams Domain: jaspervdj.be, Score: 65, Comments: 9 On Reddit: [9] http://goo.gl/0XvXZa Original: [10] http://goo.gl/eUDMn1 * IHaskell: Haskell for Interactive Computing Domain: gibiansky.github.io, Score: 61, Comments: 26 On Reddit: [11] http://goo.gl/ZpNpq8 Original: [12] http://goo.gl/A8iccI * ShellCheck – static analysis and linting tool for sh/bash script Domain: shellcheck.net, Score: 55, Comments: 10 On Reddit: [13] http://goo.gl/z0giaP Original: [14] http://goo.gl/zF3DLB * Micro-tutorial: liftM by accident Domain: self.haskell, Score: 54, Comments: 29 On Reddit: [15] http://goo.gl/d6ReRs Original: [16] http://goo.gl/d6ReRs * Barclays are hiring: Haskell developers in London and Kiev Domain: self.haskell, Score: 52, Comments: 14 On Reddit: [17] http://goo.gl/Fq7JPE Original: [18] http://goo.gl/Fq7JPE * License monads Domain: joeyh.name, Score: 52, Comments: 18 On Reddit: [19] http://goo.gl/oZ9La1 Original: [20] http://goo.gl/9C1Stp * Show Reddit: My weekend project, PureScript Domain: functorial.com, Score: 49, Comments: 61 On Reddit: [21] http://goo.gl/sRx1Eh Original: [22] http://goo.gl/TJBCYN * Deamortized ST by Edward Kmett Domain: fpcomplete.com, Score: 49, Comments: 57 On Reddit: [23] http://goo.gl/Vck3Ij Original: [24] http://goo.gl/wtaueO * HaLVM 2.0 Developer's Release (trans: buggy but API-stable pre-release) now available for folks to try. GHC 7.8, threaded RTS, SMP HaLVM support, 0-copy networking, and more. Domain: community.galois.com, Score: 44, Comments: 13 On Reddit: [25] http://goo.gl/5Psg7B Original: [26] http://goo.gl/xQFUA2 * Could you explain why complexity of monadic IO is worth it? Domain: self.haskell, Score: 43, Comments: 128 On Reddit: [27] http://goo.gl/esFCc4 Original: [28] http://goo.gl/esFCc4 * London Haskell User Group 18/09/2013: Oliver Charles on pipes [video] Domain: ocharles.org.uk, Score: 42, Comments: 14 On Reddit: [29] http://goo.gl/8kDKnw Original: [30] http://goo.gl/hi3L3P * C-- as a project separate from GHC Domain: cminusminus.org, Score: 42, Comments: 14 On Reddit: [31] http://goo.gl/fvUjIk Original: [32] http://goo.gl/VueAA * How to start a new Haskell project Domain: jabberwocky.eu, Score: 42, Comments: 26 On Reddit: [33] http://goo.gl/6dRRXn Original: [34] http://goo.gl/btWJYS * The let-no-escape optimization Domain: lambda.jstolarek.com, Score: 41, Comments: 1 On Reddit: [35] http://goo.gl/l8xhuP Original: [36] http://goo.gl/J8uekI * Improving Applicative do-notation Domain: tmorris.net, Score: 40, Comments: 150 On Reddit: [37] http://goo.gl/MXoPdz Original: [38] http://goo.gl/y1I8Tx * Odersky: The Trouble with Types - Strange Loop 2013 [InfoQ] Domain: infoq.com, Score: 39, Comments: 55 On Reddit: [39] http://goo.gl/5QEJfz Original: [40] http://goo.gl/Ir4kwG Top StackOverflow Questions * Haskell Thrift library 300x slower than C++ in performance test votes: 34, answers: 5 Read on SO: [41] http://goo.gl/timvYf * Creating methods bound to records in Haskell votes: 10, answers: 1 Read on SO: [42] http://goo.gl/4E4Sgh * Installing & Building GHC with OSX Mavericks GHC votes: 10, answers: 1 Read on SO: [43] http://goo.gl/44PIaj * How to properly communicate compile-time information to Template Haskell functions? votes: 10, answers: 0 Read on SO: [44] http://goo.gl/YQkGbl * Data.Text vs String votes: 9, answers: 2 Read on SO: [45] http://goo.gl/ttjnJ1 * Why is matrix multiplication faster with Repa than with hmatrix? votes: 9, answers: 1 Read on SO: [46] http://goo.gl/e36toD * Efficient functional algorithm for computing closure under an operator votes: 8, answers: 1 Read on SO: [47] http://goo.gl/538Yyr * Why doesn't Haskell sequence these IO actions properly? votes: 8, answers: 2 Read on SO: [48] http://goo.gl/82PZYb * Is there a way to make my word counting program faster without using impure tricks? votes: 8, answers: 1 Read on SO: [49] http://goo.gl/F3OiUk * Is it better to define Functor in terms of Applicative in terms of Monad, or vice versa? votes: 8, answers: 3 Read on SO: [50] http://goo.gl/xEkVIf * Standard Haskell function :: (a -> Maybe b) -> [a] -> Maybe b votes: 8, answers: 3 Read on SO: [51] http://goo.gl/JdA5Xf * Why are cabal reinstalls “always dangerous”? votes: 8, answers: 1 Read on SO: [52] http://goo.gl/kCdUsL * How to use the maybe monoid and combine values with a custom operation, easily? votes: 8, answers: 3 Read on SO: [53] http://goo.gl/BpL8NK Until next time, [54]+Daniel Santa Cruz References 1. http://www.haskellcast.com/episode/003-simon-peyton-jones-on-ghc/ 2. http://www.reddit.com/r/haskell/comments/1pe8tj/the_haskell_cast_3_simon_pe… 3. http://elm-lang.org/blog/announce/0.10.elm 4. http://www.reddit.com/r/haskell/comments/1p43xx/elm_010_released_faster_str… 5. https://www.fpcomplete.com/user/edwardk/editorial/procrustean-mathematics 6. http://www.reddit.com/r/haskell/comments/1p85al/procrustean_mathematics_by_… 7. http://www.gundersen.net/functional-programming-hurdle-uninteresting-progra… 8. http://www.reddit.com/r/haskell/comments/1oyy54/haskell_hurdle_uninterestin… 9. http://jaspervdj.be/posts/2013-10-22-websockets-0.8.html 10. http://www.reddit.com/r/haskell/comments/1p0bey/websockets08_released_with_… 11. http://gibiansky.github.io/IHaskell/ 12. http://www.reddit.com/r/haskell/comments/1oxj6k/ihaskell_haskell_for_intera… 13. http://www.shellcheck.net/about.html 14. http://www.reddit.com/r/haskell/comments/1pg7ym/shellcheck_static_analysis_… 15. http://www.reddit.com/r/haskell/comments/1pd1ep/microtutorial_liftm_by_acci… 16. http://www.reddit.com/r/haskell/comments/1pd1ep/microtutorial_liftm_by_acci… 17. http://www.reddit.com/r/haskell/comments/1p70l3/barclays_are_hiring_haskell… 18. http://www.reddit.com/r/haskell/comments/1p70l3/barclays_are_hiring_haskell… 19. http://joeyh.name/blog/entry/license_monads/ 20. http://www.reddit.com/r/haskell/comments/1plql7/license_monads/ 21. http://functorial.com/purescript/ 22. http://www.reddit.com/r/haskell/comments/1pkzd0/show_reddit_my_weekend_proj… 23. https://www.fpcomplete.com/user/edwardk/oblivious/deamortized-st 24. http://www.reddit.com/r/haskell/comments/1pnrqn/deamortized_st_by_edward_km… 25. http://community.galois.com/pipermail/halvm-devel/2013-October/000041.html 26. http://www.reddit.com/r/haskell/comments/1ot4ep/halvm_20_developers_release… 27. http://www.reddit.com/r/haskell/comments/1owtvs/could_you_explain_why_compl… 28. http://www.reddit.com/r/haskell/comments/1owtvs/could_you_explain_why_compl… 29. http://ocharles.org.uk/blog/posts/2013-10-23-pipes-talk.html 30. http://www.reddit.com/r/haskell/comments/1p1wrt/london_haskell_user_group_1… 31. http://www.cminusminus.org/ 32. http://www.reddit.com/r/haskell/comments/1pbbon/c_as_a_project_separate_fro… 33. http://jabberwocky.eu/2013/10/24/how-to-start-a-new-haskell-project/ 34. http://www.reddit.com/r/haskell/comments/1pdxcr/how_to_start_a_new_haskell_… 35. http://lambda.jstolarek.com/2013/10/let-no-escape/ 36. http://www.reddit.com/r/haskell/comments/1pi6fz/the_letnoescape_optimizatio… 37. http://tmorris.net/posts/applicative-do/index.html 38. http://www.reddit.com/r/haskell/comments/1ou06l/improving_applicative_donot… 39. http://www.infoq.com/presentations/data-types-issues 40. http://www.reddit.com/r/haskell/comments/1pjjy5/odersky_the_trouble_with_ty… 41. http://stackoverflow.com/questions/19512952/haskell-thrift-library-300x-slo… 42. http://stackoverflow.com/questions/19484232/creating-methods-bound-to-recor… 43. http://stackoverflow.com/questions/19579577/installing-building-ghc-with-os… 44. http://stackoverflow.com/questions/19679024/how-to-properly-communicate-com… 45. http://stackoverflow.com/questions/19608745/data-text-vs-string 46. http://stackoverflow.com/questions/19733382/why-is-matrix-multiplication-fa… 47. http://stackoverflow.com/questions/19485082/efficient-functional-algorithm-… 48. http://stackoverflow.com/questions/19513660/why-doesnt-haskell-sequence-the… 49. http://stackoverflow.com/questions/19535688/is-there-a-way-to-make-my-word-… 50. http://stackoverflow.com/questions/19635265/is-it-better-to-define-functor-… 51. http://stackoverflow.com/questions/19643664/standard-haskell-function-a-may… 52. http://stackoverflow.com/questions/19692644/why-are-cabal-reinstalls-always… 53. http://stackoverflow.com/questions/19706501/how-to-use-the-maybe-monoid-and… 54. https://plus.google.com/105107667630152149014/about

1 0

Internship at Facebook London working on Haxl
by Simon Marlow 04 Nov '13

04 Nov '13

We have an opening for an internship at Facebook London in 2014, working on the Haxl project. Our project is a mix of language/DSL design, tools, and systems programming, written in a combination of Haskell and C++. We’re looking for a candidate who will be able to explore some of the open problems with a view to producing a research publication. The ideal candidate: - Is a PhD student, preferably towards the end of their PhD. - Has a deep understanding of Haskell, and is not scared of C++. - Has research experience in a relevant area: systems programming with Haskell, or language and DSL design, for example. - Is fired up by the idea of solving interesting problems at scale. Timing: we are flexible on timing, the available start dates are Jan 6th, May 27th, July 7th, and September 2nd. Internships last 12 weeks. Any questions feel free to email me directly. To apply, please get in touch with Ruth McIntyre (ruth(a)fb.com) Cheers, Simon

1 0

Internship opportunities at Galois
by Adam Foltzer 01 Nov '13

01 Nov '13

Hello, Galois has some exciting opportunities for interns in software engineering and research for 2014. Most of our projects use Haskell to some extent, so this is a great chance to get experience applying functional programming to real-world problems. Please pass along this posting to anyone you think might be interested, even if they don't yet know Haskell! Thank you, Adam Foltzer --- # Galois Software Engineering/Research Intern # Galois is currently seeking software engineering and research interns for 2014 at all educational levels. We are committed to matching interns with exciting and engaging engineering work that fits their particular interests, creating lasting value for interns, Galois, and our community. A Galois internship is a chance to tackle cutting-edge, meaningful problems in a uniquely collaborative environment with world-leading researchers. Roles may include technology research and development, requirements gathering, implementation, testing, formal verification, and infrastructure development. Past interns have integrated formal methods tools into larger projects, built comprehensive validation suites, synthesized high-performance cryptographic algorithms, written autopilots for quad-copters, designed the syntax and semantics of scripting languages, and researched type system extensions for academic publication. We deeply believe in providing comprehensive support and mentorship to all of our employees, particularly interns. We provide our employees with a steward who regularly checks in to ensure that they feel welcome and safe in the Galois community while gaining real value from their experiences. ## About Galois ## Our mission is to create trustworthiness in critical systems. We're in the business of taking blue-sky ideas and turning them into real-world technology solutions. We've been developing real-world systems for over ten years using functional programming, language design, and formal methods. Galois values diversity. We believe that differing viewpoints and experiences are essential to the process of innovation. We look broadly, including outside of established communities, to deliver innovation. ## How to Prepare ## An internship is an opportunity for learning and growth as an engineer. To make the most of the opportunity, we ask that candidates have experience reading, writing, and maintaining code in a realistic project. Many university courses involve multi-week collaborative projects that provide this type of experience. Most of our projects use the Haskell programming language and the git version control system. These tools aren't often taught in computer science classes, but there are many free resources available that we recommend for learning: - [Learn You a Haskell for Great Good!] [1] by Miran Lipovača - [Real World Haskell] [2] by Bryan O'Sullivan, Don Stewart, and John Goerzen - [tryGit] [3] by Code School - [Pro Git] [4] by Scott Chacon [1]: http://learnyouahaskell.com/ [2]: http://book.realworldhaskell.org/ [3]: http://try.github.io [4]: http://git-scm.com/book ## Qualifications ## - The ability to be geographically located in Portland during the internship - Experience reading, writing, and maintaining code in a project as described above - Proficiency in software development practices such as design, documentation, testing, and the use of version control - Well-developed verbal and written communication skills; comfort in a collaborative team environment The following skills are not required, but may be relevant to a particular project. - Proficiency in Haskell or other programming languages with rich type systems (eg., OCaml, Standard ML, Scala) - Experience using C and assembly languages for low-level systems programming - Development experience in high assurance systems or security software - Specific experience in an area of Galois' expertise, such as: - Assured information sharing - Software modelling and formal verification - Cyber-physical systems and control systems - Operating systems, virtualization and secure platforms - Networking and mobile technology - Cyber defense systems - Scientific computing - Program analysis and software evaluation - Web security ## Logistics ## The length and start date of the internship are negotiable: starting any time from the new year through next fall is acceptable, but an intern must be at Galois for at least three continuous months. The internship is paid competitively, and interns are responsible for living arrangements (although we can certainly help you find arrangements). Galois is located in the heart of downtown Portland with multiple public transportation options available and world-class bicycle infrastructure. ## Application Details ## Send an email to careers(a)galois.com with the subject line "Internship 2014" with the following contents: - Email body: a brief plain-text note explaining your interests, experience, and other relevant details - Attachment: CV/Resume (PDF, plain text, or markdown only) **Applications must be received at least two months before the desired start date**. For example, we must receive your application by November 6, 2013, if you wish to start on January 6, 2014.

1 0

ICFP 2014: Call for Workshop & Co-located Event Proposals
by David Van Horn 30 Oct '13

30 Oct '13

CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS ICFP 2014 19th ACM SIGPLAN International Conference on Functional Programming August 31 – September 6, 2014 Gothenburg, Sweden http://icfpconference.org/icfp2014/ The 19th ACM SIGPLAN International Conference on Functional Programming will be held in Gothenburg, Sweden on August 31-September 6, 2014. ICFP provides a forum for researchers and developers to hear about the latest work on the design, implementations, principles, and uses of functional programming. Proposals are invited for workshops (and other co-located events, such as tutorials) to be affiliated with ICFP 2014 and sponsored by SIGPLAN. These events should be less formal and more focused than ICFP itself, include sessions that enable interaction among the attendees, and foster the exchange of new ideas. The preference is for one-day events, but other schedules can also be considered. The workshops are scheduled to occur on August 31 (the day before ICFP) and September 4-6 (the three days after ICFP). ---------------------------------------------------------------------- Submission details Deadline for submission: November 15, 2013 Notification of acceptance: December 15, 2013 Prospective organizers of workshops or other co-located events are invited to submit a completed workshop proposal form in plain text format to the ICFP 2014 workshop co-chairs (Sam Tobin-Hochstadt and Tom Schrijvers), via email to icfp2014-workshops(a)ugent.be by November 15, 2013. (For proposals of co-located events other than workshops, please fill in the workshop proposal form and just leave blank any sections that do not apply.) Please note that this is a firm deadline. Organizers will be notified if their event proposal is accepted by December 15, 2013, and if successful, depending on the event, they will be asked to produce a final report after the event has taken place that is suitable for publication in SIGPLAN Notices. The proposal form is available at: http://www.icfpconference.org/icfp2014/icfp14-workshops-form.txt Further information about SIGPLAN sponsorship is available at: http://acm.org/sigplan/sigplan_workshop_proposal.htm ---------------------------------------------------------------------- Selection committee The proposals will be evaluated by a committee comprising the following members of the ICFP 2014 organizing committee, together with the members of the SIGPLAN executive committee. Workshop Co-Chair: Sam Tobin-Hochstadt (Indiana University) Workshop Co-Chair: Tom Schrijvers (Ghent University) General Chair : Johan Jeuring (Utrecht University) Program Chair: Manuel Chakravarty (University of New South Wales) ---------------------------------------------------------------------- Further information Any queries should be addressed to the workshop co-chairs (Sam Tobin-Hochstadt and Tom Schrijvers), via email to icfp2014-workshops(a)ugent.be.

1 0

ANNOUNCE: lens-family 1.0.0
by roconnor＠theorem.ca 30 Oct '13

30 Oct '13

Before there was lens there was lens-family.... I'm pleased to announce the second major release of the lens-family pacakges: lens-family-core-1.0.0 and lens-family-1.0.0. They can be found at * <http://hackage.haskell.org/package/lens-family-core> * <http://hackage.haskell.org/package/lens-family> I consider these packages to be kiddie-pool sized lens libraries for those people who are, for whatever reason, too intimidated by the lens library. I think this is a good way to get one's feet wet with lenses. The type for lenses and traversals are completely compatible with the lens library. This release brings two major developments to lens-family: * Support for traversals and folds. * The names have been all renamed to be mostly compatible with the lexicon developed by lens. With a common lexicon, I hope that users will find it easy to transition from lens-family to lens when they outgrow the kiddie pool. The lens-family-core package is a completely Haskell 98 package for those who need the compatibility. The lens-family package is a wrapper around lens-family-core that provides a few useful Rank 2 type synonyms to make using functional references a little easier. P.S. If edwardk is reading, I've used Ryan Ingram's definition from <http://twanvl.nl/blog/haskell/cps-functional-references#comment-comment0> to implement alongside so that it works for both lenses and getters. You probably want to do the same. -- Russell O'Connor <http://r6.ca/> ``All talk about `theft,''' the general counsel of the American Graphophone Company wrote, ``is the merest claptrap, for there exists no property in ideas musical, literary or artistic, except as defined by statute.''

1 0

Call for Contributions - Haskell Communities and Activities Report, November 2013 edition
by Janis Voigtlaender 29 Oct '13

29 Oct '13

[Transition in editorship of HCAR in progress!] Dear all, We would like to collect contributions for the 25th edition of the ================================================================ Haskell Communities & Activities Report http://www.haskell.org/haskellwiki/Haskell_Communities_and_Activities_Report Submission deadline: 1 Nov 2013 (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 us, so that we 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 previous edition --- you will find interesting projects 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, Mihai Maruseac and Janis Voigtlaender (for this edition) 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/11-2013/template.tex There is also a LaTeX style file at http://haskell.org/communities/11-2013/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 soon receive your old entry as a template (provided we 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 use lhs2tex syntax (http://www.andres-loeh.de/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. 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 simply ask us. 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. Q: If I do not update my entry, but want to keep it in the report, what should I do? A: Tell us 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 its destination, and not ended up in a spam folder? A: Prior to publication of the final report, we will send a draft to all contributors, for possible corrections. So if you do not hear from us within two weeks after the deadline, it is safer to send another mail and check whether your first one was received.

2 1

Vacancy Professor Software Technology
by Johan Jeuring 28 Oct '13

28 Oct '13

Dear colleague, Want to teach and do research in an exciting environment, in the fourth most happy city on earth (http://www.bbc.com/travel/feature/20131022-living-in-the-worlds-happiest-pl… Or do you think a colleague might be a suitable candidate? Let us know. We have a vacancy for: Full Professor Software Technology (0.8 – 1.0 fte) The full professor directs and supervises research in the field of software technology, specifically in the design and development of formalisms and methodologies for effective program construction and program analysis. She or he develops new initiatives, aiming at research programs in software technology that are relevant for software systems in general and for the departmental focus domain of game technology. This includes the acquisition of external research funds at the national and international level, and the dissemination, of research results and its applications, to the relevant research communities. The initiatives should be developed in line with worldwide trends in software technology such as software generation, domain-specific languages, and multi-core programming. The full professor has a leading role in teaching and supervision. She or he contributes to the department’s curriculum development at all levels: BSc, MSc, and PhD. The full professor plays an active role in the leadership and administrative duties of the Division of Software Systems, the Department and/or Faculty. Profile Candidates must have an excellent track record in research, teaching and leadership, as exemplified by: Research: • A PhD degree in Computer Science or a closely related scientific field. • An excellent publication record, including papers in high-impact journals and conference proceedings. • Proven ability to obtain extramural funding for research and to provide leadership in collaborative research programs. Teaching: • Experience and enthusiasm for teaching and student supervision. • Experience and leadership in curriculum development. • Academic leadership: • An active role in leading (national and international) activities in the area of the chair and participation in academic communities. • An established international network of research partnerships with other leading research groups and institutions. • Experience in administrative roles at department or faculty level. Utrecht University employs a system of quality assessment for teaching and research with consequences for career development. This implies that, in addition to having a PhD in a relevant field of research, a successful candidate also possesses appropriate senior level academic teaching and research qualifications. The Faculty may use an assessment as an instrument in the selection procedure. We offer a permanent position as full professor at 0.8 – 1.0 fte. The gross salary depends on qualifications and experience, and ranges between € 5,003.- and € 7,285.- per month (salary scale H2, of the Collective Labour Agreement of the Dutch Universities). 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: an excellent pension scheme, a partially paid parental leave, and flexible employment conditions. Conditions are based on the Collective Labour Agreement Dutch Universities. More information about terms of employment: http://www.uu.nl/EN/informationfor/jobseekers/Working-for-Utrecht-Universit… About the department:§ The Department of Information and Computing Sciences (http://www.cs.uu.nl/) has a strong national and international reputation in computer science and in information science. The department’s research activities are clustered into four divisions, viz. Software Systems, Artificial Intelligence, Virtual Worlds, and Interaction Technology. Each division is specialized in a specific research area within computer science and contributes from this area to the department’s overall focus on Game Technology. The focus area of Game Technology deals with all technological aspects of games, and of interactive virtual experiences more in general; Game Technology constitutes one of the four strategic research themes of the Faculty of Science. While the research activities of the four computer-science divisions meet in the Game Technology area, research is not restricted to games application. Through collaboration with (often external) partners, the various divisions also connect with the other strategic research themes of the university, viz. life sciences, sustainability, and youth and identity. The Department of Information and Computing Sciences offers educational bachelor programs in computer science and information science, and three (English) research master programs, viz. Computing Science, Game and Media Technology, and Business Informatics; the Department is further involved in the master program Artificial Intelligence. Three years ago the Department introduced a track on Game Technology in the bachelor program in computer science, which led to a substantial annual increase of bachelor students. The bachelor programs are the largest computer science and information science programs in the Netherlands. Utrecht University is among Europe’s largest and most prominent institutions for research and education. The Faculty of Science consists of six departments: Information & Computing Sciences, Mathematics, Physics & Astronomy, Chemistry, Biology, and Pharmaceutical Sciences. The Faculty is home to 3500 students and nearly 2000 staff members and is internationally renowned for the quality of its research and its teaching. The Faculty’s academic programs reflect the developments in science and society today. Its Undergraduate School and Graduate Schools in Natural Sciences and Life Sciences guarantee the outstanding quality of its BSc, MSc, and PhD programs. More information A more detailed description of the chair can be found here: http://www.cs.uu.nl/vacatures/auxdoc/SoftwTechn/StructReport2013WWW.pdf. For additional information and documentation please contact the Secretary of the Search Committee: Dr Marinus Veldhorst, email: M.Veldhorst(a)uu.nl, telephone +31 30 253 4450. As part of the selection procedure, the candidate is expected to give an outline of his/her research statement and an oral presentation. Applications including a letter of motivation in which the candidate’s research and teaching vision are outlined, a CV with a list of publications, a research statement, and contact details of at least three references, must be submitted before January 5, 2014. Apply before 05/01/2014 on http://ssl1.peoplexs.com/Peoplexs22/CandidatesPortalNoLogin/ApplicationForm… -------------------------------- Johan Jeuring Professor of Software Technology for Learning and Teaching Department of Information and Computing Sciences Utrecht University The Netherlands http://www.staff.science.uu.nl/~jeuri101/homepage/ J.T.Jeuring(a)uu.nl

1 0

WRLA 2014 Call for papers
by Santiago Escobar 27 Oct '13

27 Oct '13

10th International Workshop on Rewriting Logic and its Applications WRLA 2014 Grenoble, France, April 5th and 6th, 2014 http://www.dsic.upv.es/workshops/wrla2014/ The workshop will be held in conjunction with ETAPS 2014 17th European Joint Conferences on Theory and Practice of Software April 5-13, 2014 http://www.etaps.org/2014 AIMS AND SCOPE Rewriting logic (RL) is a natural model of computation and an expressive semantic framework for concurrency, parallelism, communication, and interaction. It can be used for specifying a wide range of systems and languages in various application fields. It also has good properties as a metalogical framework for representing logics. In recent years, several languages based on RL (ASF+SDF, CafeOBJ, ELAN, Maude) have been designed and implemented. The aim of the workshop is to bring together researchers with a common interest in RL and its applications, and to give them the opportunity to present their recent works, discuss future research directions, and exchange ideas. The topics of the workshop comprise, but are not limited to, - foundations and models of RL; - languages based on RL, including implementation issues; - RL as a logical framework; - RL as a semantic framework, including applications of RL to - object-oriented systems, - concurrent and/or parallel systems, - interactive, distributed, open ended and mobile systems, - specification of languages and systems; - use of RL to provide rigorous support for model-based software engineering; - formalisms related to RL, including - real-time and probabilistic extensions of RL, - rewriting approaches to behavioral specifications, - tile logic; - verification techniques for RL specifications, including - equational and coherence methods, - verification of properties expressed in first-order, higher-order, modal and temporal logics, - narrowing-based analysis and verification; - comparisons of RL with existing formalisms having analogous aims; - application of RL to specification and analysis of - distributed systems, - physical systems. IMPORTANT DATES Submission deadline December 30th 2013 Author notification February 2nd 2014 Version informal proceedings February 14th 2014 SUBMISSIONS The final program of the workshop will include regular papers, tool papers, and work-in-progress presentations. The program will also contain invited talks to be determined by the program committee. Papers must contain original contributions, be clearly written, include appropriate references, and comparison with related work. They must be unpublished and not submitted simultaneously for publication elsewhere. Tool papers present a new tool, a new tool component, or novel extensions to an existing tool. They should provide a short description of the theoretical foundations with relevant citations, emphasize the design and implementation, and give a clear account of the tool's functionality. The described tools must be publicly available via the web. All submissions should be formatted according to the guidelines for Springer LNCS papers, and should be submitted electronically using EasyChair. Regular papers and work-in-progress should not exceed 15 pages including references. Tool papers can have a maximum of 6 pages including references and may have an appendix of up to 4 additional pages with usage details and tool demonstration. PROCEEDINGS All submissions will be evaluated by the Program Committee. Regular papers, tool papers, and work-in-progress that are accepted will be presented at the workshop and included in the proceedings, which will be available during the workshop. Regular papers, tool papers, and invited presentations will also be published in a volume in Springer's Lecture Notes in Computer Science (LNCS) series to be distributed after the workshop. Depending on the number and the quality of the contributions, we will consider the preparation of a special issue in some scientific journal in the field with extended versions of a selection of the papers of the workshop. CONTACT INFORMATION For more information, please contact the organizers sescobar(a)dsic.upv.es or visit the workshop web page http://www.dsic.upv.es/workshops/wrla2014/

1 0

Relational & Algebraic Methods --- RAMiCS 2014 --- Final CFP, with Deadlines extended!
by Wolfram Kahl 26 Oct '13

26 Oct '13

14th International Conference on Relational and Algebraic Methods in Computer Science RAMiCS 2014 FINAL CALL FOR PAPERS, with DEADLINE EXTENSION 27 April to 1 May 2014, Marienstatt im Westerwald, Germany URL: http://mathcs.chapman.edu/ramics2014 PDF: http://mathcs.chapman.edu/ramics2014/RAMiCS14-CFP.pdf Invited Speakers ---------------- * C.A.R. Hoare (Microsoft Research Cambridge) * Alexander Kurz (University of Leicester) * Jose Oliveira (Universidade do Minho) Important Dates --------------- Title and abstract submission: November 1 2013 (anywhere on Earth) Submission of full papers: November 9 2013 (anywhere on Earth) Notification: December 16 2013 Final versions due (firm deadline): January 17 2014 Conference April 27 - May 1 2014 Scope ----- We invite submissions in the general area of Relational and Algebraic Methods in Computer Science. Special focus will lie on formal methods for software engineering, logics of programs and links with neighbouring disciplines. Particular topics of interest for the conference cover, but are not limited to: * Algebraic approaches to • specification, development, verification, and analysis of programs and algorithms • computational logic, in particular logics of programs, modal and dynamic logics, interval and temporal logics • semantics of programming languages * Applications in fields such as • relational formal methods such as B or Z, tabular methods • information systems • graph theory and combinatorial optimisation • games, automata and language theory • spatio-temporal reasoning, knowledge acquisition • preference and scaling methods, computational social choice, social software * Theoretical foundations and supporting tools, including • mechanised and automated reasoning, decision procedures • process algebras, fixed point calculi, idempotent semirings, quantales, allegories • dynamic algebras, cylindric algebras and their applications in computing History ------- Since 1994, the RelMiCS meetings on Relational Methods in Computer Science have been a main forum for researchers who use the calculus of relations and similar algebraic formalisms as methodological and conceptual tools. The AKA workshop series on Applications of Kleene algebra started with a Dagstuhl seminar in 2001 and was co-organised with the RelMiCS conference until 2009. Since 2011, joint RAMiCS conferences continue to encompass the scope of both RelMiCS and AKA. The predecessors of this conference were held in Dagstuhl (January 1994), Parati (September 1995), Hammamet (January 1997), Warsaw (September 1998), Québec (January 2000), Dagstuhl (February 2001), Oisterwijk (October 2001), Malente (April 2003), St. Catherines (January 2005), Manchester (September 2006), Frauenwörth (April 2008), Doha (November 2009), Rotterdam (June 2011), and Cambridge UK (September 2012). Student Program --------------- The conference will be accompanied by a PhD training program. Details will be published in due time in a special call and on the conference website. Proceedings and Submission -------------------------- All papers will be formally reviewed. The proceedings will be published in the Springer series Lecture Notes in Computer Science, ready at the conference. Submissions must be in English, in Postscript or PDF format, and provide sufficient information to judge their merits. They must be unpublished and not submitted for publication elsewhere. They should not exceed 16 pages in Springer LNCS style (accepted papers must be produced with LaTeX). Additional material may be provided by a clearly marked appendix or a reference to a manuscript on a website. This may be considered at the discretion of the PC. Deviation from these requirements may cause immediate rejection. One author of each accepted paper is expected to present the paper at the conference. Submission is via EasyChair at the following address: https://www.easychair.org/conferences/?conf=ramics2014 Formatting instructions and the LNCS styled files can be obtained via: http://springer.de/comp/lncs/authors.html As for the earlier conferences of this series, it is also intended to publish a selection of the best papers in revised and extended form in a special issue of the Journal of Logic and Algebraic Programming (JLAP). Programme Committee ------------------- Rudolf Berghammer (Kiel, Germany) Jules Desharnais (Laval U., Canada) Harrie de Swart (Rotterdam, Netherlands) Marc Frappier (Sherbrooke, Canada) Hitoshi Furusawa (Kagoshima, Japan) Timothy G. Griffin (Cambridge, UK) Walter Guttmann (Canterbury, New Zealand) Robin Hirsch (London, UK) Peter Höfner (NICTA, Australia; Publicity chair) Ali Jaoua (Doha, Qatar) Peter Jipsen (Chapman U., USA; PC co-chair) Wolfram Kahl (McMaster U., Canada; PC co-chair) Tadeusz Litak (Erlangen, Germany) Larissa Meinicke (U. Queensland, Australia) Szabolcs Mikulas (London, UK) Bernhard Möller (Augsburg, Germany) Martin E. Müller (St. Augustin, Germany; General chair) José Oliveira (U. Minho, Portugal) Ewa Orłowska (Warsaw, Poland) Matthew Parkinson (Microsoft Research, UK) Damien Pous (CNRS, France) Ingrid Rewitzky (Stellenbosch, South Africa) Holger Schlingloff (Berlin, Germany) Gunther Schmidt (Munich, Germany) Renate Schmidt (Manchester, UK) Georg Struth (Sheffield, UK) George Theodorakopoulos (Cardiff, UK) Michael Winter (Brock U., Canada) Steering Committee ------------------ Rudolf Berghammer (Kiel, Germany) Jules Desharnais (Laval U., Canada) Harrie de Swart (Rotterdam, Netherlands) Ali Jaoua (Doha, Qatar) Bernhard Möller (Augsburg, Germany) Ewa Orłowska (Warsaw, Poland) Gunther Schmidt (Munich, Germany) Renate Schmidt (Manchester, UK) Michael Winter (Brock U., Canada) Organising Committee -------------------- Martin E. Müller, Sankt Augustin, Germany: Conference Chair, Local Organiser Peter Höfner, NICTA, Australia: Publicity Peter Jipsen, Chapman U., USA: PC Co-Chair Wolfram Kahl, McMaster U., Canada: PC Co-Chair

1 0