- Haskell - Haskell.org

Multiple Postdoc Positions on Formal Methods for Cyber Security
by Liu Yang (Asst Prof) 23 Oct '14

23 Oct '14

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(a)ntu.edu.sg) Alwen Tiu (atiu(a)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(a)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(a)sutd.edu.sg) and Yang Liu (yangliu(a)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(a)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(a)ntu.edu.sg) and Jun Sun (sunjun(a)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(a)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(a)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.

1 0

Haskell Weekly News: Issue 310
by Daniel Santa Cruz 23 Oct '14

23 Oct '14

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_t… 4. https://www.edx.org/course/delftx/delftx-fp101x-introduction-functional-212… 5. http://www.reddit.com/r/haskell/comments/2ixpcf/note_erik_meijers_mooc_intr… 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/1107087… 9. http://www.reddit.com/r/haskell/comments/2jele8/new_haskell_book_thinking_f… 10. https://gist.github.com/paf31/9c4d402d400d61a49656 11. http://www.reddit.com/r/haskell/comments/2j8lhd/some_notes_on_reimplementin… 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_05… 14. http://neilmitchell.blogspot.fr/2014/10/bake-continuous-integration-system.… 15. http://www.reddit.com/r/haskell/comments/2in244/bake_a_continuous_integrati… 16. http://www.yesodweb.com/blog/2014/10/classy-base-prelude 17. http://www.reddit.com/r/haskell/comments/2if0fu/on_concerns_about_haskells_… 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… 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_… 28. https://skillsmatter.com/skillscasts/5296-safe-zero-cost-coercions-in-haske… 29. http://www.reddit.com/r/haskell/comments/2iqrr5/video_simon_peyton_jones_ze… 30. https://skillsmatter.com/skillscasts/5466-bryan-o-sullivan 31. http://www.reddit.com/r/haskell/comments/2is5am/bryan_osullivan_performance… 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_compo… 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-Ulti… 41. http://www.reddit.com/r/haskell/comments/2jb1n7/curryhoward_the_ontological… 42. http://stackoverflow.com/questions/26417136/is-it-possible-to-directly-invo… 43. http://stackoverflow.com/questions/26243014/why-does-foldr-use-a-helper-fun… 44. http://stackoverflow.com/questions/26333815/why-do-hgetbuf-hputbuf-etc-allo… 45. http://stackoverflow.com/questions/26291740/is-it-possible-to-get-the-kind-… 46. http://stackoverflow.com/questions/26214586/printing-out-haskells-evaluatio… 47. https://plus.google.com/105107667630152149014/about

1 0

Postdoc Position in Functional and Constraint Programming at KU Leuven
by Tom Schrijvers 21 Oct '14

21 Oct '14

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/

1 0

RTA 2015 - First Call For Papers
by Michael Hanus 20 Oct '14

20 Oct '14

================================================================== 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(a)kcl.ac.uk

1 0

ICFEM 2014, Luxembourg, 3-7 November 2014: Last Call for Participation
by Liu Yang (Asst Prof) 17 Oct '14

17 Oct '14

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.

1 0

[JOB] Summer internships at Jane Street
by Yaron Minsky 16 Oct '14

16 Oct '14

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.)

1 0

ANN: yi-0.10.0 , the text editor written in Haskell
by Mateusz Kowalczyk 14 Oct '14

14 Oct '14

-----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-----

1 0

Mathematics of Program Construction (MPC 2015): first call for papers
by José Pedro Magalhães 10 Oct '14

10 Oct '14

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(a)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(a)informatik.uni-bonn.de.

1 0

Re: [Haskell] [Haskell-cafe] What happened to hugs?
by Gershom B 10 Oct '14

10 Oct '14

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(a)haskell.org. -gershom On September 25, 2014 at 11:57:58 PM, Rustom Mody (rustompmody(a)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(a)haskell.org > http://www.haskell.org/mailman/listinfo/haskell-cafe >

1 0

ICFP 2015 Call for Workshop and Co-located Event Proposals
by David Van Horn 09 Oct '14

09 Oct '14

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(a)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(a)cs.kuleuven.be.

1 0