- Haskell - Haskell.org

NOTE: the primary webserver is going down for immediate maintenance.
by Austin Seipp 19 Nov '14

19 Nov '14

Hello *, The primary haskell.org domain, www.haskell.org, is hosted on a system which seems to have lost one of its RAID disks completely. We were planning on moving this machine in the next few weeks to new infrastructure, but we are now expediting this plan and will be doing it ASAP. As we move this server, both the webserver and the mailing system will be going down. Please don't be alarmed if your emails aren't delivered or things go quiet. Many services will continue to work, but we do realize this will be upsetting for many. You can follow the progress on #haskell-infrastructure on Freenode, and see updates on https://status.haskell.org If you need to download something like a GHC binary or Haskell Platform package, you can use https://downloads.haskell.org in the mean time, which is a new service we were hoping to announce more officially soon, but is already working today. Unfortunately we cannot give an expected time of completion for the move, but we'll try to keep people well informed through IRC or something like Reddit. Thanks -- Regards, Austin Seipp, Haskell Consultant Well-Typed LLP, http://www.well-typed.com/

2 1

[ANNOUNCE] New release of SBV (v3.2)
by Levent Erkok 19 Nov '14

19 Nov '14

I'm pleased to announce v3.2 release of SBV, providing facilities for SMT based theorem proving in Haskell. This is mainly a bug-fix/maintenance release, together with one new feature: SBV now implements 'sAssert', which works similar to 'assert' calls in Haskell or other languages to check that certain program invariants always hold. Except, SBV allows the condition to be symbolic, and all violations will be caught and reported as the underlying program is symbolically executed. (For instance, this facility can be useful in other DSL's built on top of SBV to make sure the code they generate never divides by 0, or indexes out of bounds.) Full release notes: https://github.com/LeventErkok/sbv /blob/master/CHANGES.md SBV web page: http://leventerkok.github.io/sbv/ As usual, bug reports and feedback are most welcome! -Levent.

1 0

ANNOUNCE: Haskell Communities and Activities Report (27th ed., November 2014)
by Mihai Maruseac 17 Nov '14

17 Nov '14

On behalf of all the contributors, we are pleased to announce that the Haskell Communities and Activities Report (27th edition, November 2014) is now available, in PDF and HTML formats: http://haskell.org/communities/11-2014/report.pdf http://haskell.org/communities/11-2014/html/report.html Many thanks go to all the people that contributed to this report, both directly, by sending in descriptions, and indirectly, by doing all the interesting things that are reported. We hope you will find it as interesting a read as we did. If you have not encountered the Haskell Communities and Activities Reports before, you may like to know that the first of these reports was published in November 2001. Their goal is to improve the communication between the increasingly diverse groups, projects, and individuals working on, with, or inspired by Haskell. The idea behind these reports is simple: Every six months, a call goes out to all of you enjoying Haskell to contribute brief summaries of your own area of work. Many of you respond (eagerly, unprompted, and sometimes in time for the actual deadline) to the call. The editors collect all the contributions into a single report and feed that back to the community. When we try for the next update, six months from now, you might want to report on your own work, project, research area or group as well. So, please put the following into your diaries now: ======================================== End of April 2015: target deadline for contributions to the May 2015 edition of the HC&A Report ======================================== Unfortunately, many Haskellers working on interesting projects are so busy with their work that they seem to have lost the time to follow the Haskell related mailing lists and newsgroups, and have trouble even finding time to report on their work. If you are a member, user or friend of a project so burdened, please find someone willing to make time to report and ask them to "register" with the editors for a simple e-mail reminder in October (you could point us to them as well, and we can then politely ask if they want to contribute, but it might work better if you do the initial asking). Of course, they will still have to find the ten to fifteen minutes to draw up their report, but maybe we can increase our coverage of all that is going on in the community. Feel free to circulate this announcement further in order to reach people who might otherwise not see it. Enjoy! Mihai Maruseac and Alejandro Serrano Mena <hcar at haskell.org> -- Mihai Maruseac (MM) "If you don't know, the thing to do is not to get scared, but to learn." -- Atlas Shrugged.

2 1

Call for Presentations: Compose Conference [New York, Jan 30-Feb 1]
by Gershom B 16 Nov '14

16 Nov '14

Compose is a new conference for typed functional programmers, focused specifically on Haskell, OCaml, F#, and related technologies. It will be held in New York from Jan 30-Feb 1, and registration is opening shortly. http://www.composeconference.org/ Below is our call for presentations. We recognize the deadline is tight, so feel free to submit proposals and ideas on the less-polished side. Call for Presentations and Speakers. http://www.composeconference.org/call/index.html --- The audience for Compose is Haskell, OCaml, or F# developers who are looking to increase their skills or learn new technologies and libraries. Presentations should be aimed at teaching or introducing new ideas or tools. We are also interested in presentations aiming at taking complex concepts, such as program derivation, and putting them into productive use. However proposals on anything that you suspect our audience may find interesting are welcome. The following are some of the types of talks we would welcome: Library/Tool Talks — Exploring the uses of a powerful toolkit or library, be it for parsing, testing, data access and analysis, or anything else. Production Systems — Experience reports on deploying functional techniques in real systems; insights revealed, mistakes made, lessons learned. Theory made Practical — Just because it’s locked away in papers doesn’t mean it’s hard! Accessible lectures on classic results and why they matter to us today. Such talks can include simply introducing the principles of a field of research so as to help the audience read up on it in the future; from abstract machines to program derivation to branch-and-bound algorithms, the sky’s the limit. We also welcome proposals for more formal tutorials for the Sunday unconference. Such tutorials should be aimed at a smaller audience of beginner-to-novice understanding, and ideally include hands-on exercises. The due date for submissions is November 30, 2014. We will send out notice of acceptance by 10 December. We prefer that submissions be via the EasyChair website (https://easychair.org/conferences/?conf=compose2015) Please suggest a title, and describe the topic you intend to speak on. Additional information may be included on both your expertise and the interesting elements of your topic, going on what might be included in a public abstract. Furthermore, if your abstract doesn't feel "final"—don't worry! We'll work with you to polish it up. If you want to discuss your proposal(s) before submitting, or to further nail down what you intend to speak on, please feel free to contact us at info(a)composeconference.org. We're happy to work with you, even if you are a new or inexperienced speaker, to help your talk be great. —Gershom

1 0

RDP 2015 Last Call for Workshops
by Aleksy Schubert 10 Nov '14

10 Nov '14

[apologies for cross posting] ----------------------------------------------------------------------- RDP 2015 Last Call for Workshops (Rewriting, Deduction, and Programming, June-July 2015, Warsaw, Poland) ----------------------------------------------------------------------- RDP 2015 is the eighth edition of the International Conference on Rewriting, Deduction, and Programming, consisting of two main conferences * RTA (Rewriting Techniques and Applications) * TLCA (Typed Lambda Calculi and Applications) Previous RDPs were held in 2003 in Valencia (Spain), 2004 in Aachen (Germany), 2005 in Nara (Japan), 2007 in Paris (France), 2009 in Brasilia (Brasil), 2011 in Novi Sad (Serbia), 2013 in Eindhoven (The Netherlands). We solicit proposals for satellite workshops of RDP 2015 that are related in topics to one or both of the RDP conferences. We plan the workshops to proceed for up to 2 days (possibilities of longer workshops should be discussed with the organisers). It is tradition at RDP that attendance to workshops is open to participants of parallel events, similar to the way FLoC workshops are run. There will be one day (Sunday, June 28, 2015) reserved for workshops only, however, it will also be possible to run workshops on the other days in parallel to one of the main conferences. RDP will provide the possibility to print workshop proceedings, details of the procedure will be posted later by the local organising committee. RDP will not be able to reimburse invited workshop speakers for travel or living expenses, though it may be possible to waive part of the registration fees for invited speakers. The priority of RDP will be to keep registration fees for the conferences and workshops low. If you want to organise a workshop, please send the following information to rdp15(a)mimuw.edu.pl: * Workshop title and description of the topic * Names and affiliations of the organisers * Pointers to descriptions of previous editions of the workshop, if any * Proposed workshop duration (from one day to two days) * Proposed format and agenda (for example, paper presentations, tutorials, demo sessions, etc.) * Plans for invited speakers or special sessions (round-table discussion, tutorials, etc.) * Estimate of the audience size * Procedures for selecting papers and participants * Plans for the publication of proceedings (informal proceedings distributed to participants, electronic journal, proceedings with separate selection process, etc.) * Other potential organisational issues IMPORTANT DATES Submission of workshop proposals: November 18, 2014 (Tuesday) Notification date: November 26, 2014 (Wednesday) Workshop dates: June 28-July 3, 2014 (Sunday-Friday) CONTACT INFORMATION Questions regarding workshop proposals should be sent to rdp15(a)mimuw.edu.pl. RDP 2015 MAIN ORGANISER Aleksy Schubert http://www.mimuw.edu.pl/~alx/ Faculty of Mathematics, Informatics and Mechanics University of Warsaw

1 0

ICFP 2015: Call for Papers
by David Van Horn 07 Nov '14

07 Nov '14

===================================================================== 20th ACM SIGPLAN International Conference on Functional Programming ICFP 2015 Vancouver, Canada, August 31 - September 2, 2015 http://www.icfpconference.org/icfp2015 ===================================================================== Important Dates ~~~~~~~~~~~~~~~ Submissions due: Friday, February 27 2015, 23:59 UTC-11 Author response: Tuesday, April 21, 2015 through Thursday, 23 April, 2015 Notification: Friday, May 1, 2015 Final copy due: Friday, June 12, 2015 Scope ~~~~~ ICFP 2015 seeks original papers on the art and science of functional programming. Submissions are invited on all topics from principles to practice, from foundations to features, and from abstraction to application. The scope includes all languages that encourage functional programming, including both purely applicative and imperative languages, as well as languages with objects, concurrency, or parallelism. Topics of interest include (but are not limited to): * Language Design: concurrency, parallelism, and distribution; modules; components and composition; metaprogramming; type systems; interoperability; domain-specific languages; and relations to imperative, object-oriented, or logic programming. * Implementation: abstract machines; virtual machines; interpretation; compilation; compile-time and run-time optimization; garbage collection and memory management; multi-threading; exploiting parallel hardware; interfaces to foreign functions, services, components, or low-level machine resources. * Software-Development Techniques: algorithms and data structures; design patterns; specification; verification; validation; proof assistants; debugging; testing; tracing; profiling. * Foundations: formal semantics; lambda calculus; rewriting; type theory; monads; continuations; control; state; effects; program verification; dependent types. * Analysis and Transformation: control-flow; data-flow; abstract interpretation; partial evaluation; program calculation. * Applications: symbolic computing; formal-methods tools; artificial intelligence; systems programming; distributed-systems and web programming; hardware design; databases; XML processing; scientific and numerical computing; graphical user interfaces; multimedia and 3D graphics programming; scripting; system administration; security. * Education: teaching introductory programming; parallel programming; mathematical proof; algebra. * Functional Pearls: elegant, instructive, and fun essays on functional programming. * Experience Reports: short papers that provide evidence that functional programming really works or describe obstacles that have kept it from working. If you are concerned about the appropriateness of some topic, do not hesitate to contact the program chair. Abbreviated instructions for authors ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ * By Friday, 27 February 2015, 23:59 UTC-11 (anywhere in the world), submit a full paper of at most 12 pages (6 pages for an Experience Report) in standard ACM conference format, including bibliography, figures, and appendices. The deadlines will be strictly enforced and papers exceeding the page limits will be summarily rejected. * Authors have the option to attach supplementary material to a submission, on the understanding that reviewers may choose not to look at it. * Each submission must adhere to SIGPLAN's republication policy, as explained on the web at http://www.sigplan.org/Resources/Policies/Republication * Authors of resubmitted (but previously rejected) papers have the option to attach an annotated copy of the reviews of their previous submission(s), explaining how they have addressed these previous reviews in the present submission. If a reviewer identifies him/herself as a reviewer of this previous submission and wishes to see how his/her comments have been addressed, the program chair will communicate to this reviewer the annotated copy of his/her previous review. Otherwise, no reviewer will read the annotated copies of the previous reviews. Overall, a submission will be evaluated according to its relevance, correctness, significance, originality, and clarity. It should explain its contributions in both general and technical terms, clearly identifying what has been accomplished, explaining why it is significant, and comparing it with previous work. The technical content should be accessible to a broad audience. Functional Pearls and Experience Reports are separate categories of papers that need not report original research results and must be marked as such at the time of submission. Detailed guidelines on both categories are on the conference web site. Proceedings will be published by ACM Press. Authors of accepted submissions will have a choice of one of three ways to manage their publication rights. These choices are described at http://authors.acm.org/main.html Presentations will be videotaped and released online if the presenter consents. The proceedings will be freely available for download from the ACM Digital Library from one week before the start of the conference until two weeks after the conference. Formatting: Submissions must be in PDF format printable in black and white on US Letter sized paper and interpretable by Ghostscript. Papers must adhere to the standard ACM conference format: two columns, nine-point font on a ten-point baseline, with columns 20pc (3.33in) wide and 54pc (9in) tall, with a column gutter of 2pc (0.33in). A suitable document template for LaTeX is available at http://www.acm.org/sigs/sigplan/authorInformation.htm Submission: Submissions will be accepted on the web using a link that will be posted at http://icfpconference.org/icfp2015/ Improved versions of a paper may be submitted at any point before the submission deadline using the same web interface. Author response: Authors will have a 72-hour period, starting at 0:00 UTC on Tuesday, 21 April 2015, to read reviews and respond to them. ACM Author-Izer is a unique service that enables ACM authors to generate and post links on either their home page or institutional repository for visitors to download the definitive version of their articles from the ACM Digital Library at no charge. Downloads through Author-Izer links are captured in official ACM statistics, improving the accuracy of usage and impact measurements. Consistently linking the definitive version of ACM article should reduce user confusion over article versioning. After your article has been published and assigned to your ACM Author Profile page, please visit http://www.acm.org/publications/acm-author-izer-service to learn how to create your links for free downloads from the ACM DL. Publication date: The official publication date of accepted papers is the date the proceedings are made available in the ACM Digital Library. This date may be up to two weeks prior to the first day of the conference. The official publication date affects the deadline for any patent filings related to published work. General Chair: Kathleen Fisher Tufts University (USA) Program Chair: John Reppy University of Chicago (USA) Program Committee: Amal Ahmed Northeastern University (USA) Jean-Philippe Bernardy Chalmers University of Technology (Sweden) Matthias Blume Google (USA) William Byrd University of Utah (USA) Andy Gill University of Kansas (USA) Neal Glew Google (USA) Fritz Henglein University of Copenhagen (Denmark) Gabriele Keller University of New South Wales and NICTA (Australia) Andrew Kennedy Microsoft Research Cambridge (UK) Neelakantan Krishnaswami Birmingham University (UK) Daan Leijen Microsoft Research Redmond (USA) Keiko Nakata Institute of Cybernetics at Tallinn University of Technology (Estonia) Mike Rainey INRIA Rocquencourt (France) Andreas Rossberg Google (Germany) Manuel Serrano INRIA Sophia Antipolis (France) Simon Thompson University of Kent (UK) David Van Horn University of Maryland (USA) Stephanie Weirich University of Pennsylvania (USA)

1 0

NFM 2015 - deadline extension: Nov 18
by Klaus Havelund 03 Nov '14

03 Nov '14

CALL FOR PAPERS *** Deadline extension: Nov 18, 2014 *** The 7th NASA Formal Methods Symposium http://www.NASAFormalMethods.org/nfm2015 <http://www.nasaformalmethods.org/nfm2015> 27 – 29 April 2015 Pasadena, California, USA 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 <http://www.eecs.qmul.ac.uk/~ddino/> Software Engineer at Facebook, California, USA and Professor at Queen Mary University of London, UK. Viktor Kuncak <http://lara.epfl.ch/~kuncak/> Leads Lab for Automated Reasoning and Analysis at EPFL, Lausanne, Switzerland. Rob Manning <https://www.linkedin.com/pub/rob-manning/54/16a/71b> Chief Engineer at NASA/JPL. IMPORTANT DATESPaper Submission (*** deadline extended one week ***):18 Nov 2014Paper Notifications:12 Jan 2015Camera-ready Papers:9 Feb 2015Symposium:27 – 29 April 2015LOCATION 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: 1. Regular papers describing fully developed work and complete results (15 pages) 2. 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, USA Gerard Holzmann, NASA Jet Propulsion Laboratory, USA Rajeev Joshi, NASA Jet Propulsion Laboratory, USA PUBLICITY SUPPORT Ylies Falcone, Université Joseph Fourier, France 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

1 0

Haskell Weekly News: Issue 311
by Daniel Santa Cruz 30 Oct '14

30 Oct '14

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_perfor… 3. https://vimeo.com/109613639 4. http://www.reddit.com/r/haskell/comments/2jwwlj/video_games_in_haskell_chip… 5. http://neilmitchell.blogspot.it/2014/10/hlint-now-spots-bad-unsafeperformio… 6. http://www.reddit.com/r/haskell/comments/2jsa4c/hlint_now_spots_bad_unsafep… 7. http://math.andrej.com/2007/09/28/seemingly-impossible-functional-programs/ 8. http://www.reddit.com/r/haskell/comments/2k0xg2/seemingly_impossible_functi… 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_… 11. http://gfycat.com/WearyAnguishedIggypops 12. http://www.reddit.com/r/haskell/comments/2k51kk/flocking_behaviour_simulati… 13. http://www.reddit.com/r/haskell/comments/2kbnzw/finished_reading_learn_you_… 14. http://www.reddit.com/r/haskell/comments/2kbnzw/finished_reading_learn_you_… 15. http://www.reddit.com/r/haskell/comments/2jvc78/simple_haskell_irc_client_i… 16. http://www.reddit.com/r/haskell/comments/2jvc78/simple_haskell_irc_client_i… 17. http://looprecur.com/blog/gpu-programming-in-haskell/ 18. http://www.reddit.com/r/haskell/comments/2jp9y9/gpu_programming_in_haskell_… 19. http://www.reddit.com/r/haskell/comments/2k93sm/are_there_any_good_game_eng… 20. http://www.reddit.com/r/haskell/comments/2k93sm/are_there_any_good_game_eng… 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-depe… 24. http://stackoverflow.com/questions/26524223/how-should-i-read-this-ghc-core… 25. http://stackoverflow.com/questions/26538595/more-efficient-type-level-compu… 26. http://stackoverflow.com/questions/26568262/how-to-make-fmap-rewrite-rules-… 27. http://stackoverflow.com/questions/26449154/a-workaround-for-the-template-h… 28. http://stackoverflow.com/questions/26520261/transform-a-a-maybe-a-to-take-a… 29. http://stackoverflow.com/questions/26515102/making-numeric-functions-an-ins… 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

1 0

Job announcement: formal methods engineer and scientific developer at FireEye
by Hendrik Tews 28 Oct '14

28 Oct '14

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 <roland.carter(a)FireEye.com> 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.

1 0

NFM 2015 - final call for papers
by Klaus Havelund 26 Oct '14

26 Oct '14

CALL FOR PAPERS The 7th NASA Formal Methods Symposium http://www.NASAFormalMethods.org/nfm2015 <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 ---

1 0