From Graham.Hutton at nottingham.ac.uk Wed Oct 1 17:04:10 2014 From: Graham.Hutton at nottingham.ac.uk (Graham Hutton) Date: Wed, 1 Oct 2014 18:04:10 +0100 Subject: [Haskell] Journal of Functional Programming - Call for PhD Abstracts Message-ID: ============================================================ CALL FOR PHD ABSTRACTS Journal of Functional Programming Deadline: 31st October 2014 http://tinyurl.com/jfp-phd-abstracts ============================================================ PREAMBLE: Many students complete PhDs in functional programming each year, but there is currently no common location in which to promote and advertise the resulting work. The Journal of Functional Programming would like to change that! As a service to the community, JFP recently launched a new feature, in the form of a regular publication of abstracts from PhD dissertations that were completed during the previous year. The abstracts are made freely available on the JFP website, i.e. not behind any paywall, and do not require any transfer for copyright, merely a license from the author. The first round of published abstracts can be downloaded from http://journals.cambridge.org/jfp/phd_abstracts. Please submit dissertation abstracts according to the instructions below. A dissertation is eligible if parts of it have or could have appeared in JFP, that is, if it is in the general area of functional programming. JFP will not have these abstracts reviewed. We welcome submissions from both the PhD student and PhD advisor/ supervisor although we encourage them to coordinate. ============================================================ SUBMISSION: Please submit the following information to Graham Hutton by 31st October 2014. o Dissertation title: (including any subtitle) o Student: (full name) o Awarding institution: (full name and country) o Date of PhD award: (month and year; depending on the institution, this may be the date of the viva, corrections being approved, graduation ceremony, or otherwise) o Advisor/supervisor: (full names) o Dissertation URL: (please provide a permanently accessible link to the dissertation if you have one, such as to an institutional repository or other public archive; links to personal web pages should be considered a last resort) o Dissertation abstract: (plain text, maximum 1000 words; you may use \emph{...} for emphasis, but we prefer no other markup or formatting in the abstract, but do get in touch if this causes significant problems) Please do not submit a copy of the dissertation itself, as this is not required. JFP reserves the right to decline to publish abstracts that are not deemed appropriate. ============================================================ PHD ABSTRACT EDITOR: Graham Hutton School of Computer Science University of Nottingham Nottingham NG8 1BB United Kingdom ============================================================ This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. This message has been checked for viruses but the contents of an attachment may still contain software viruses which could damage your computer system, you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation. From Graham.Hutton at nottingham.ac.uk Wed Oct 1 17:26:21 2014 From: Graham.Hutton at nottingham.ac.uk (Graham Hutton) Date: Wed, 1 Oct 2014 18:26:21 +0100 Subject: [Haskell] Journal of Functional Programming - Call for PhD Abstracts Message-ID: ============================================================ CALL FOR PHD ABSTRACTS Journal of Functional Programming Deadline: 31st October 2014 http://tinyurl.com/jfp-phd-abstracts ============================================================ PREAMBLE: Many students complete PhDs in functional programming each year, but there is currently no common location in which to promote and advertise the resulting work. The Journal of Functional Programming would like to change that! As a service to the community, JFP recently launched a new feature, in the form of a regular publication of abstracts from PhD dissertations that were completed during the previous year. The abstracts are made freely available on the JFP website, i.e. not behind any paywall, and do not require any transfer for copyright, merely a license from the author. The first round of published abstracts can be downloaded from http://journals.cambridge.org/jfp/phd_abstracts. Please submit dissertation abstracts according to the instructions below. A dissertation is eligible if parts of it have or could have appeared in JFP, that is, if it is in the general area of functional programming. JFP will not have these abstracts reviewed. We welcome submissions from both the PhD student and PhD advisor/ supervisor although we encourage them to coordinate. ============================================================ SUBMISSION: Please submit the following information to Graham Hutton by 31st October 2014. o Dissertation title: (including any subtitle) o Student: (full name) o Awarding institution: (full name and country) o Date of PhD award: (month and year; depending on the institution, this may be the date of the viva, corrections being approved, graduation ceremony, or otherwise) o Advisor/supervisor: (full names) o Dissertation URL: (please provide a permanently accessible link to the dissertation if you have one, such as to an institutional repository or other public archive; links to personal web pages should be considered a last resort) o Dissertation abstract: (plain text, maximum 1000 words; you may use \emph{...} for emphasis, but we prefer no other markup or formatting in the abstract, but do get in touch if this causes significant problems) Please do not submit a copy of the dissertation itself, as this is not required. JFP reserves the right to decline to publish abstracts that are not deemed appropriate. ============================================================ PHD ABSTRACT EDITOR: Graham Hutton School of Computer Science University of Nottingham Nottingham NG8 1BB United Kingdom ============================================================ This message and any attachment are intended solely for the addressee and may contain confidential information. If you have received this message in error, please send it back to me, and immediately delete it. Please do not use, copy or disclose the information contained in this message or in any attachment. Any views or opinions expressed by the author of this email do not necessarily reflect the views of the University of Nottingham. This message has been checked for viruses but the contents of an attachment may still contain software viruses which could damage your computer system, you are advised to perform your own checks. Email communications with the University of Nottingham may be monitored as permitted by UK legislation. From dstcruz at gmail.com Thu Oct 2 04:47:05 2014 From: dstcruz at gmail.com (Daniel Santa Cruz) Date: Wed, 1 Oct 2014 22:47:05 -0600 Subject: [Haskell] Haskell Weekly News: Issue 308 Message-ID: Welcome to issue 308 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from September 21 to 27, 2014 Quotes of the Week * No one @remember'd fun stuff in IRC -- sadness! Top Reddit Stories * The GHC source code contains 1088 TODOs, please help bring that number down Domain: self.haskell, Score: 137, Comments: 101 Original: [1] http://goo.gl/DHnNdB On Reddit: [2] http://goo.gl/DHnNdB * [Elm] "Controlling Time and Space: understanding the many formulations of FRP" by Evan Czaplicki Domain: youtube.com, Score: 77, Comments: 25 Original: [3] http://goo.gl/SbkmGf On Reddit: [4] http://goo.gl/FfTW7e * Visualisation of Haskell Performance (thesis, pdf) Domain: personal.leeds.ac.uk, Score: 72, Comments: 14 Original: [5] http://goo.gl/WabCEA On Reddit: [6] http://goo.gl/niC2Y6 * shell-conduit: Write shell scripts in Haskell with Conduit Domain: chrisdone.com, Score: 70, Comments: 22 Original: [7] http://goo.gl/VWLO6V On Reddit: [8] http://goo.gl/ekDZUP * Time travel made easy - Introducing Elm Reactor Domain: elm-lang.org, Score: 57, Comments: 0 Original: [9] http://goo.gl/TEqQWi On Reddit: [10] http://goo.gl/bN5iUk * THIS is why you should hire Haskellers Domain: fpcomplete.com, Score: 53, Comments: 36 Original: [11] http://goo.gl/VbO8xQ On Reddit: [12] http://goo.gl/DzLzyp * "Edwin Brady on Idris" in the Type Theory Podcast Domain: typetheorypodcast.com, Score: 50, Comments: 87 Original: [13] http://goo.gl/45jZKf On Reddit: [14] http://goo.gl/BdIYxZ * Neil Mitchell's Haskell Blog: GHCID Domain: neilmitchell.blogspot.com, Score: 50, Comments: 57 Original: [15] http://goo.gl/Z4MJA5 On Reddit: [16] http://goo.gl/dHuK3y * "Coder Decoder: Functional Programmer Lingo Explained" Domain: youtube.com, Score: 46, Comments: 10 Original: [17] http://goo.gl/Rv8Ihc On Reddit: [18] http://goo.gl/6jeI38 * Snake in haskell < 170 lines [My first haskell app] Domain: self.haskell, Score: 46, Comments: 42 Original: [19] http://goo.gl/lUDNr4 On Reddit: [20] http://goo.gl/lUDNr4 * "Writing a game in Haskell" by Elise Huard Domain: youtube.com, Score: 40, Comments: 9 Original: [21] http://goo.gl/e9yIRJ On Reddit: [22] http://goo.gl/jIR56E * Automasymbolic Differentiation Domain: jtobin.ca, Score: 32, Comments: 11 Original: [23] http://goo.gl/5gGJHy On Reddit: [24] http://goo.gl/fJGS4O * Codewars now supports Haskell! Domain: codewars.com, Score: 31, Comments: 17 Original: [25] http://goo.gl/1X4Kd On Reddit: [26] http://goo.gl/DtXFcN * HIW 2014: Lennart Augustsson: Better type-error messages (very funny) Domain: youtube.com, Score: 29, Comments: 10 Original: [27] http://goo.gl/OtDjcI On Reddit: [28] http://goo.gl/2lOzfE * Tetris in Haskell with Netwire and GLFW Domain: scrambledeggsontoast.github.io, Score: 28, Comments: 12 Original: [29] http://goo.gl/W89z06 On Reddit: [30] http://goo.gl/bd2kvU * Leksah 0.14.1 includes a Web Inspector Domain: self.haskell, Score: 24, Comments: 6 Original: [31] http://goo.gl/QAFuF1 On Reddit: [32] http://goo.gl/QAFuF1 * Finger Trees - Tutorial and IHaskell Notebook Domain: andrew.gibiansky.com, Score: 24, Comments: 1 Original: [33] http://goo.gl/UxkDPr On Reddit: [34] http://goo.gl/cSZhyE * Getting a Quick Fix on Comonads (talk at Boston Haskell, Sept. 17) Domain: youtube.com, Score: 24, Comments: 19 Original: [35] http://goo.gl/FyAlIZ On Reddit: [36] http://goo.gl/hQ6KgW * Parametricity: Money for Nothing and Theorems for Free Bartosz Milewski Domain: bartoszmilewski.com, Score: 23, Comments: 27 Original: [37] http://goo.gl/1W3uEj On Reddit: [38] http://goo.gl/b2rPPN Top StackOverflow Questions * what does Haskell's <|> operator do? votes: 35, answers: 4 Read on SO: [39] http://goo.gl/6aT68b * Does creating a (non-list) data structure via fromList actually create the list? votes: 14, answers: 1 Read on SO: [40] http://goo.gl/HwM94h * Why does <$> and <*> take input in an order opposite of >>=? votes: 14, answers: 2 Read on SO: [41] http://goo.gl/TXFyTD * Check memory usage in haskell votes: 13, answers: 1 Read on SO: [42] http://goo.gl/L4WmV4 * What are the differences between layers and extensible-effects? votes: 11, answers: 2 Read on SO: [43] http://goo.gl/9K0gLz Until next time, [44]+Daniel Santa Cruz References 1. http://www.reddit.com/r/haskell/comments/2hes8m/the_ghc_source_code_contains_1088_todos_please/ 2. http://www.reddit.com/r/haskell/comments/2hes8m/the_ghc_source_code_contains_1088_todos_please/ 3. https://www.youtube.com/watch?v=Agu6jipKfYw 4. http://www.reddit.com/r/haskell/comments/2h43hs/elm_controlling_time_and_space_understanding_the/ 5. http://www.personal.leeds.ac.uk/~scpmw/static/thesis.pdf 6. http://www.reddit.com/r/haskell/comments/2h89xh/visualisation_of_haskell_performance_thesis_pdf/ 7. http://chrisdone.com/posts/shell-conduit 8. http://www.reddit.com/r/haskell/comments/2h017v/shellconduit_write_shell_scripts_in_haskell_with/ 9. http://elm-lang.org/blog/Introducing-Elm-Reactor.elm 10. http://www.reddit.com/r/haskell/comments/2hcgs1/time_travel_made_easy_introducing_elm_reactor/ 11. https://www.fpcomplete.com/business/blog/utilizing-haskell-fynder/ 12. http://www.reddit.com/r/haskell/comments/2h9p8z/this_is_why_you_should_hire_haskellers/ 13. http://typetheorypodcast.com/2014/09/episode-2-edwin-brady-on-idris/ 14. http://www.reddit.com/r/haskell/comments/2hif58/edwin_brady_on_idris_in_the_type_theory_podcast/ 15. http://neilmitchell.blogspot.com/2014/09/ghcid-new-ghci-based-ide-ish.html 16. http://www.reddit.com/r/haskell/comments/2hnmjr/neil_mitchells_haskell_blog_ghcid/ 17. https://www.youtube.com/watch?v=uwrCQmpZ8Ts&index=28&list=UU_QIfHvN9auy2CoOdSfMWDw 18. http://www.reddit.com/r/haskell/comments/2hbjya/coder_decoder_functional_programmer_lingo/ 19. http://www.reddit.com/r/haskell/comments/2hnarl/snake_in_haskell_170_lines_my_first_haskell_app/ 20. http://www.reddit.com/r/haskell/comments/2hnarl/snake_in_haskell_170_lines_my_first_haskell_app/ 21. https://www.youtube.com/watch?v=1MNTerD8IuI 22. http://www.reddit.com/r/haskell/comments/2h7tw8/writing_a_game_in_haskell_by_elise_huard/ 23. http://jtobin.ca/blog/2014/07/06/automasymbolic-differentiation/ 24. http://www.reddit.com/r/haskell/comments/2hkmlq/automasymbolic_differentiation/ 25. http://www.codewars.com/ 26. http://www.reddit.com/r/haskell/comments/2hflkd/codewars_now_supports_haskell/ 27. https://www.youtube.com/watch?v=rdVqQUOvxSU 28. http://www.reddit.com/r/haskell/comments/2hf34h/hiw_2014_lennart_augustsson_better_typeerror/ 29. http://scrambledeggsontoast.github.io/2014/09/23/tetris-netwire/ 30. http://www.reddit.com/r/haskell/comments/2h6g8n/tetris_in_haskell_with_netwire_and_glfw/ 31. http://www.reddit.com/r/haskell/comments/2h357z/leksah_0141_includes_a_web_inspector/ 32. http://www.reddit.com/r/haskell/comments/2h357z/leksah_0141_includes_a_web_inspector/ 33. http://andrew.gibiansky.com/blog/haskell/finger-trees/ 34. http://www.reddit.com/r/haskell/comments/2h9p9z/finger_trees_tutorial_and_ihaskell_notebook/ 35. https://www.youtube.com/watch?v=F7F-BzOB670&feature=youtu.be 36. http://www.reddit.com/r/haskell/comments/2hc3im/getting_a_quick_fix_on_comonads_talk_at_boston/ 37. http://bartoszmilewski.com/2014/09/22/parametricity-money-for-nothing-and-theorems-for-free/ 38. http://www.reddit.com/r/haskell/comments/2h4t98/parametricity_money_for_nothing_and_theorems_for/ 39. http://stackoverflow.com/questions/26002415/what-does-haskells-operator-do 40. http://stackoverflow.com/questions/25964737/does-creating-a-non-list-data-structure-via-fromlist-actually-create-the-list 41. http://stackoverflow.com/questions/26015473/why-does-and-take-input-in-an-order-opposite-of 42. http://stackoverflow.com/questions/26035489/check-memory-usage-in-haskell 43. http://stackoverflow.com/questions/25995369/what-are-the-differences-between-layers-and-extensible-effects 44. https://plus.google.com/105107667630152149014/about -------------- next part -------------- An HTML attachment was scrubbed... URL: From slim.kallel at gmail.com Thu Oct 2 16:14:53 2014 From: slim.kallel at gmail.com (Slim Kallel) Date: Thu, 2 Oct 2014 17:14:53 +0100 Subject: [Haskell] Call for Workshop Proposals - SERA 2015 Message-ID: The 13th International Conference on Software Engineering Research, Management and Applications (SERA 2015) will take place in Hammamet, Tunisia, May 13-15, 2015. We are inviting you to submit a workshop proposal. http://sera2015.redcad.org/ * Scope and Goal SERA 2015 provides an international forum where engineers, researchers, and advanced graduate students are invited to present their experiences and their recent advances and latest research results related to all aspects of software engineering research and applications. The SERA workshops offer a venue where participants are given the opportunity to present and discuss new ideas and emerging topics in the field of Software Engineering, Management and Applications. The workshops will be held in conjunction with the main conference. They are designed to provide an opportunity for in-depth discussion of current and emerging topics of interest to the SERA community. * Important Dates Proposal due: December 01, 2014 Notification: December 15, 2014 * Writing a Proposal Each workshop proposal (2-4 pages total length) should include the following information: - Title of the workshop - An abstract giving the goals and scope of the workshop - Description of the workshop content and topics - Names, short biographies, and contact information of the workshop chair(s). - List of program committee members. Members should be from multiple countries. - History of the workshop if this is not the first instance - Relevant previous experience of the organizing committee - Contact information of the workshop organizer(s). * Responsibilities of the Workshop Organizers The workshop organizers are responsible for: - Writing and disseminating the call-for-papers. The call should make it clear that at least one author of any accepted paper must attend the event - Development and publishing of a workshop web site with all the relevant information - Review process and selection of accepted paper - Defining the workshop program and scheduling the presentations * Responsibilities of the SERA 2015 Organizing Committee The SERA 2015 organizing committee will be responsible for the following: - Providing publicity for the workshop series as a whole. - Providing logistics support and a meeting place for the workshop. - In conjunction with the organizers, determining the start and end times of the workshop. * Submitting a Proposal All workshop proposals should be sent by E-Mail to the workshop co-chairs : - Anis Charfi, SAP Darmstadt, Germany anis.charfi [at] sap.com - Hatem Hadj Kacem, University of Sfax, Tunisia hatem.hadjkacem [at] fsegs.rnu.tn -------------- next part -------------- An HTML attachment was scrubbed... URL: From iavor.diatchki at gmail.com Fri Oct 3 18:37:42 2014 From: iavor.diatchki at gmail.com (Iavor Diatchki) Date: Fri, 3 Oct 2014 11:37:42 -0700 Subject: [Haskell] ANN: New version of graphmod (1.2.4) Message-ID: Hello, I am pleased to announce a new version of `graphmod`---a program that helps you visualize the import dependencies between the modules in your Haskell programs. The new feature in version 1.2.4 is support for pruning the dependency graph, which is enabled with the flag -p or --prune-edges. When this option is selected, `graphmod` will ignore imports to modules that are already imported by some of the dependencies of the module. For example, consider the following modules: module A where { import B; import C } module B where { import C } module C where { } When generated with `--prune-edges`, the resulting graph will be: A -> B -> C Note that there is no edge from `A` to `C`, because `C` is already imported by `B`. Happy hacking, -Iavor -------------- next part -------------- An HTML attachment was scrubbed... URL: From mihai.maruseac at gmail.com Sat Oct 4 13:32:25 2014 From: mihai.maruseac at gmail.com (Mihai Maruseac) Date: Sat, 4 Oct 2014 09:32:25 -0400 Subject: [Haskell] Call for Contributions - Haskell Communities and Activities Report, November 2014 edition Message-ID: Dear all, We would like to collect contributions for the 27th edition of the ============================================================ Haskell Communities & Activities Report http://www.haskell.org/haskellwiki/Haskell_Communities_and_Activities_Report Submission deadline: 1 Nov 2014 (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 Alejandro Serrano Mena 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-2014/template.tex There is also a LaTeX style file at http://haskell.org/communities/11-2014/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. -- Mihai Maruseac (MM) "If you don't know, the thing to do is not to get scared, but to learn." -- Atlas Shrugged. From compscience.announcement at gmail.com Sat Oct 4 18:17:21 2014 From: compscience.announcement at gmail.com (Klaus Havelund) Date: Sat, 4 Oct 2014 11:17:21 -0700 Subject: [Haskell] NFM 2015 - 3rd call for papers Message-ID: CALL FOR PAPERS The 7th NASA Formal Methods Symposium http://www.NASAFormalMethods.org/nfm2015 27 ? 29 April 2015 Pasadena, California, USA Paper Submission: 10 Nov 2014 THEME The widespread use and increasing complexity of mission- and safety-critical systems require advanced techniques that address their specification, verification, validation, and certification. The NASA Formal Methods Symposium is a forum for theoreticians and practitioners from academia, industry, and government, with the goals of identifying challenges and providing solutions to achieving assurance in mission- and safety-critical systems. Within NASA such systems include for example autonomous robots, separation assurance algorithms for aircraft, Next Generation Air Transportation (NextGen), and autonomous rendezvous and docking for spacecraft. Moreover, emerging paradigms such as property-based design, code generation, and safety cases are bringing with them new challenges and opportunities. The focus of the symposium will be on formal techniques, their theory, current capabilities, and limitations, as well as their application to aerospace, robotics, and other mission- and safety-critical systems in all design life-cycle stages. We encourage submissions on cross-cutting approaches marrying formal verification techniques with advances in critical system development, such as requirements generation, analysis of aerospace operational concepts, and formal methods integrated in early design stages and carrying throughout system development. TOPICS Topics of interest include, but are not limited to: Model checking Theorem proving SAT and SMT solving Symbolic execution Static analysis Runtime verification Program refinement Compositional verification Modeling and specification formalisms Model-based development Model-based testing Requirement engineering Formal approaches to fault tolerance Security and intrusion detection Applications of formal methods to aerospace systems Applications of formal methods to cyber-physical systems Applications of formal methods to human-machine interaction analysis INVITED SPEAKERS Dino Distefano Software Engineer at Facebook, California, USA and Professor at Queen Mary University of London, UK. Viktor Kuncak Leads Lab for Automated Reasoning and Analysis at EPFL, Lausanne, Switzerland. Rob Manning Chief Engineer at NASA/JPL. IMPORTANT DATES Paper Submission: 10 Nov 2014 Paper Notifications: 12 Jan 2015 Camera-ready Papers: 9 Feb 2015 Symposium: 27 ? 29 April 2015 LOCATION AND COST The symposium will take place at the Hilton Hotel, Pasadena, California, USA, April 27-29, 2015. There will be no registration fee for participants. All interested individuals, including non-US citizens, are welcome to submit, to attend, to listen to the talks, and to participate in discussions; however, all attendees must register. SUBMISSION DETAILS There are two categories of submissions: - Regular papers describing fully developed work and complete results (15 pages) - Short papers describing tools, experience reports, or descriptions of work in progress with preliminary results (6 pages) All papers should be in English and describe original work that has not been published or submitted elsewhere. All submissions will be fully reviewed by members of the Programme Committee. Papers will appear in a volume of Springer?s Lecture Notes on Computer Science (LNCS), and must use LNCS style formatting. Papers should be submitted in PDF format. PROGRAMME COMMITTEE Erika Abraham, RWTH Aachen University, Germany Julia Badger, NASA Johnson Space Center, USA Christel Baier, Technische Universit?t Dresden, Germany Saddek Bensalem, VERIMAG/UJF, France Dirk Beyer, University of Passau, Germany Armin Biere, Johannes Kepler University, Austria Nikolaj Bjorner, Microsoft Research, USA Borzoo Bonakdarpour, McMaster University, Canada Alessandro Cimatti, Fondazione Bruno Kessler, Italy Leonardo de Moura, Microsoft Research, USA Ewen Denney, NASA Ames Research Center, USA Ben Di Vito, NASA Langley Research Center, USA Dawson Engler, Stanford University, USA Jean-Christophe Filliatre, Universit? Paris-Sud, France Dimitra Giannakopoulou, NASA Ames Research Center, USA Alwyn Goodloe, NASA Langley Research Center, USA Susanne Graf, VERIMAG, France Alex Groce, Oregon State University, USA Radu Grosu, Vienna University of Technology, Austria John Harrison, Intel Corporation, USA Mike Hinchey, University of Limerick/Lero, Ireland Bart Jacobs, University of Leuven, Belgium Sarfraz Khurshid, The University of Texas at Austin, USA Gerwin Klein, NICTA, Australia Daniel Kroening, Oxford University, UK Orna Kupferman, Hebrew University Jerusalem, Israel Kim Larsen, Aalborg University, Denmark Rustan Leino, Microsoft Research, USA Martin Leucker, University of Lubeck, Germany Rupak Majumdar, Max Planck Institute, Germany Pete Manolios, Northeastern University, USA Peter Mueller, ETH Zurich, Switzerland Kedar Namjoshi, Bell Labs/Alcatel-Lucent, USA Corina Pasareanu, NASA Ames Research Center, USA Doron Peled, Bar Ilan University, Israel Suzette Person, NASA Langley Research Center, USA Andreas Podelski, University of Freiburg, Germany Grigore Rosu, University of Illinois, USA Kristin Yvonne Rozier, NASA Ames Research Center, USA Natarajan Shankar, SRI International, USA Natasha Sharygina, University of Lugano, Switzerland Scott Smolka, Stony Brook University, USA Willem Visser, University of Stellenbosch, South Africa Mahesh Viswanathan, University of Illinois, USA Mike Whalen, University of Minnesota, USA Jim Woodcock, University of York, UK PC CHAIRS Klaus Havelund, NASA Jet Propulsion Laboratory Gerard Holzmann, NASA Jet Propulsion Laboratory Rajeev Joshi, NASA Jet Propulsion Laboratory PUBLICITY SUPPORT Ylies Falcone, Universite Joseph Fourier, France STEERING COMMITTEE Julia Badger, NASA Johnson Space Center Ewen Denney, NASA Ames Research Center Ben Di Vito, NASA Langley Research Center Klaus Havelund, NASA Jet Propulsion Laboratory Gerard Holzmann, NASA Jet Propulsion Laboratory Cesar Munoz, NASA Langley Research Center Corina Pasareanu, NASA Ames Research Center Suzette Person, NASA Langley Research Center Kristin Yvonne Rozier, NASA Ames Research Center --- -------------- next part -------------- An HTML attachment was scrubbed... URL: From robby at eecs.northwestern.edu Tue Oct 7 13:04:18 2014 From: robby at eecs.northwestern.edu (Robby Findler) Date: Tue, 7 Oct 2014 08:04:18 -0500 Subject: [Haskell] PLT Redex: The Summer School, Call for Participation Message-ID: PLT REDEX: THE SUMMER SCHOOL CALL for PARTICIPATION Matthias Felleisen, Robert Bruce Findler, Matthew Flatt LOCATION: University of Utah, Salt Lake City DATES: July 27 - July 31, 2015 http://www.cs.utah.edu/~mflatt/plt-redex/ PLT Redex is a lightweight, embedded DSL for modeling programming languages, their reduction semantics, and their type systems. It comes with an IDE and a toolbox for exploring, testing, debugging, and type-setting language models. The PLT research group has successfully used Redex to model and analyze a wide spectrum of published models. The summer school will introduce students to the underlying theory of reduction semantics, programming in the Redex language, and using its tool suite effectively. The course is intended for PhD students and researchers in programming languages. Enrollment is limited to 25 attendees. While the workshop itself is free, attendees must pay for travel, room, and board. We expect room and board to be around $500, assuming an arrival in the evening of Sunday July 26 and leaving Friday July 31 or August 1. Partial financial support for PhD students is available. To register, send email to Matthew Flatt (mflatt at cs.utah.edu). If you are a PhD student and requesting financial support, CC your advisor and ask for a one-line confirmation email. Literature Matthias Felleisen, Robert Bruce Findler, Matthew Flatt. Semantics Engineering with PLT Redex. MIT Press, 2012. Casey Klein, John Clements, Christos Dimoulas, Carl Eastlund, Matthias Felleisen, Matthew Flatt, Jay McCarthy, Jon Rafkind, Sam Tobin-Hochstadt, Robert Bruce Findler. Run Your Research: On the Effectiveness of Lightweight Mechanization. POPL 2012. From dstcruz at gmail.com Thu Oct 9 04:07:13 2014 From: dstcruz at gmail.com (Daniel Santa Cruz) Date: Wed, 8 Oct 2014 22:07:13 -0600 Subject: [Haskell] Haskell Weekly News: Issue 309 Message-ID: Welcome to issue 309 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from September 28 to October 4, 2014 Quotes of the Week * Uh... I'ma have to read the IRC logs... No good quotes @remember'd Top Reddit Stories * Announcing needle: ASCII-fied arrow notation Domain: scrambledeggsontoast.github.io, Score: 103, Comments: 119 Original: [1] http://goo.gl/wCPh8K On Reddit: [2] http://goo.gl/UwTJSt * How we might abolish Cabal Hell, part 1 Domain: well-typed.com, Score: 95, Comments: 69 Original: [3] http://goo.gl/N19hPq On Reddit: [4] http://goo.gl/CQQRF0 * After some failed attempts to learn Parsec I came across this incredibly patient tutorial and now I'm writing parsers! Domain: github.com, Score: 79, Comments: 17 Original: [5] http://goo.gl/msqtkb On Reddit: [6] http://goo.gl/p3EgqQ * Neil Mitchell's Haskell Blog: Why Traversable/Foldable should not be in the Prelude Domain: neilmitchell.blogspot.co.il, Score: 71, Comments: 289 Original: [7] http://goo.gl/sykNse On Reddit: [8] http://goo.gl/4wIxBX * Tutorial: Implementing highly efficient data structures with Monoids and Fingertrees Domain: codementor.io, Score: 47, Comments: 37 Original: [9] http://goo.gl/WB7Jwg On Reddit: [10] http://goo.gl/jGrLX1 * There is No Haskell Topology Domain: immanence.org, Score: 45, Comments: 32 Original: [11] http://goo.gl/JAoEDw On Reddit: [12] http://goo.gl/wuuF4i * Introduction to Low Level Haskell Optimization - Dan Doel Domain: youtu.be, Score: 44, Comments: 2 Original: [13] http://goo.gl/vYS1Hy On Reddit: [14] http://goo.gl/dG9Pn5 * Turn an optparse-applicative program into a CGI program! Domain: github.com, Score: 39, Comments: 10 Original: [15] http://goo.gl/sjCqsb On Reddit: [16] http://goo.gl/BXxeno * Yesod 1.4 released Domain: yesodweb.com, Score: 36, Comments: 1 Original: [17] http://goo.gl/T5Vqe8 On Reddit: [18] http://goo.gl/977ey0 * Updating Auto-Update Domain: yesodweb.com, Score: 36, Comments: 20 Original: [19] http://goo.gl/OwOrGZ On Reddit: [20] http://goo.gl/J2zr5n * Type-safe Routing for Spock Web Framework released Domain: github.com, Score: 32, Comments: 39 Original: [21] http://goo.gl/QZS9gU On Reddit: [22] http://goo.gl/BokvJ8 * Lattice-Based Data Structures for Deterministic Parallel and Distributed Programming (related to CRDTs; implementation in Haskell) Domain: composition.al, Score: 30, Comments: 9 Original: [23] http://goo.gl/mVQqqX On Reddit: [24] http://goo.gl/tZ0XrW * A non-recursive sorting algorithm Domain: haskellexists.blogspot.com, Score: 27, Comments: 36 Original: [25] http://goo.gl/jD0z0K On Reddit: [26] http://goo.gl/3HpTBy * Dijkstra monads Domain: why-lambda.blogspot.co.uk, Score: 25, Comments: 4 Original: [27] http://goo.gl/kx1Q6w On Reddit: [28] http://goo.gl/C86igH * Improving Haskell-related documentation Domain: self.haskell, Score: 23, Comments: 62 Original: [29] http://goo.gl/rQeuUT On Reddit: [30] http://goo.gl/rQeuUT * Haskell, Monads and Purity ? via Hacker News Domain: jelv.is, Score: 23, Comments: 11 Original: [31] http://goo.gl/vm7juH On Reddit: [32] http://goo.gl/1P5OgF * FP Complete is hiring: Systems engineer for cloud and cluster work Domain: fpcomplete.com, Score: 21, Comments: 11 Original: [33] http://goo.gl/MLT5Ud On Reddit: [34] http://goo.gl/Ql8uIX * The future of the haskell2010/haskell98 packages for GHC 7.10 Domain: haskell.org, Score: 21, Comments: 22 Original: [35] http://goo.gl/94bnK3 On Reddit: [36] http://goo.gl/0c80JU * ANN: Nomyx V0.7, the only game where you can change the rules Domain: self.haskell, Score: 20, Comments: 7 Original: [37] http://goo.gl/1gGtqb On Reddit: [38] http://goo.gl/1gGtqb * Let's Build a Browser Engine in Haskell: part 5 Domain: hrothen.github.io, Score: 19, Comments: 6 Original: [39] http://goo.gl/zzSF2D On Reddit: [40] http://goo.gl/9xzqdR Top StackOverflow Questions * How fundamentaly different push-pull and arrowized FRP are? votes: 10, answers: 0 Read on SO: [41] http://goo.gl/XbbbVW * What are hashes (#) used for in Haskell's library's source? votes: 10, answers: 1 Read on SO: [42] http://goo.gl/mvNNlb * What is the inverse of a promise? votes: 9, answers: 3 Read on SO: [43] http://goo.gl/usQIiW * Is there a default polymorphic unit type haskell votes: 7, answers: 1 Read on SO: [44] http://goo.gl/5Ozy9G * nvcc + c2hs on OS X 10.9.5 votes: 7, answers: 1 Read on SO: [45] http://goo.gl/0XMNFu * How to sort a list using partial order in Haskell? votes: 7, answers: 2 Read on SO: [46] http://goo.gl/GLMiwA * Relationship between forward and backward map in Isomorphism (Lens package) votes: 6, answers: 1 Read on SO: [47] http://goo.gl/icIdIR * How to implement a generic neural network efficiently in Haskell? votes: 6, answers: 0 Read on SO: [48] http://goo.gl/HIHY8e * How do I unify two or more Signals in elerea? votes: 6, answers: 1 Read on SO: [49] http://goo.gl/jacb0r * Ambiguous type variable fixed with type equality constraint votes: 6, answers: 1 Read on SO: [50] http://goo.gl/JADmBj Until next time, [51]+Daniel Santa Cruz References 1. http://scrambledeggsontoast.github.io/2014/09/28/needle-announce/ 2. http://www.reddit.com/r/haskell/comments/2hpzpu/announcing_needle_asciified_arrow_notation/ 3. http://www.well-typed.com/blog/2014/09/how-we-might-abolish-cabal-hell-part-1/ 4. http://www.reddit.com/r/haskell/comments/2hvm59/how_we_might_abolish_cabal_hell_part_1/ 5. https://github.com/JakeWheat/intro_to_parsing 6. http://www.reddit.com/r/haskell/comments/2ia5u2/after_some_failed_attempts_to_learn_parsec_i_came/ 7. http://neilmitchell.blogspot.co.il/2014/10/why-traversablefoldable-should-not-be.html 8. http://www.reddit.com/r/haskell/comments/2hzqii/neil_mitchells_haskell_blog_why/ 9. https://www.codementor.io/haskell-tutorial/monoids-fingertrees-implement-abstract-data?utm_source=reddit-tutorial&utm_medium=tutorial&utm_term=haskell-tutorial-apfelmus&utm_content=tutorial&utm_campaign=reddit-tutorial 10. http://www.reddit.com/r/haskell/comments/2i3ttm/tutorial_implementing_highly_efficient_data/ 11. http://immanence.org/post/there-is-no-haskell-topology/ 12. http://www.reddit.com/r/haskell/comments/2i85k7/there_is_no_haskell_topology/ 13. http://youtu.be/McFNkLPTOSY 14. http://www.reddit.com/r/haskell/comments/2hy6cp/introduction_to_low_level_haskell_optimization/ 15. https://github.com/maxpow4h/webcloud#webcloud 16. http://www.reddit.com/r/haskell/comments/2huhrg/turn_an_optparseapplicative_program_into_a_cgi/ 17. http://www.yesodweb.com/blog/2014/09/announcing-yesod-1-4 18. http://www.reddit.com/r/haskell/comments/2hvoxb/yesod_14_released/ 19. http://www.yesodweb.com/blog/2014/10/updating-auto-update 20. http://www.reddit.com/r/haskell/comments/2i5d7m/updating_autoupdate/ 21. https://github.com/agrafix/Spock 22. http://www.reddit.com/r/haskell/comments/2i2zfw/typesafe_routing_for_spock_web_framework_released/ 23. http://composition.al/blog/2014/09/29/my-thesis-defense-talk/ 24. http://www.reddit.com/r/haskell/comments/2i17zj/latticebased_data_structures_for_deterministic/ 25. http://haskellexists.blogspot.com/2014/09/a-non-recursive-sorting-algorithm.html 26. http://www.reddit.com/r/haskell/comments/2hsea9/a_nonrecursive_sorting_algorithm/ 27. http://why-lambda.blogspot.co.uk/2014/09/dijkstra-monads.html 28. http://www.reddit.com/r/haskell/comments/2hzu5b/dijkstra_monads/ 29. http://www.reddit.com/r/haskell/comments/2i1z9u/improving_haskellrelated_documentation/ 30. http://www.reddit.com/r/haskell/comments/2i1z9u/improving_haskellrelated_documentation/ 31. http://jelv.is/blog/Haskell-Monads-and-Purity/ 32. http://www.reddit.com/r/haskell/comments/2i8tnl/haskell_monads_and_purity_via_hacker_news/ 33. https://www.fpcomplete.com/page/systems-engineer 34. http://www.reddit.com/r/haskell/comments/2hz6ue/fp_complete_is_hiring_systems_engineer_for_cloud/ 35. http://www.haskell.org/pipermail/glasgow-haskell-users/2014-September/025280.html 36. http://www.reddit.com/r/haskell/comments/2i0bhr/the_future_of_the_haskell2010haskell98_packages/ 37. http://www.reddit.com/r/haskell/comments/2hw529/ann_nomyx_v07_the_only_game_where_you_can_change/ 38. http://www.reddit.com/r/haskell/comments/2hw529/ann_nomyx_v07_the_only_game_where_you_can_change/ 39. http://hrothen.github.io/2014/10/01/lets-build-a-browser-engine-in-haskell-part-5/ 40. http://www.reddit.com/r/haskell/comments/2i0wnr/lets_build_a_browser_engine_in_haskell_part_5/ 41. http://stackoverflow.com/questions/26164135/how-fundamentaly-different-push-pull-and-arrowized-frp-are 42. http://stackoverflow.com/questions/26169990/what-are-hashes-used-for-in-haskells-librarys-source 43. http://stackoverflow.com/questions/26084439/what-is-the-inverse-of-a-promise 44. http://stackoverflow.com/questions/26097797/is-there-a-default-polymorphic-unit-type-haskell 45. http://stackoverflow.com/questions/26125870/nvcc-c2hs-on-os-x-10-9-5 46. http://stackoverflow.com/questions/26158233/how-to-sort-a-list-using-partial-order-in-haskell 47. http://stackoverflow.com/questions/26082221/relationship-between-forward-and-backward-map-in-isomorphism-lens-package 48. http://stackoverflow.com/questions/26092063/how-to-implement-a-generic-neural-network-efficiently-in-haskell 49. http://stackoverflow.com/questions/26104735/how-do-i-unify-two-or-more-signals-in-elerea 50. http://stackoverflow.com/questions/26146983/ambiguous-type-variable-fixed-with-type-equality-constraint 51. https://plus.google.com/105107667630152149014/about -------------- next part -------------- An HTML attachment was scrubbed... URL: From icfp.publicity at googlemail.com Thu Oct 9 22:32:09 2014 From: icfp.publicity at googlemail.com (David Van Horn) Date: Thu, 9 Oct 2014 18:32:09 -0400 Subject: [Haskell] ICFP 2015 Call for Workshop and Co-located Event Proposals Message-ID: CALL FOR WORKSHOP AND CO-LOCATED EVENT PROPOSALS ICFP 2015 20th ACM SIGPLAN International Conference on Functional Programming August 30 - September 5, 2015 Vancouver, Canada http://icfpconference.org/icfp2015/ The 120th ACM SIGPLAN International Conference on Functional Programming will be held in Vancouver, British Columbia, Canada on August 30-September 5, 2015. 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 2015 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 30 (the day before ICFP) and September 3-5 (the three days after ICFP). ---------------------------------------------------------------------- Submission details Deadline for submission: November 16, 2014 Notification of acceptance: December 15, 2014 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 2015 workshop co-chairs (Tom Schrijvers and Nicolas Wu), via email to icfp2015-workshops at cs.kuleuven.be by November 16, 2014. (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, 2014, 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/icfp2015/icfp15-workshops-form.txt Further information about SIGPLAN sponsorship is available at: http://www.sigplan.org/Resources/Guidelines/Workshops ---------------------------------------------------------------------- Selection committee The proposals will be evaluated by a committee comprising the following members of the ICFP 2015 organizing committee, together with the members of the SIGPLAN executive committee. Workshop Co-Chair: Tom Schrijvers (KU Leuven) Workshop Co-Chair: Nicolas Wu (University of Oxford) General Chair: Kathleen Fisher (Tufts University) Program Chair: John Reppy (University of Chicago) ---------------------------------------------------------------------- Further information Any queries should be addressed to the workshop co-chairs (Tom Schrijvers and Nicolas Wu), via email to icfp2015-workshops at cs.kuleuven.be. From gershomb at gmail.com Fri Oct 10 02:04:14 2014 From: gershomb at gmail.com (Gershom B) Date: Thu, 9 Oct 2014 22:04:14 -0400 Subject: [Haskell] [Haskell-cafe] What happened to hugs? In-Reply-To: References: <-3701248786196244697@unknownmsgid> Message-ID: I?m happy to announce that http://www.haskell.org/hugs has now been resuscitated, and should contain complete documentation and downloads for the Hugs system. ?Furthermore we?re working on putting put in place a redirect so that http://cvs.haskell.org will be able to point to the new location to keep older links intact. If there are any other stale links anyone would like patched up or binary releases that people feel should be pointed to, please let us know at admin at haskell.org. -gershom On September 25, 2014 at 11:57:58 PM, Rustom Mody (rustompmody at gmail.com) wrote: > On Thu, Sep 11, 2014 at 2:03 AM, Thorsten Rangwich > > wrote: > > > Hi, > > > > I suppose this question is not new, but neither google nor a manual search > > file be file through the archives brought enlightement. > > > > www.haskell.org/hugs > > > > still exists, but none of the links there does work. Documentation and > > source point to cvs.haskell.org ("server does not exist") and development > > points to http://hackage.haskell.org/trac/hugs ("page does not exist"). > > > > Was it migrated to somewhere else or is it dead - in latter case the page > > would not make sense any more. > > > > > > Sad that hugs links are now dead. > > There is still gofer (the predecessor to hugs). > The original of Mark Jones and modifications made by me in the early 90s > and the whys of these modifications are at > http://blog.languager.org/2014/09/pugofer.html > > > > "Raskell" (iPad app) provided a development environment usinh hugs, so I > > would at least like to install hugs on my Mac as well... > > > > Dont know about macs but last I knew it was compiling with gcc on linux > (in all of 10 seconds!) > _______________________________________________ > Haskell-Cafe mailing list > Haskell-Cafe at haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe > From jose.pedro.magalhaes at cs.ox.ac.uk Fri Oct 10 12:59:07 2014 From: jose.pedro.magalhaes at cs.ox.ac.uk (=?UTF-8?Q?Jos=C3=A9_Pedro_Magalh=C3=A3es?=) Date: Fri, 10 Oct 2014 13:59:07 +0100 Subject: [Haskell] Mathematics of Program Construction (MPC 2015): first call for papers Message-ID: Apologies for multiple copies. FIRST CALL FOR PAPERS 12th International Conference on Mathematics of Program Construction (MPC 2015) K?nigswinter, Germany, 29 June - 1 July 2015 http://www.cs.ox.ac.uk/conferences/MPC2015/ BACKGROUND The 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 2015 MPC conference will be held in K?nigswinter, Germany, from 29th June to 1st July 2015. The previous conferences were held in Twente, The Netherlands (1989), Oxford, UK (1992), Kloster Irsee, Germany (1995), Marstrand, Sweden (1998), Ponte de Lima, Portugal (2000), Dagstuhl, Germany (2002), Stirling, UK (2004, colocated with AMAST), Kuressaare, Estonia (2006, colocated with AMAST), Marseille, France (2008), Qu?bec City, Canada (2010, colocated with AMAST), and Madrid, Spain (2012). TOPICS Papers are solicited on mathematical methods and tools put to use in program construction. Topics of interest range from algorithmics to support for program construction in programming languages and systems. The notion of "program" is broad, from algorithms to hardware. Some typical areas are type systems, program analysis and transformation, programming-language semantics, security, and program logics. Theoretical contributions are welcome, provided that their relevance to program construction is clear. Reports on applications are welcome, provided that their mathematical basis is evident. We also encourage the submission of "pearls": elegant, instructive, and fun essays on the mathematics of program construction. IMPORTANT DATES * Submission of abstracts: 26 January 2015 * Submission of full papers: 2 February 2015 * Notification to authors: 16 March 2015 * Final version: 13 April 2015 SUBMISSION Submission is in two stages. Abstracts (plain text, 10 to 20 lines) must be submitted by 26 January 2015. Full papers (pdf) adhering to the LaTeX llncs style must be submitted by 2 February 2015. There is no official page limit, but authors should strive for brevity. The web-based system EasyChair will be used for submission (https://easychair.org/conferences/?conf=mpc2015). Papers must report previously unpublished work, and must not be submitted concurrently to a journal or to another conference with refereed proceedings. Accepted papers must be presented at the conference by one of the authors. Please feel free to write to mpc2015 at easychair.org with any questions about academic matters. The proceedings of MPC 2015 will be published in Springer-Verlag's Lecture Notes in Computer Science series, as have all the previous editions. Authors of accepted papers will be expected to transfer copyright to Springer for this purpose. After the conference, authors of the best papers will be invited to submit revised versions to a special issue of the Elsevier journal Science of Computer Programming. PROGRAMME COMMITTEE Ralf Hinze University of Oxford, UK (chair) Eerke Boiten University of Kent, UK Jules Desharnais Universit? Laval, Canada Lindsay Groves Victoria University of Wellington, New Zealand Zhenjiang Hu National Institute of Informatics, Japan Graham Hutton University of Nottingham, UK Johan Jeuring Utrecht University and Open University, The Netherlands Jay McCarthy Vassar College, US Bernhard M?ller Universit?t Augsburg, Germany Shin-Cheng Mu Academia Sinica, Taiwan Dave Naumann Stevens Institute of Technology, US Pablo Nogueira Universidad Polit?cnica de Madrid, Spain Ulf Norell University of Gothenburg, Sweden Bruno C. d. S. Oliveira The University of Hong Kong, Hong Kong Jos? Nuno Oliveira Universidade do Minho, Portugal Alberto Pardo Universidad de la Rep?blica, Uruguay Christine Paulin-Mohring INRIA-Universit? Paris-Sud, France Tom Schrijvers KU Leuven, Belgium Emil Sekerinski McMaster University, Canada Tim Sheard Portland State University, US Anya Tafliovich University of Toronto Scarborough, Canada Tarmo Uustalu Institute of Cybernetics, Estonia Janis Voigtl?nder Universit?t Bonn, Germany VENUE The conference will take place in K?nigswinter, Maritim Hotel, where accommodation has been reserved. K?nigswinter is situated on the right bank of the river Rhine, opposite Germany's former capital Bonn, at the foot of the Siebengebirge. LOCAL ORGANIZERS Ralf Hinze University of Oxford, UK (co-chair) Janis Voigtl?nder Universit?t Bonn, Germany (co-chair) Jos? Pedro Magalh?es University of Oxford, UK Nicolas Wu University of Oxford, UK For queries about local matters, please write to jv at informatik.uni-bonn.de. -------------- next part -------------- An HTML attachment was scrubbed... URL: From fuuzetsu at fuuzetsu.co.uk Tue Oct 14 18:05:33 2014 From: fuuzetsu at fuuzetsu.co.uk (Mateusz Kowalczyk) Date: Tue, 14 Oct 2014 19:05:33 +0100 Subject: [Haskell] ANN: yi-0.10.0 , the text editor written in Haskell Message-ID: <543D65ED.7050104@fuuzetsu.co.uk> -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 We're glad to announce Yi 0.10.0. Yi is 10 years old today! Our main repository is at [1]. Yi compiles with GHC 7.6.3 all the way up to GHC 7.8.3. There have been many changes since the latest Hackage release (0.8.2). I inline the relevant part of the changelog at the bottom. We are slowly trying to populate the documentation pages: we have recently started using GitHub pages[2] for this purpose. Please have a look! On top of the issues listed in the changelog, a lot of issues were closed separately. If you had a pending issue, please check the issue tracker. As always we're looking for contributors: we have tasks in just about any area. Note that you don't even need to know Haskell to help us. Visit us on #yi on Freenode: be prepared to stay for more than 5 minutes. Installation instructions are available at [2]. If you're using nix, Yi 0.10.0 will be packaged shortly. 0.10.0 - ------ * Unicode syntax highlighting fixed (issue #82) * Hook to GTK Window exposed (#557) * Multiple components moved out to separate packages (oo-prototypes, word-trie, yi-languages, yi-string) * Replace a lot of the API to use YiString/Text instead of String improving performance * Greatly improve performance in the pango front-end as long as line-wrapping is on (default) * Recognise read-only files (#145) * Various Vim keymap improvements and fixes * Use lens instead of uniplate, replace some boilerplate with lens * Improve test framework to handle windows interactions, e.g. scrolling. * Use GHC.Generics instead of derive on GHC 7.8 * Remove bitrotten ghcapi and scion flags. * Support non-qwerty vim users * Support eventlog profiling with -feventlog * Eliminate idle CPU consumption in vty frontend * General cleanup * Make C-w closer to actual emacs behaviour (#612) * Make M-h behave more like emacs (#611) * Hint with buffer names when using C-k with emacs keymap (#606) * Fix display of paths starting with / (#528) * Don't mark buffer as changed if nothing was killed (#618) * Nicer findFile &c behaviour in dired buffers (#149) * Implement C-a for CUA (#167) * Fix dired for directories with unicode files/dirs (#445) * Fix vim indenting under some circumstances (#621) * Allow the font size to be changed per buffer (#608) * Double-click and triple-click selection in pango (#100 and #101) * Count columns properly in presence of tabs (#440) * Extra marking operations in dired Contributors: Alan Zimmerman, Anders Papitto, Anthony Quizon, Ben Armston, Benno F?nfst?ck, Carter Charbonneau, Corey O'Connor, Cray Elliott, Dmitry Ivanov, fiendfan1, Ilya Smelkov, Jakub Arnold, Jared Hance, jetho, Mateusz Kowalczyk, Richard Goulter, Ryan Desfosses, Siddhanathan Shanmugam 0.9.0 - ----- * Vim keymap removed. Vim2 is now called Vim. [1]: https://github.com/yi-editor/yi [2]: http://yi-editor.github.io/ - -- Mateusz K. -----BEGIN PGP SIGNATURE----- Version: GnuPG v2 iQIcBAEBAgAGBQJUPWXYAAoJEM1mucMq2pqXgzcP/0iljWag1qweflSYIqKa+FOc n/NYTqUV3HIYSGxolUvnm5HMfJ1uFFYmV7BVEtC7VcdntdP/bUCxu2gdOA9XxIrL JFwV3tzvLFqPYsm0bBVwq+lqRaBF2ICK95gmZpE+Osw7lrIK0SwibGAuLL+niRoo Qf5duTZXMBw0gQxay47zAb1XPwUhLYQUThSnbcOAG1raRI3OCV/eyMky+l5WMLTy 3RK5j2ZsWnps9k1XOFBVR/pQ6kJiFrButfLY7c3RBbfY9+uHQDN1ba3hr3wHsXUP fw4PiM6WmHecezH1Q7TSzH0XL+Mh5miM+g2QGphKAjeACOzskiCYRGcBpUCHSPsO EdxHe62oUvonEPAP747lCMRcYURknvoyVCDKjYzNKFBHJPFAizWW+tlv82QKKT1j CKECN7Lkra3nlLKzi11TdLHMUDGmatJeNHUMp4W1EDGG/hRbobrmD+2U2Yt/pRKH f/tSeE5Azk0xjDMNmYZBprqf1O1Q9tve4NrIHgQK0EXRWhkcFAsGIdqQBHP27Z0s JdCXdlMaRs4u2IfYoDevnFadMGF10oqQ1wUJPtIzcVvghgBkZEIMswsqbD5fTtPf Y/DFe2YcJl+lxPqgm/fq3aDnJABGYLftfJ05Rs1BGA909bnW29YqK0Si8JxAoH4R K6YQBTpqWULfHXh/ZQ68 =CAHP -----END PGP SIGNATURE----- From yminsky at janestreet.com Thu Oct 16 13:14:21 2014 From: yminsky at janestreet.com (Yaron Minsky) Date: Thu, 16 Oct 2014 14:14:21 +0100 Subject: [Haskell] [JOB] Summer internships at Jane Street Message-ID: Jane Street is actively hiring summer interns for our offices in New York, London and Hong Kong. Interning at Jane Street is a great learning experience. If you're interested in seeing how functional programming is applied to real world problems at big scale, there's no better place. Look here https://blogs.janestreet.com/?p=962 to get a sense of the kinds of projects summer interns do. As is reflected there, many of our intern projects make their way out as open-source projects. Interns also learn about Jane Street's trading business through lectures and interactive training sessions. Plus, there are a lot of fun social activities throughout the summer. Feel free to redistribute this to any students you think might be interested. And if you're interested directly, you can apply here: http://janestreet.com/apply And as usual, we're also hiring developers for fulltime positions in NYC, Hong Kong and London. Cheers, y (For the avoidance of doubt, note that summer internships are paid positions.) From yangliu at ntu.edu.sg Fri Oct 17 09:45:41 2014 From: yangliu at ntu.edu.sg (Liu Yang (Asst Prof)) Date: Fri, 17 Oct 2014 09:45:41 +0000 Subject: [Haskell] ICFEM 2014, Luxembourg, 3-7 November 2014: Last Call for Participation Message-ID: <5A4257BA3B1EEA45B17620B30FD656E12CB175ED@EXCHMBOX31.staff.main.ntu.edu.sg> 16th International Conference on Formal Engineering Methods ICFEM 2014, Luxembourg, 3-7 November 2014 Last Call for Participation http://icfem2014.uni.lu ---------------------------------------- The 16th International Conference on Formal Engineering Methods (ICFEM 2014) will be held at the Melia Hotel in Luxembourg, Luxembourg from 3rd November to 7 November 2014. Since 1997, ICFEM has been serving as an international forum for researchers and practitioners who have been seriously applying formal methods to practical applications. Highlights: ---------------------------------------- + Keynote speakers: Nikolaj Bjorner (Microsoft Research), Lionel Briand (University of Luxembourg) and Vincent Danos (University of Edinburgh) + The conference is now available http://icfem2014.uni.lu/program.php + Panel discussion on November 4th: Are Formal Engineering Methods and Agile Methods Friend or Enemy? + Two affiliated workshops FTSCS 2014 and SOFL+MSVL. PC Chairs ---------------------------------------- + Stephan Merz (INRIA, France) + Jun Pang (University of Luxembourg, Luxembourg) ________________________________ CONFIDENTIALITY: This email is intended solely for the person(s) named and may be confidential and/or privileged. If you are not the intended recipient, please delete it, notify us and do not copy, use, or disclose its contents. Towards a sustainable earth: Print only when necessary. Thank you. From mh at informatik.uni-kiel.de Mon Oct 20 11:08:50 2014 From: mh at informatik.uni-kiel.de (Michael Hanus) Date: Mon, 20 Oct 2014 13:08:50 +0200 Subject: [Haskell] RTA 2015 - First Call For Papers Message-ID: <5444ED42.6090109@informatik.uni-kiel.de> ================================================================== RTA 2015 - CALL FOR PAPERS 26th International Conference on REWRITING TECHNIQUES AND APPLICATIONS 29 June - 1 July, 2015, Warsaw, Poland co-located with TLCA, as part of RDP 2015 http://rdp15.mimuw.edu.pl/ ================================================================== RTA is the major forum for the presentation of research on all aspects of rewriting. Topics of interest include: * Foundations: string, term, net and graph rewriting; higher-order rewriting; binding techniques; constrained rewriting and deduction; categorical and infinitary rewriting; stochastic rewriting; higher-dimensional rewriting; tree automata; confluence; termination; complexity; modularity; equational logic; universal algebra; rewriting logic; rewriting calculi. * Algorithmic aspects and implementation: strategies; matching; unification; anti-unification; narrowing; completion; parallel execution; certification of rewriting properties; abstract machines; automated (non)termination and confluence provers; automated complexity analysis; system descriptions. * Applications of rewriting: programming languages (functional, logic, object-oriented and other programming paradigms); type systems; program analysis, transformation and optimisation; rewriting models of programs; semantics; process calculi; functional calculi; explicit substitution; constraint solving; symbolic and algebraic computation; theorem proving; proof checking; system modelling; system synthesis and verification; XML queries and transformations; cryptographic protocols; security policies; systems biology; linguistics; rewriting in education. Important Dates: # Submission: title and abstract: 30 January 2015 full paper: 6 February 2015 # Rebuttal period: 19-21 March 2015 # Notification: 8 April 2015 # Final version: 25 April 2015 Submission and publication: The RTA 2015 proceedings will be published by LIPIcs (Leibniz International Proceedings in Informatics). Papers should present original work, and should be submitted via Easychair: https://www.easychair.org/conferences/?conf=rta2015 Papers should be at most 15 pages (10 for system descriptions) in the style described in: http://drops.dagstuhl.de/styles/lipics/lipics-authors.tgz This year we particularly welcome submissions on applications of rewriting. Application papers are regular papers (15 pages); their originality is judged based on the novelty of the application or the depth of the rewriting methods applied. System description papers present new software tools in which rewriting plays an important role, or significantly new versions of such tools. The paper should also include an evaluation of the tool. Programme Committee: M. Ayala-Rincon, U. Brasilia H. Cirstea, Loria Nancy S. Delaune, ENS Cachan A. Di Pierro, U. Verona G. Dowek, Inria M. Fernandez, KCL, chair J. Giesl, RWTH Aachen U. M. Hanus, CAU Kiel D. Kesner, U. Paris-Diderot T. Kutsia, Johannes Kepler U. Linz J. Levy, IIIA-CSIC Barcelona S. Lucas, Polytechnic U. Valencia C. Lynch, Clarkson U. I. Mackie, E. Polytechnique G. Moser, U. Innsbruck D. Plump, U. York F. van Raamsdonk, VU Amsterdam K. Rose, Two Sigma, US M. Sakai, Nagoya U. A. Scedrov, U. Pennsylvania M. Schmidt-Schauss, U. Frankfurt C. Schuermann, ITU Copenhagen P. Selinger, Dalhousie U. P. Severi, U. Leicester K. Ueda, Waseda U. Conference Chair: Aleksy Schubert Warsaw University For more information, please contact the PC chair: Maribel.Fernandez at kcl.ac.uk From tom.schrijvers at cs.kuleuven.be Tue Oct 21 08:14:01 2014 From: tom.schrijvers at cs.kuleuven.be (Tom Schrijvers) Date: Tue, 21 Oct 2014 10:14:01 +0200 Subject: [Haskell] Postdoc Position in Functional and Constraint Programming at KU Leuven Message-ID: Postdoctoral position in Functional and Constraint Programming at KU Leuven The Declarative Languages and Artificial Intelligence (DTAI) group of KU Leuven (Belgium) invites applicants for a postdoctoral position in the area of functional and constraint programming. The position revolves around domain-specific languages (DSLs) embedded in Haskell for constraint programming. It is part of the EU project GRACeFUL whose overarching theme is tools for collective decision making. The KU Leuven part of the project is under the direction of prof. Tom Schrijvers. To apply you must hold a recent PhD (or be about to graduate) related to either functional or constraint programming. Experience in both areas is an advantage. You will work closely with prof. Schrijvers and his PhD students at KU Leuven, as well as with the GRACeFUL project partners across Europe. The position is for 3 years. The salary is competitive and the starting date negotiable (but no later than February 1). Moreover, KU Leuven's policy of equal opportunities and diversity applies to this position. For the application procedure, see: http://people.cs.kuleuven.be/~tom.schrijvers/postdocposition2.html -- prof. dr. ir. Tom Schrijvers Research Professor KU Leuven Department of Computer Science Celestijnenlaan 200A 3001 Leuven Belgium Phone: +32 16 327 830 http://people.cs.kuleuven.be/~tom.schrijvers/ -------------- next part -------------- An HTML attachment was scrubbed... URL: From dstcruz at gmail.com Thu Oct 23 03:36:20 2014 From: dstcruz at gmail.com (Daniel Santa Cruz) Date: Wed, 22 Oct 2014 21:36:20 -0600 Subject: [Haskell] Haskell Weekly News: Issue 310 Message-ID: Welcome to issue 310 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from October 5 to 18, 2014 Quotes of the Week * spopejoy: That [Spineless Tagless G Machine] will always sound like the villian in an upcoming Ghostbusters sequel to me :) * pigworker: When you can make data out of potatoes, why would you want to encode them as functions? * fishcorn: When someone mentions lens on freenode... [1]zeus-lens! * neelk: So constructively we know this style can be used to meet hard performance deadlines in domains where the penalty for failure is literally radioactive flaming death. * edwardkmett: At one point we had a type in lens where one of its arguments started taking parameters of the form i m a s t a b u. Upon reflection, we let it win the argument and decided not to implement the function. * Ivan Appel: ... while the popular opinion says that the main reason to pick Haskell is "to have fun hacking," in fact it's not so fun to hack in Haskell because there's not such much hacking to do at the first place. For instance, you don't need to spend lots of effort tracing and fixing obscure bugs, so if your definition of "hacking" includes heroic bugfixing, you'd be better off with JavaScript or Perl. Top Reddit Stories * From 60 Frames per Second to 500 in Haskell Domain: keera.co.uk, Score: 116, Comments: 82 Original: [2] http://goo.gl/tiA202 On Reddit: [3] http://goo.gl/sl8TTl * Note: Erik Meijer's MOOC - "Introduction to Functional Programming" starts next Wednesday Domain: edx.org, Score: 109, Comments: 34 Original: [4] http://goo.gl/QNXb5M On Reddit: [5] http://goo.gl/sVfmE4 * The New Haskell.org Domain: blog.haskell.org, Score: 98, Comments: 72 Original: [6] http://goo.gl/TbBGrW On Reddit: [7] http://goo.gl/kdaLFq * New Haskell Book: Thinking Functionally with Haskell Domain: amazon.com, Score: 95, Comments: 39 Original: [8] http://goo.gl/oj35Ox On Reddit: [9] http://goo.gl/rYKq6c * Some notes on reimplementing a NodeJS service in Haskell Domain: gist.github.com, Score: 67, Comments: 5 Original: [10] http://goo.gl/ZoSy2a On Reddit: [11] http://goo.gl/kQ6mOs * Release of threepenny-gui 0.5.0.0: easy UI in Haskell! Domain: apfelmus.nfshost.com, Score: 65, Comments: 1 Original: [12] http://goo.gl/NClc0o On Reddit: [13] http://goo.gl/qDos1R * Bake: a Continuous Integration System Domain: neilmitchell.blogspot.fr, Score: 64, Comments: 34 Original: [14] http://goo.gl/u5bznA On Reddit: [15] http://goo.gl/7oC0N8 * On concerns about Haskell's Prelude favoring Foldable/Traversable Domain: yesodweb.com, Score: 62, Comments: 101 Original: [16] http://goo.gl/yJ7yMJ On Reddit: [17] http://goo.gl/M1M6we * Making GHCi awesomer? Domain: haskell.org, Score: 57, Comments: 3 Original: [18] http://goo.gl/KUkSQ7 On Reddit: [19] http://goo.gl/GRxzb6 * lens over tea, part 1: lenses 101, traversals 101, and some implementation details Domain: artyom.me, Score: 56, Comments: 25 Original: [20] http://goo.gl/rH0tdJ On Reddit: [21] http://goo.gl/jgsBeN * A neat trick for GHCi Domain: mega-nerd.com, Score: 54, Comments: 12 Original: [22] http://goo.gl/o9yrqJ On Reddit: [23] http://goo.gl/oB8Nhb * Shaking up GHC Domain: blogs.ncl.ac.uk, Score: 53, Comments: 21 Original: [24] http://goo.gl/jkRnPn On Reddit: [25] http://goo.gl/byWnxV * FRP Zoo: the TodoMVC of FRP libraries Domain: github.com, Score: 53, Comments: 12 Original: [26] http://goo.gl/JyKRtL On Reddit: [27] http://goo.gl/wJV4Vt * [Video] Simon Peyton Jones - Zero-Cost Coercions in Haskell at Haskell eXchange Domain: skillsmatter.com, Score: 50, Comments: 46 Original: [28] http://goo.gl/yXp43E On Reddit: [29] http://goo.gl/l0mo5O * Bryan O'Sullivan - Performance Measurement and Optimization in Haskell [video] Domain: skillsmatter.com, Score: 49, Comments: 23 Original: [30] http://goo.gl/HO4Sjy On Reddit: [31] http://goo.gl/4sqGgX * How to Rewrite the Prelude Domain: neilmitchell.blogspot.it, Score: 42, Comments: 81 Original: [32] http://goo.gl/PnnoO2 On Reddit: [33] http://goo.gl/EP9CaL * Generalizing function composition Domain: jaspervdj.be, Score: 42, Comments: 31 Original: [34] http://goo.gl/vCfmqT On Reddit: [35] http://goo.gl/GXb4gt * C structures in Haskell FFI Domain: ghc.haskell.org, Score: 40, Comments: 19 Original: [36] http://goo.gl/OT7UFH On Reddit: [37] http://goo.gl/uKJWCl * Yi 0.10, Anniversary Edition Domain: haskell.org, Score: 38, Comments: 16 Original: [38] http://goo.gl/T58nN6 On Reddit: [39] http://goo.gl/Fz6NQo * Curry-Howard, the Ontological Ultimate Domain: psnively.github.io, Score: 38, Comments: 28 Original: [40] http://goo.gl/HpPhXz On Reddit: [41] http://goo.gl/LlYUiM Top StackOverflow Questions * Is it possible to directly invoke Haskell code from Bash and output to stdout? votes: 17, answers: 3 Read on SO: [42] http://goo.gl/jkG0vv * Why does foldr use a helper function? votes: 16, answers: 4 Read on SO: [43] http://goo.gl/hsmIsF * Why do hGetBuf, hPutBuf, etc. allocate memory? votes: 14, answers: 2 Read on SO: [44] http://goo.gl/G40NfW * Is it possible to get the Kind of a Type Constructor in Haskell? votes: 10, answers: 1 Read on SO: [45] http://goo.gl/Pajd4R * Printing out Haskell's evaluation (rewriting) steps for educational/learning purposes. Is it possible? votes: 9, answers: 3 Read on SO: [46] http://goo.gl/Wlfeol Until next time, [47]+Daniel Santa Cruz References 1. https://s3.amazonaws.com/fishcorn/zeus-lens.gif 2. http://keera.co.uk/blog/2014/10/15/from-60-fps-to-500/ 3. http://www.reddit.com/r/haskell/comments/2jbl78/from_60_frames_per_second_to_500_in_haskell/ 4. https://www.edx.org/course/delftx/delftx-fp101x-introduction-functional-2126?fp 5. http://www.reddit.com/r/haskell/comments/2ixpcf/note_erik_meijers_mooc_introduction_to_functional/ 6. https://blog.haskell.org/post/the_new_haskell_org/ 7. http://www.reddit.com/r/haskell/comments/2j4sim/the_new_haskellorg/ 8. http://www.amazon.com/Thinking-Functionally-Haskell-Richard-Bird/dp/1107087201/ref=sr_1_2?ie=UTF8&qid=1413453442&sr=8-2&keywords=graham+hutton+haskell 9. http://www.reddit.com/r/haskell/comments/2jele8/new_haskell_book_thinking_functionally_with/ 10. https://gist.github.com/paf31/9c4d402d400d61a49656 11. http://www.reddit.com/r/haskell/comments/2j8lhd/some_notes_on_reimplementing_a_nodejs_service_in/ 12. http://apfelmus.nfshost.com/blog/2014/10/04-threepenny-gui-0-5.html 13. http://www.reddit.com/r/haskell/comments/2idep2/release_of_threepennygui_0500_easy_ui_in_haskell/ 14. http://neilmitchell.blogspot.fr/2014/10/bake-continuous-integration-system.html 15. http://www.reddit.com/r/haskell/comments/2in244/bake_a_continuous_integration_system/ 16. http://www.yesodweb.com/blog/2014/10/classy-base-prelude 17. http://www.reddit.com/r/haskell/comments/2if0fu/on_concerns_about_haskells_prelude_favoring/ 18. http://www.haskell.org/pipermail/ghc-devs/2014-October/006771.html 19. http://www.reddit.com/r/haskell/comments/2jm4nk/making_ghci_awesomer/ 20. http://artyom.me/lens-over-tea-1 21. http://www.reddit.com/r/haskell/comments/2igp1v/lens_over_tea_part_1_lenses_101_traversals_101/ 22. http://www.mega-nerd.com/erikd/Blog/CodeHacking/Haskell/ghci-trick.html 23. http://www.reddit.com/r/haskell/comments/2jketr/a_neat_trick_for_ghci/ 24. https://blogs.ncl.ac.uk/andreymokhov/shaking-up-ghc/ 25. http://www.reddit.com/r/haskell/comments/2j07m0/shaking_up_ghc/ 26. https://github.com/gelisam/frp-zoo#readme 27. http://www.reddit.com/r/haskell/comments/2j0u4h/frp_zoo_the_todomvc_of_frp_libraries/ 28. https://skillsmatter.com/skillscasts/5296-safe-zero-cost-coercions-in-haskell 29. http://www.reddit.com/r/haskell/comments/2iqrr5/video_simon_peyton_jones_zerocost_coercions_in/ 30. https://skillsmatter.com/skillscasts/5466-bryan-o-sullivan 31. http://www.reddit.com/r/haskell/comments/2is5am/bryan_osullivan_performance_measurement_and/ 32. http://neilmitchell.blogspot.it/2014/10/how-to-rewrite-prelude.html 33. http://www.reddit.com/r/haskell/comments/2icjmf/how_to_rewrite_the_prelude/ 34. http://jaspervdj.be/posts/2014-10-17-generalizing-function-composition.html 35. http://www.reddit.com/r/haskell/comments/2jivxa/generalizing_function_composition/ 36. https://ghc.haskell.org/trac/ghc/wiki/CStructures 37. http://www.reddit.com/r/haskell/comments/2jefui/c_structures_in_haskell_ffi/ 38. http://www.haskell.org/pipermail/haskell-cafe/2014-October/116463.html 39. http://www.reddit.com/r/haskell/comments/2j8pfv/yi_010_anniversary_edition/ 40. http://psnively.github.io/blog/2014/10/14/Curry-Howard-the-Ontological-Ultimate/ 41. http://www.reddit.com/r/haskell/comments/2jb1n7/curryhoward_the_ontological_ultimate/ 42. http://stackoverflow.com/questions/26417136/is-it-possible-to-directly-invoke-haskell-code-from-bash-and-output-to-stdout 43. http://stackoverflow.com/questions/26243014/why-does-foldr-use-a-helper-function 44. http://stackoverflow.com/questions/26333815/why-do-hgetbuf-hputbuf-etc-allocate-memory 45. http://stackoverflow.com/questions/26291740/is-it-possible-to-get-the-kind-of-a-type-constructor-in-haskell 46. http://stackoverflow.com/questions/26214586/printing-out-haskells-evaluation-rewriting-steps-for-educational-learning-pur 47. https://plus.google.com/105107667630152149014/about -------------- next part -------------- An HTML attachment was scrubbed... URL: From yangliu at ntu.edu.sg Thu Oct 23 06:30:00 2014 From: yangliu at ntu.edu.sg (Liu Yang (Asst Prof)) Date: Thu, 23 Oct 2014 06:30:00 +0000 Subject: [Haskell] Multiple Postdoc Positions on Formal Methods for Cyber Security Message-ID: <5A4257BA3B1EEA45B17620B30FD656E12CB19E3F@EXCHMBOX31.staff.main.ntu.edu.sg> Title: Multiple Postdoc Positions on Formal Methods for Cyber Security http://www.ntu.edu.sg/home/yangliu/securify.html Nanyang Technological University and Singapore University of Technology and Design Highly motivated applicants are sought to work on developing and applying verification techniques for infinite state systems in the project on Building Security Verified System. The project aims to fully verify the execution stack of a cyber-physical system: i.e., hardware, operating system, system libraries and applications, using model checking and theorem proving technologies. The postdocs will work with the PAT formal methods research group (www.patroot.com) and other researchers at NTU and SUTD in Singapore. They will also have the opportunity to travel overseas to collaborate with partners of the project, including ETH Zurich, Oxford University, Royal Holloway University of London, University of Luxembourg, Hong Kong University of Science and Technology. Positions for Research Fellow and Senior Research Fellow are available for the following topics: 1. Hardware Verification. The preferred candidates are those with experience in one or more of the following areas: - Formal methods, model checking, theorem proving. - Temporal logics, Higher order logic. - Functional programming. - Hardware design, especially SPARK/LEON architecture Contact: Liu Yang (yangliu at ntu.edu.sg), Alwen Tiu (atiu at ntu.edu.sg) 2. Microkernel Verification The preferred candidates are those with experience in one or more of the following areas: - Formal methods, theorem proving. - Temporal logics, Higher order logic. - Functional programming. - Operating System Design. Contact: Liu Yang (yangliu at ntu.edu.sg) 3. Software Model Checking for Security The preferred candidates are those with experience in one or more of the following areas: - Formal methods, model checking. - Temporal logics. - SMT solvers. - Formal languages and automata. Contact: Jun Sun (sunjun at sutd.edu.sg) and Yang Liu (yangliu at ntu.edu.sg) 4. Runtime security verification The preferred candidates are those with experience in one or more of the following areas: - Temporal and modal logics - First-order theorem proving - Runtime verification - Preferably also backgrounds in operating system and network security Contact: Alwen Tiu (atiu at ntu.edu.sg) 5. Compositional Verification of Security. The preferred candidates are those with experience in one or more of the following areas: - Formal methods, model checking. - Assume-Guarantee Reasoning. - Temporal Logics. - Formal languages and automata. Contact: Yang Liu (yangliu at ntu.edu.sg) and Jun Sun (sunjun at sutd.edu.sg) 6. System Security. The preferred candidates are those with experience in one or more of the following areas: - Binary security and analysis, especially LLVM. - Malware and vulnerabilities. - Mobile platform security. - Embedded system security. - Cloud security. Contact: Yang Liu (yangliu at ntu.edu.sg) 7. Secure Code Generation. The preferred candidates are those with experience in one or more of the following areas: - Formal methods, model checking, theorem proving. - Temporal logics, Higher order logic. - Model driven development. Contact: Yang Liu (yangliu at ntu.edu.sg) The position involves conducting basic research, developing tools, working as part of a research team, travelling, and giving presentations. The working language is English. Apart from specific requirements to each topic candidate general requirements are: - A PhD in Computer Science or related areas is required. - Strong background in logic and discrete math. - Strong programming skills. - An established research record. The term is currently one to three years starting as early as January 2015 till all positions are filled. The salary range is 4000 SGD - 6000 SGD per month for Research Fellows and 6000 - 8000 SGD per month for Senior Research Fellows. Yearly bonus is 1 to 3 month salary based on the performance. Singapore's tax is around 3%-5% of the annual salary. 1USD = 1.25 SGD. Candidates interested in a particular topic or topics should contact the contact person(s) listed in the respective topics above for more details. General inquiries can be directed at either Yang Liu, Jun Sun and Alwen Tiu. ________________________________ CONFIDENTIALITY: This email is intended solely for the person(s) named and may be confidential and/or privileged. If you are not the intended recipient, please delete it, notify us and do not copy, use, or disclose its contents. Towards a sustainable earth: Print only when necessary. Thank you. From compscience.announcement at gmail.com Sun Oct 26 14:40:36 2014 From: compscience.announcement at gmail.com (Klaus Havelund) Date: Sun, 26 Oct 2014 07:40:36 -0700 Subject: [Haskell] NFM 2015 - final call for papers Message-ID: CALL FOR PAPERS The 7th NASA Formal Methods Symposium http://www.NASAFormalMethods.org/nfm2015 27 ? 29 April 2015 Pasadena, California, USA Paper Submission: *** 10 Nov 2014 *** THEME The widespread use and increasing complexity of mission- and safety-critical systems require advanced techniques that address their specification, verification, validation, and certification. The NASA Formal Methods Symposium is a forum for theoreticians and practitioners from academia, industry, and government, with the goals of identifying challenges and providing solutions to achieving assurance in mission- and safety-critical systems. Within NASA such systems include for example autonomous robots, separation assurance algorithms for aircraft, Next Generation Air Transportation (NextGen), and autonomous rendezvous and docking for spacecraft. Moreover, emerging paradigms such as property-based design, code generation, and safety cases are bringing with them new challenges and opportunities. The focus of the symposium will be on formal techniques, their theory, current capabilities, and limitations, as well as their application to aerospace, robotics, and other mission- and safety-critical systems in all design life-cycle stages. We encourage submissions on cross-cutting approaches marrying formal verification techniques with advances in critical system development, such as requirements generation, analysis of aerospace operational concepts, and formal methods integrated in early design stages and carrying throughout system development. TOPICS Topics of interest include, but are not limited to: Model checking Theorem proving SAT and SMT solving Symbolic execution Static analysis Runtime verification Program refinement Compositional verification Modeling and specification formalisms Model-based development Model-based testing Requirement engineering Formal approaches to fault tolerance Security and intrusion detection Applications of formal methods to aerospace systems Applications of formal methods to cyber-physical systems Applications of formal methods to human-machine interaction analysis INVITED SPEAKERS Dino Distefano Software Engineer at Facebook, California, USA and Professor at Queen Mary University of London, UK. Viktor Kuncak Leads Lab for Automated Reasoning and Analysis at EPFL, Lausanne, Switzerland. Rob Manning Chief Engineer at NASA/JPL. IMPORTANT DATES Paper Submission: 10 Nov 2014 Paper Notifications: 12 Jan 2015 Camera-ready Papers: 9 Feb 2015 Symposium: 27 ? 29 April 2015 LOCATION AND COST The symposium will take place at the Hilton Hotel, Pasadena, California, USA, April 27-29, 2015. There will be no registration fee for participants. All interested individuals, including non-US citizens, are welcome to submit, to attend, to listen to the talks, and to participate in discussions; however, all attendees must register. SUBMISSION DETAILS There are two categories of submissions: - Regular papers describing fully developed work and complete results (15 pages) - Short papers describing tools, experience reports, or descriptions of work in progress with preliminary results (6 pages) All papers should be in English and describe original work that has not been published or submitted elsewhere. All submissions will be fully reviewed by members of the Programme Committee. Papers will appear in a volume of Springer?s Lecture Notes on Computer Science (LNCS), and must use LNCS style formatting. Papers should be submitted in PDF format. PC CHAIRS Klaus Havelund, NASA Jet Propulsion Laboratory Gerard Holzmann, NASA Jet Propulsion Laboratory Rajeev Joshi, NASA Jet Propulsion Laboratory PROGRAMME COMMITTEE Erika Abraham, RWTH Aachen University, Germany Julia Badger, NASA Johnson Space Center, USA Christel Baier, Technische Universit?t Dresden, Germany Saddek Bensalem, VERIMAG/UJF, France Dirk Beyer, University of Passau, Germany Armin Biere, Johannes Kepler University, Austria Nikolaj Bjorner, Microsoft Research, USA Borzoo Bonakdarpour, McMaster University, Canada Alessandro Cimatti, Fondazione Bruno Kessler, Italy Leonardo de Moura, Microsoft Research, USA Ewen Denney, NASA Ames Research Center, USA Ben Di Vito, NASA Langley Research Center, USA Dawson Engler, Stanford University, USA Jean-Christophe Filliatre, Universit? Paris-Sud, France Dimitra Giannakopoulou, NASA Ames Research Center, USA Alwyn Goodloe, NASA Langley Research Center, USA Susanne Graf, VERIMAG, France Alex Groce, Oregon State University, USA Radu Grosu, Vienna University of Technology, Austria John Harrison, Intel Corporation, USA Mike Hinchey, University of Limerick/Lero, Ireland Bart Jacobs, University of Leuven, Belgium Sarfraz Khurshid, The University of Texas at Austin, USA Gerwin Klein, NICTA, Australia Daniel Kroening, Oxford University, UK Orna Kupferman, Hebrew University Jerusalem, Israel Kim Larsen, Aalborg University, Denmark Rustan Leino, Microsoft Research, USA Martin Leucker, University of Lubeck, Germany Rupak Majumdar, Max Planck Institute, Germany Pete Manolios, Northeastern University, USA Peter Mueller, ETH Zurich, Switzerland Kedar Namjoshi, Bell Labs/Alcatel-Lucent, USA Corina Pasareanu, NASA Ames Research Center, USA Doron Peled, Bar Ilan University, Israel Suzette Person, NASA Langley Research Center, USA Andreas Podelski, University of Freiburg, Germany Grigore Rosu, University of Illinois, USA Kristin Yvonne Rozier, NASA Ames Research Center, USA Natarajan Shankar, SRI International, USA Natasha Sharygina, University of Lugano, Switzerland Scott Smolka, Stony Brook University, USA Willem Visser, University of Stellenbosch, South Africa Mahesh Viswanathan, University of Illinois, USA Mike Whalen, University of Minnesota, USA Jim Woodcock, University of York, UK STEERING COMMITTEE Julia Badger, NASA Johnson Space Center Ewen Denney, NASA Ames Research Center Ben Di Vito, NASA Langley Research Center Klaus Havelund, NASA Jet Propulsion Laboratory Gerard Holzmann, NASA Jet Propulsion Laboratory Cesar Munoz, NASA Langley Research Center Corina Pasareanu, NASA Ames Research Center Suzette Person, NASA Langley Research Center Kristin Yvonne Rozier, NASA Ames Research Center --- -------------- next part -------------- An HTML attachment was scrubbed... URL: From Hendrik.Tews at FireEye.com Tue Oct 28 15:19:48 2014 From: Hendrik.Tews at FireEye.com (Hendrik Tews) Date: Tue, 28 Oct 2014 16:19:48 +0100 Subject: [Haskell] Job announcement: formal methods engineer and scientific developer at FireEye Message-ID: <877fzkz0ff.fsf@elite.fireeye.com> Dear all, [My excuses if see this email more than once] the FireEye R&D center in Dresden, Germany, seeks outstanding formal-methods experts and scientific programmers to join FireEye's formal methods team in Dresden, Germany. Applicants should have a background in logical reasoning, (formal) software verification and functional programming. Please visit http://FireEye.com/careers for the concrete job descriptions. If you are interested or have questions, please contact me or Roland Carter or visit http://FireEye.com for more information about FireEye. FireEye is a next generation security company that provides the industry's leading threat protection technology. The formal methods team at FireEye works on the (formal) verification of a non-trivial piece of the software stack of one of FireEye's future products. Dresden is one the most beautiful cities in Germany with unique cultural attractions. The FireEye office is in the heart of the city, next to the famous historical center. Bye, Hendrik Tews Formal Methods Engineering Manager at FireEye Germany Head of FireEye Research & Development Dresden phone: +49 351 8503 4745 WWW : http://www.askra.de This email and any attachments thereto may contain private, confidential, and/or privileged material for the sole use of the intended recipient. Any review, copying, or distribution of this email (or any attachments thereto) by others is strictly prohibited. If you are not the intended recipient, please contact the sender immediately and permanently delete the original and any copies of this email and any attachments thereto. From dstcruz at gmail.com Thu Oct 30 03:25:46 2014 From: dstcruz at gmail.com (Daniel Santa Cruz) Date: Wed, 29 Oct 2014 21:25:46 -0600 Subject: [Haskell] Haskell Weekly News: Issue 311 Message-ID: Welcome to issue 311 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers from October 19 to 25, 2014 Quotes of the Week * trap_exit: isn't darcs this haskell powered quantum physics simulator that happens to also keep revisions of files? Top Reddit Stories * "GHC uses GMP, and its performance is nothing short of extraordinary. GHC is clearly tuned to call into GMP with extremely low overheads." Domain: wilfred.me.uk, Score: 79, Comments: 26 Original: [1] http://goo.gl/n6tXA3 On Reddit: [2] http://goo.gl/zTH1v5 * Video games in Haskell: Chips Challenge demo Domain: vimeo.com, Score: 73, Comments: 22 Original: [3] http://goo.gl/EyUQ6t On Reddit: [4] http://goo.gl/8Lrj3I * HLint now spots bad unsafePerformIO Domain: neilmitchell.blogspot.it, Score: 56, Comments: 29 Original: [5] http://goo.gl/sxFywP On Reddit: [6] http://goo.gl/nA0rvs * Seemingly impossible functional programs Domain: math.andrej.com, Score: 56, Comments: 15 Original: [7] http://goo.gl/gtXO9 On Reddit: [8] http://goo.gl/XdTGd7 * New blog post: "Quasi-quoting DSLs for free" Domain: well-typed.com, Score: 55, Comments: 2 Original: [9] http://goo.gl/QbblTr On Reddit: [10] http://goo.gl/hv43hU * Flocking behaviour simulation written using helm. Source in comments. Domain: gfycat.com, Score: 46, Comments: 9 Original: [11] http://goo.gl/MegczW On Reddit: [12] http://goo.gl/aKma9A * Finished reading Learn You a Haskell, please recommend me book number 2: Domain: self.haskell, Score: 41, Comments: 24 Original: [13] http://goo.gl/uQiplX On Reddit: [14] http://goo.gl/uQiplX * Simple Haskell IRC client in "two lines of code" Domain: self.haskell, Score: 40, Comments: 62 Original: [15] http://goo.gl/7SQpZL On Reddit: [16] http://goo.gl/7SQpZL * GPU Programming in Haskell (video) Domain: looprecur.com, Score: 36, Comments: 0 Original: [17] http://goo.gl/7N0rgb On Reddit: [18] http://goo.gl/kjuFle * Are there ANY good game engines for haskell? Domain: self.haskell, Score: 33, Comments: 38 Original: [19] http://goo.gl/6ugfSM On Reddit: [20] http://goo.gl/6ugfSM * Darcs turns 12 Domain: hub.darcs.net, Score: 30, Comments: 8 Original: [21] http://goo.gl/tnNsyR On Reddit: [22] http://goo.gl/DXIYyW Top StackOverflow Questions * Dependent Types: How is the dependent pair type analogous to a disjoint union? votes: 20, answers: 6 Read on SO: [23] http://goo.gl/HOSXJO * How should I read this GHC Core ?proof?? votes: 11, answers: 0 Read on SO: [24] http://goo.gl/3btTZT * more efficient type-level computations using type families? votes: 11, answers: 0 Read on SO: [25] http://goo.gl/LHYecG * How to make fmap rewrite rules fire? votes: 10, answers: 1 Read on SO: [26] http://goo.gl/JrjnJH * A workaround for the ?Template Haskell + C? bug? votes: 8, answers: 1 Read on SO: [27] http://goo.gl/q9sIHZ * Transform a -> a -> Maybe a to take any combination of a's and Maybe a's votes: 8, answers: 2 Read on SO: [28] http://goo.gl/AS4kC0 * Making numeric functions an instance of Num? votes: 7, answers: 2 Read on SO: [29] http://goo.gl/6uNuWB * Inverting a Type Family votes: 7, answers: 2 Read on SO: [30] http://goo.gl/18XHro * FRP frameworks and IO votes: 7, answers: 1 Read on SO: [31] http://goo.gl/BbEWOM Until next time, [32]+Daniel Santa Cruz References 1. http://www.wilfred.me.uk/blog/2014/10/20/the-fastest-bigint-in-the-west/ 2. http://www.reddit.com/r/haskell/comments/2jt37u/ghc_uses_gmp_and_its_performance_is_nothing_short/ 3. https://vimeo.com/109613639 4. http://www.reddit.com/r/haskell/comments/2jwwlj/video_games_in_haskell_chips_challenge_demo/ 5. http://neilmitchell.blogspot.it/2014/10/hlint-now-spots-bad-unsafeperformio.html 6. http://www.reddit.com/r/haskell/comments/2jsa4c/hlint_now_spots_bad_unsafeperformio/ 7. http://math.andrej.com/2007/09/28/seemingly-impossible-functional-programs/ 8. http://www.reddit.com/r/haskell/comments/2k0xg2/seemingly_impossible_functional_programs/ 9. http://www.well-typed.com/blog/2014/10/quasi-quoting-dsls/ 10. http://www.reddit.com/r/haskell/comments/2jowjc/new_blog_post_quasiquoting_dsls_for_free/ 11. http://gfycat.com/WearyAnguishedIggypops 12. http://www.reddit.com/r/haskell/comments/2k51kk/flocking_behaviour_simulation_written_using_helm/ 13. http://www.reddit.com/r/haskell/comments/2kbnzw/finished_reading_learn_you_a_haskell_please/ 14. http://www.reddit.com/r/haskell/comments/2kbnzw/finished_reading_learn_you_a_haskell_please/ 15. http://www.reddit.com/r/haskell/comments/2jvc78/simple_haskell_irc_client_in_two_lines_of_code/ 16. http://www.reddit.com/r/haskell/comments/2jvc78/simple_haskell_irc_client_in_two_lines_of_code/ 17. http://looprecur.com/blog/gpu-programming-in-haskell/ 18. http://www.reddit.com/r/haskell/comments/2jp9y9/gpu_programming_in_haskell_video/ 19. http://www.reddit.com/r/haskell/comments/2k93sm/are_there_any_good_game_engines_for_haskell/ 20. http://www.reddit.com/r/haskell/comments/2k93sm/are_there_any_good_game_engines_for_haskell/ 21. http://hub.darcs.net/darcs/darcs-screened/patch/20021020200105-e9342 22. http://www.reddit.com/r/haskell/comments/2jsvnd/darcs_turns_12/ 23. http://stackoverflow.com/questions/26542350/dependent-types-how-is-the-dependent-pair-type-analogous-to-a-disjoint-union 24. http://stackoverflow.com/questions/26524223/how-should-i-read-this-ghc-core-proof 25. http://stackoverflow.com/questions/26538595/more-efficient-type-level-computations-using-type-families 26. http://stackoverflow.com/questions/26568262/how-to-make-fmap-rewrite-rules-fire 27. http://stackoverflow.com/questions/26449154/a-workaround-for-the-template-haskell-c-bug 28. http://stackoverflow.com/questions/26520261/transform-a-a-maybe-a-to-take-any-combination-of-as-and-maybe-as 29. http://stackoverflow.com/questions/26515102/making-numeric-functions-an-instance-of-num 30. http://stackoverflow.com/questions/26541893/inverting-a-type-family 31. http://stackoverflow.com/questions/26560100/frp-frameworks-and-io 32. https://plus.google.com/105107667630152149014/about -------------- next part -------------- An HTML attachment was scrubbed... URL: