October 2014 - Haskell

ANNOUNCE: ioctl 0.0.1
by Maciej Piechotka 13 Sep '15

13 Sep '15

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

2 1

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

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