- Haskell - Haskell.org

Haskell Weekly News: Issue 267
by Daniel Santa Cruz 16 May '13

16 May '13

Welcome to issue 267 of the HWN, an issue covering crowd-sourced bits of information about Haskell from around the web. This issue covers the week of April 28 to May 11, 2013. Quotes of the Week * ciaranm: a category is just a category in the category of categories * cmccann: the Either monad is like the Maybe monad, except with something instead of Nothing. * sclv: Q: Why are the adjunctions of Galois connections backwards? A: He never got the hang of duals. * acowley: blackdog's experience with IDEs is apparently both more sensual and more culinary than mine * cmccann: shachaf jokes are what the quotes section of HWN is for. cmccann: though lately there have been not as many :[ shachaf: cmccann: Hey, there wasn't a single shachaf quote in the last HWN! shachaf: Leave me alone. shachaf: There were two cmccann quotes. * edwardk: cmccann: i'm NDA'd out of that space for a while ;) elliott: edwardk just collects NDAs so that he can focus. * trapdInIO: in java everything happens elsewhere * edwardk: i never bothered to release the c preprocessor because it was entangled with an old compiler of mind * acowley: I get nervous when I haven't triggered the impossible for more than a month or so :/ * hpc: be careful, excessive consumption of lenses will go straight to your type signature * acowley: The longer I leave this function named "jumanji" the less I want to find a better name * ion: The next step is unsafeCoerce. At that point youâre halfway into implementing lens. * bos: i'm not sure edwardk is a good model to follow. (a) because you won't be able to, and (b) because you won't be able to. Top Reddit Stories * John Carmack interested in doing a moderate-sized project in Haskell Domain: twitter.com, Score: 136, Comments: 30 On Reddit: [1] http://goo.gl/7rJpH Original: [2] http://goo.gl/yL9kV * John Carmack starting port of Wolf 3D in Haskell Domain: twitter.com, Score: 108, Comments: 19 On Reddit: [3] http://goo.gl/MKkiI Original: [4] http://goo.gl/SN7Mp * Haskell for all: Program imperatively using Haskell lenses Domain: haskellforall.com, Score: 103, Comments: 80 On Reddit: [5] http://goo.gl/FIfUd Original: [6] http://goo.gl/zkEHI * unm-hip a Haskell Image Processing Library Domain: self.haskell, Score: 71, Comments: 18 On Reddit: [7] http://goo.gl/erMhx Original: [8] http://goo.gl/erMhx * Crit-bit trees in Haskell: fast, and open to contributors! Domain: github.com, Score: 56, Comments: 16 On Reddit: [9] http://goo.gl/1vQMS Original: [10] http://goo.gl/08byj * Tutorial on HLearn's Markov networks, monoids, and "type level lenses" explained with Futurama Domain: izbicki.me, Score: 53, Comments: 10 On Reddit: [11] http://goo.gl/3mYuD Original: [12] http://goo.gl/4WjnU * Cool mailing list archive I stumbled on: Haskell controlling garbage trucks Domain: haskell.org, Score: 49, Comments: 2 On Reddit: [13] http://goo.gl/h8p4y Original: [14] http://goo.gl/kSGkx * Haskell intuition Domain: self.haskell, Score: 49, Comments: 23 On Reddit: [15] http://goo.gl/F04IM Original: [16] http://goo.gl/F04IM * The Difference between Recursion & Induction Domain: blog.ezyang.com, Score: 47, Comments: 3 On Reddit: [17] http://goo.gl/mZN3T Original: [18] http://goo.gl/z2jZx * Yesod 1.2 released Domain: yesodweb.com, Score: 45, Comments: 8 On Reddit: [19] http://goo.gl/el7dt Original: [20] http://goo.gl/lqBM9 * Haskell 2014 committee has now been formed Domain: thread.gmane.org, Score: 42, Comments: 27 On Reddit: [21] http://goo.gl/okojc Original: [22] http://goo.gl/1g6FG * Web Frameworks Benchmark 4 (includes WAI) Domain: techempower.com, Score: 41, Comments: 60 On Reddit: [23] http://goo.gl/FLGJu Original: [24] http://goo.gl/AJbhV * Haskell for all: pipes-3.3.0: Folds and uniting ListT with Proxy Domain: haskellforall.com, Score: 41, Comments: 14 On Reddit: [25] http://goo.gl/sO1EK Original: [26] http://goo.gl/5rZ0u * First working program using the Repa plugin Domain: disciple-devel.blogspot.com, Score: 39, Comments: 5 On Reddit: [27] http://goo.gl/bQgfV Original: [28] http://goo.gl/9K5Qk * How to use Hoogle from GHCi Domain: youtube.com, Score: 36, Comments: 2 On Reddit: [29] http://goo.gl/9V9o7 Original: [30] http://goo.gl/LU7Zk * 4th Episode of "The Pragmatic Haskeller": HTTP and more Domain: cakesolutions.net, Score: 35, Comments: 3 On Reddit: [31] http://goo.gl/rMLyC Original: [32] http://goo.gl/npjKm * A monadic joke Domain: self.haskell, Score: 34, Comments: 28 On Reddit: [33] http://goo.gl/OmwSp Original: [34] http://goo.gl/OmwSp * A "Natural" Theorem Prover in Haskell — By Tim Gowers! Domain: gowers.wordpress.com, Score: 34, Comments: 5 On Reddit: [35] http://goo.gl/OomyR Original: [36] http://goo.gl/LWNHW * Towards a Haskell Logic Library Domain: spin.atomicobject.com, Score: 30, Comments: 1 On Reddit: [37] http://goo.gl/puVS7 Original: [38] http://goo.gl/7dXA0 * Barabra Liskov - Keynote: The Power of Abstraction Domain: infoq.com, Score: 29, Comments: 25 On Reddit: [39] http://goo.gl/B7AZJ Original: [40] http://goo.gl/SSYSm Top StackOverflow Questions * What constitutes a fold for types other than list? votes: 34, answers: 4 Read on SO: [41] http://goo.gl/AkbgP * Lazy vs Strict implementations of data structures votes: 19, answers: 2 Read on SO: [42] http://goo.gl/De1VO * Compiling very large constants with GHC votes: 17, answers: 1 Read on SO: [43] http://goo.gl/mWOMz * Haskell Tree splitting: Can someone please explain this line? votes: 16, answers: 1 Read on SO: [44] http://goo.gl/ZVaQE * Could cabal notice about unused package in dependencies? votes: 15, answers: 1 Read on SO: [45] http://goo.gl/IUOx2 * How can eta-reduction of a well typed function result in a type error? votes: 14, answers: 2 Read on SO: [46] http://goo.gl/3A4hu * What is so special about Monads? votes: 14, answers: 4 Read on SO: [47] http://goo.gl/CF7BC * Why does ghci desugar type lists and type families? Can this be selectively disabled? votes: 13, answers: 0 Read on SO: [48] http://goo.gl/QBmM7 * How are functors in Haskell and OCaml similar? votes: 13, answers: 1 Read on SO: [49] http://goo.gl/rIYKy * Monitoring GHC activity votes: 10, answers: 1 Read on SO: [50] http://goo.gl/q7WuU * Why isn't the Prelude's words function written more simply? votes: 10, answers: 1 Read on SO: [51] http://goo.gl/W1TqA * How to design a monadic stack? votes: 10, answers: 2 Read on SO: [52] http://goo.gl/LAeJI * How to generate arbitrary instances of a simple type for quickcheck votes: 9, answers: 2 Read on SO: [53] http://goo.gl/oCesk Until next time, +Daniel Santa Cruz References 1. https://twitter.com/ID_AA_Carmack/status/331557216488390656 2. http://www.reddit.com/r/haskell/comments/1dv4ij/john_carmack_interested_in_… 3. https://twitter.com/id_aa_carmack/status/331918309916295168 4. http://www.reddit.com/r/haskell/comments/1dwjup/john_carmack_starting_port_… 5. http://www.haskellforall.com/2013/05/program-imperatively-using-haskell.html 6. http://www.reddit.com/r/haskell/comments/1dpk2b/haskell_for_all_program_imp… 7. http://www.reddit.com/r/haskell/comments/1dzk73/unmhip_a_haskell_image_proc… 8. http://www.reddit.com/r/haskell/comments/1dzk73/unmhip_a_haskell_image_proc… 9. https://github.com/bos/critbit 10. http://www.reddit.com/r/haskell/comments/1e1ywq/critbit_trees_in_haskell_fa… 11. http://izbicki.me/blog/markov-networks-monoids-and-futurama 12. http://www.reddit.com/r/haskell/comments/1e0759/tutorial_on_hlearns_markov_… 13. http://www.haskell.org/pipermail/haskell-cafe/2010-April/075647.html 14. http://www.reddit.com/r/haskell/comments/1df8fy/cool_mailing_list_archive_i… 15. http://www.reddit.com/r/haskell/comments/1e3cl0/haskell_intuition/ 16. http://www.reddit.com/r/haskell/comments/1e3cl0/haskell_intuition/ 17. http://blog.ezyang.com/2013/04/the-difference-between-recursion-induction/ 18. http://www.reddit.com/r/haskell/comments/1dbwp4/the_difference_between_recu… 19. http://www.yesodweb.com/blog/2013/05/yesod-1-2-released 20. http://www.reddit.com/r/haskell/comments/1dko1d/yesod_12_released/ 21. http://thread.gmane.org/gmane.comp.lang.haskell.general/19796 22. http://www.reddit.com/r/haskell/comments/1dhbjr/haskell_2014_committee_has_… 23. http://www.techempower.com/blog/2013/05/02/frameworks-round-4/ 24. http://www.reddit.com/r/haskell/comments/1dk73s/web_frameworks_benchmark_4_… 25. http://www.haskellforall.com/2013/05/pipes-330-folds-and-uniting-listt-with… 26. http://www.reddit.com/r/haskell/comments/1dsuto/haskell_for_all_pipes330_fo… 27. http://disciple-devel.blogspot.com/2013/05/first-working-program-using-repa… 28. http://www.reddit.com/r/haskell/comments/1dm7a6/first_working_program_using… 29. http://www.youtube.com/watch?v=QpDQhGYPqkU 30. http://www.reddit.com/r/haskell/comments/1dxx4m/how_to_use_hoogle_from_ghci/ 31. http://www.cakesolutions.net/teamblogs/2013/04/28/tph-episode-4-http-and-mo… 32. http://www.reddit.com/r/haskell/comments/1d9zou/4th_episode_of_the_pragmati… 33. http://www.reddit.com/r/haskell/comments/1dcfso/a_monadic_joke/ 34. http://www.reddit.com/r/haskell/comments/1dcfso/a_monadic_joke/ 35. http://gowers.wordpress.com/2013/04/14/answers-results-of-polls-and-a-brief… 36. http://www.reddit.com/r/haskell/comments/1dtw7v/a_natural_theorem_prover_in… 37. http://spin.atomicobject.com/2013/05/10/haskell-logic-library/?utm_source=t… 38. http://www.reddit.com/r/haskell/comments/1e2okw/towards_a_haskell_logic_lib… 39. http://www.infoq.com/presentations/programming-abstraction-liskov 40. http://www.reddit.com/r/haskell/comments/1dodfb/barabra_liskov_keynote_the_… 41. http://stackoverflow.com/questions/16426463/what-constitutes-a-fold-for-typ… 42. http://stackoverflow.com/questions/16296571/lazy-vs-strict-implementations-… 43. http://stackoverflow.com/questions/16348340/compiling-very-large-constants-… 44. http://stackoverflow.com/questions/16267497/haskell-tree-splitting-can-some… 45. http://stackoverflow.com/questions/16390273/could-cabal-notice-about-unused… 46. http://stackoverflow.com/questions/16402942/how-can-eta-reduction-of-a-well… 47. http://stackoverflow.com/questions/16439025/what-is-so-special-about-monads 48. http://stackoverflow.com/questions/16346293/why-does-ghci-desugar-type-list… 49. http://stackoverflow.com/questions/16353066/how-are-functors-in-haskell-and… 50. http://stackoverflow.com/questions/16348118/monitoring-ghc-activity 51. http://stackoverflow.com/questions/16446274/why-isnt-the-preludes-words-fun… 52. http://stackoverflow.com/questions/16457111/how-to-design-a-monadic-stack 53. http://stackoverflow.com/questions/16440208/how-to-generate-arbitrary-insta… 54. https://plus.google.com/105107667630152149014/about

1 0

Invitation to connect on LinkedIn
by Daniel Díaz Casanueva 15 May '13

15 May '13

LinkedIn ------------ Daniel Díaz Casanueva requested to add you as a connection on LinkedIn: ------------------------------------------ Adrian, I'd like to add you to my professional network on LinkedIn. - Daniel Accept invitation from Daniel Díaz Casanueva http://www.linkedin.com/e/-y1615u-hgr1efjt-n/A5eR2FIG5M9-4jk43rQ4JqtVY2yX2K… View profile of Daniel Díaz Casanueva http://www.linkedin.com/e/-y1615u-hgr1efjt-n/rso/255311896/LIky/name/144943… ------------------------------------------ You are receiving Invitation emails. This email was intended for Adrian Borucki. Learn why this is included: http://www.linkedin.com/e/-y1615u-hgr1efjt-n/plh/http%3A%2F%2Fhelp%2Elinked… (c) 2012, LinkedIn Corporation. 2029 Stierlin Ct, Mountain View, CA 94043, USA.

2 1

recursion patterns?
by 7stud 15 May '13

15 May '13

Well, my question does not meet the standards for a question at stackoverflow: (I am a haskell beginner) This example is from LYAH: import System.Random finiteRandoms :: (RandomGen g, Random a, Num n) => n -> g -> ([a], g) finiteRandoms 0 gen = ([], gen) finiteRandoms n gen = let (value, newGen) = random gen (restOfList, finalGen) = finiteRandoms (n-1) newGen in (value:restOfList, finalGen) Looking at that function, I find it impossible to understand how that recursion works. I have to pull out a pencil and paper to figure it out. If I was given the task of writing that function, I would write it like this: import System.Random finiteRands :: (RandomGen g, Random a) => Int -> g -> [a] finiteRands n gen = finiteRands' n gen [] finiteRands' :: (RandomGen g, Random a) => Int -> g -> [a] -> [a] finiteRands' 0 _ acc = acc finiteRands' n gen acc = let (rand_num, new_gen) = random gen in finiteRands' (n-1) new_gen (rand_num:acc) To me, it makes the function(s) simplistic to understand. Is the first solution a known 'design pattern' in recursion? The first solution: import System.Random finiteRandoms :: (RandomGen g, Random a, Num n) => n -> g -> ([a], g) finiteRandoms 0 gen = ([], gen) finiteRandoms n gen = let (value, newGen) = random gen (restOfList, finalGen) = finiteRandoms (n-1) newGen in (value:restOfList, finalGen) seems to operate a bit like foldr: the recursion spins to the base case, and the base case's return value, ([], gen), is passed back through all the function calls. Each function call modifies the tuple (the in clause) before returning it to the previous function call. Is one solution more efficient than the other? I believe my solution is tail recursive, but it's my understanding that compilers can now optimize just about anything into tail recursion. Thanks.

2 1

ACM SIGPLAN Erlang Workshop 2013 Second Call For Papers
by Laura M. Castro 14 May '13

14 May '13

Hello, Please find below the Second Call for Papers for the Twelfth ACM SIGPLAN Erlang Workshop. Apologies for any duplicates you may receive. CALL FOR PAPERS ================= Twelfth ACM SIGPLAN Erlang Workshop ----------------------------------------------------------- Boston, Massachusetts, September 28, 2013 (tentative date, subject to change) Satellite event of the 18th ACM SIGPLAN International Conference on Functional Programming (ICFP 2013) September 25-27, 2013 Erlang is a concurrent, distributed functional programming language aimed at systems with requirements of massive concurrency, soft real time response, fault tolerance, and high availability. It has been available as open source for 15 years, creating a community that actively contributes to its already existing rich set of libraries and applications. Originally created for telecom applications, its usage has spread to other domains including e-commerce, banking, databases, and computer telephony and messaging. Erlang programs are today among the largest applications written in any functional programming language. These applications offer new opportunities to evaluate functional programming and functional programming methods on a very large scale and suggest new problems for the research community to solve. This workshop will bring together the open source, academic, and industrial programming communities of Erlang. It will enable participants to familiarize themselves with recent developments on new techniques and tools tailored to Erlang, novel applications, draw lessons from users' experiences and identify research problems and common areas relevant to the practice of Erlang and functional programming. We invite three types of submissions. 1. Technical papers describing language extensions, critical discussions of the status quo, formal semantics of language constructs, program analysis and transformation, virtual machine extensions and compilation techniques, implementations and interfaces of Erlang in/with other languages, and new tools (profilers, tracers, debuggers, testing frameworks, etc.). The maximum length for technical papers is restricted to 12 pages. 2. Practice and application papers describing uses of Erlang in the "real-world", Erlang libraries for specific tasks, experiences from using Erlang in specific application domains, reusable programming idioms and elegant new ways of using Erlang to approach or solve a particular problem. The maximum length for the practice and application papers is restricted to 12 pages. Note that this is a maximum length; we welcome shorter papers also, and the program committee will evaluate all papers on an equal basis independent of their lengths. 3. Poster presentations describing topics related to the workshop goals. Each includes a maximum of 2 pages of the abstract and summary. Presentations in this category will be given an hour of shared simultaneous demonstration time. Workshop Chair ----------------------- Steve Vinoski, Basho Technologies, USA Program Chair ------------------- Laura M. Castro, University of A Coruña, Spain Program Committee ----------------------------- (Note: the Workshop and Program Chairs are also committee members) Lars-Ake Fredlund, Universidad Politécnica de Madrid, Spain Kevin Hammond, University of St. Andrews, UK Torben Hoffman, Erlang Solutions Limited, UK Zoltán Horváth, Eötvös Loránd University, Hungary Kenneth Lundin, Ericsson AB, Sweden Mickaël Rémond, ProcessOne, France Kenji Rikitake, Basho Japan KK, Japan Simon Thompson, University of Kent, UK Important Dates ----------------------- Submission deadline: Fri June 14, 2013 Author notification: Thu July 11, 2013 Final submission for the publisher: Thu July 25, 2013 Workshop date (tentative, subject to change): September 28, 2013 Instructions to authors -------------------------------- Papers must be submitted online via EasyChair (via the "Erlang2013" event). The submission page is https://www.easychair.org/conferences/?conf=erlang2013 Submitted papers should be in portable document format (PDF), formatted using the ACM SIGPLAN style guidelines. Each submission must adhere to SIGPLAN's republication policy. Violation risks summary rejection of the offending submission. Accepted papers will be published by the ACM and will appear in the ACM Digital Library. Paper submissions will be considered for poster submission in the case they are not accepted as full papers. Venue & Registration Details ------------------------------------------ For registration, please see the ICFP 2013 web site at: http://icfpconference.org/icfp2013/ Related Links -------------------- ICFP 2013 web site: http://www.icfpconference.org/icfp2013/ Past ACM SIGPLAN Erlang workshops: http://www.erlang.org/workshop/ Open Source Erlang: http://www.erlang.org/ EasyChair submission site: https://www.easychair.org/account/signin.cgi?conf=erlang2013 Author Information for SIGPLAN Conferences: http://www.sigplan.org/authorInformation.htm -- Laura M. Castro

1 0

Assistant Professor in Software Systems
by Matthew Hennessy 14 May '13

14 May '13

Assistant Professor in Software Systems University of Dublin, Trinity College Discipline of Software Systems, School of Computer Science and Statistics Post Status: Permanent Job Ref: 030223 Salary: This appointment will be made on the Department of Education and Skills Lecturer Salary Scale in line with current government pay policy and will be capped at a maximum Point 8. Closing Date: 12 noon on Monday, 10th June 2013 The post is tenable from 1 September, 2013. The Discipline of Software Systems in the School of Computer Science and Statistics is seeking to appoint an Assistant Professor in Software Systems. The Discipline is looking for an exceptional person with a proven track record in research in the field of Software Systems, preferably with research expertise in algorithms, data-structures and compilers. A significant series of publications in internationally recognised journals and conferences is expected of candidates. The successful applicant will have a primary degree and PhD in computer science or a related discipline, and will have a genuine commitment to teaching all aspects of software at both undergraduate and postgraduate levels. Enthusiasm for the development and delivery of novel teaching modules on algorithms, data-structures and compilers is also required. For more details of the post, and how to apply see https://jobs.tcd.ie/ Informal enquiries are welcome and candidates may e-mail Professor Matthew Hennessy (matthew.hennessy(a)cs.tcd.ie)

1 0

ANNOUNCE: Haskell Communities and Activities Report (24th ed., May 2013)
by Janis Voigtländer 11 May '13

11 May '13

On behalf of all the contributors, I am pleased to announce that the Haskell Communities and Activities Report (24th edition, May 2013) is now available in PDF and HTML formats: http://haskell.org/communities/05-2013/report.pdf http://haskell.org/communities/05-2013/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. I hope you will find it as interesting a read as I 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 editor collects all the contributions into a single report and feeds that back to the community. When I 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 October 2013: target deadline for contributions to the November 2013 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 editor for a simple e-mail reminder in October (you could point me to them as well, and I 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! Janis Voigtlaender <hcar at haskell.org>

1 0

Call for talk proposals: HOPE'13 (Workshop on Higher-Order Programming with Effects, affiliated with ICFP'13)
by Hongseok Yang 11 May '13

11 May '13

---------------------------------------------------------------------- CALL FOR TALK PROPOSALS HOPE 2013 The 2nd ACM SIGPLAN Workshop on Higher-Order Programming with Effects September 28, 2013 Boston, Massachusetts (the day after ICFP 2013) http://hope2013.mpi-sws.org ---------------------------------------------------------------------- HOPE 2013 aims at bringing together researchers interested in the design, semantics, implementation, and verification of higher-order effectful programs. It will be *informal*, consisting of invited talks, contributed talks on work in progress, and open-ended discussion sessions. --------------------- Goals of the Workshop --------------------- A recurring theme in many papers at ICFP, and in the research of many ICFP attendees, is the interaction of higher-order programming with various kinds of effects: storage effects, I/O, control effects, concurrency, etc. While effects are of critical importance in many applications, they also make it hard to build, maintain, and reason about one's code. Higher-order languages (both functional and object-oriented) provide a variety of abstraction mechanisms to help "tame" or "encapsulate" effects (e.g. monads, ADTs, ownership types, typestate, first-class events, transactions, Hoare Type Theory, session types, substructural and region-based type systems), and a number of different semantic models and verification technologies have been developed in order to codify and exploit the benefits of this encapsulation (e.g. bisimulations, step-indexed Kripke logical relations, higher-order separation logic, game semantics, various modal logics). But there remain many open problems, and the field is highly active. The goal of the HOPE workshop is to bring researchers from a variety of different backgrounds and perspectives together to exchange new and exciting ideas concerning the design, semantics, implementation, and verification of higher-order effectful programs. We want HOPE to be as informal and interactive as possible. The program will thus involve a combination of invited talks, contributed talks about work in progress, and open-ended discussion sessions. There will be no published proceedings, but participants will be invited to submit working documents, talk slides, etc. to be posted on this website. ----------------------- Call for Talk Proposals ----------------------- We solicit proposals for contributed talks. Proposals should be at most 2 pages, in either plain text or PDF format, and should specify how long a talk the speaker wishes to give. By default, contributed talks will be 30 minutes long, but proposals for shorter or longer talks will also be considered. Speakers may also submit supplementary material (e.g. a full paper, talk slides) if they desire, which PC members are free (but not expected) to read. We are interested in talks on all topics related to the interaction of higher-order programming and computational effects. Talks about work in progress are particularly encouraged. If you have any questions about the relevance of a particular topic, please contact the PC chairs at the address hope2013 AT mpi-sws.org. Deadline for talk proposals: June 14, 2013 (Friday) Notification of acceptance: July 28, 2013 (Sunday) Workshop: September 28, 2013 (Saturday) The submission website is now open: https://www.easychair.org/conferences/?conf=hope2013 --------------------- Workshop Organization --------------------- Program Co-Chairs: Derek Dreyer (MPI-SWS, Germany) Hongseok Yang (University of Oxford) Program Committee: Anindya Banerjee (IMDEA Software Institute) Lars Birkedal (Aarhus University) Aquinas Hobor (National University of Singapore) Chung-Kil Hur (Microsoft Research Cambridge) Patricia Johann (Appalachian State University) Matthew Might (University of Utah) Peter Mueller (ETH Zurich) Brigitte Pientka (McGill University) Zhong Shao (Yale)

1 0

ANN: strict-base-types-0.1
by Simon Meier 11 May '13

11 May '13

Dear fellow haskellers, the strict-base-types package makes it easy to get rid of the unnecessary laziness (and the resulting space leaks) in your applications; i.e., no more data AppState = AppState { _field :: !(Maybe T.Text) , ... } as the alternative import qualified Data.Maybe.Strict as S data AppState = AppState { _field :: !(S.Maybe T.Text) , ... } is now equally cheap. See http://hackage.haskell.org/package/strict-base-types-0.1 for a full explanation of the functionality provided by this package. happy hacking, Simon

4 4

Formal Methods/Functional programming job position at Intel
by Levent Erkok 08 May '13

08 May '13

Our formal methods team at Intel has a full-time position available that I think would be a good fit for functional programming and formal methods enthusiasts. I'm including the description below. Do not hesitate to contact me if you've any questions, or just want to talk about it in general. To apply for the position, please visit: http://www.intel.com/jobs/jobsearch/index.htm, and in the "advanced search" area enter the job number: 709631. Thanks, -Levent. Job Description *Formal Methods & Validation Architect* *-* *709631* Description If you're interested in products going into future super computer markets then the Intel® Many Integrated Core (Intel® MIC) Hardware Engineering Group is the place for you! We design and validate silicon chips with many Intel cores integrated inside being used in high performance computing architectures. In this position you will work as part of the pre-silicon formal methods, tools, and verification team to support a continued high quality of the future Intel many core processor products. You will work together with Intel's formal verification and validation community, the Formal Verification Center of Expertise (FV CoE) in a team of experts in formal methods and AV Validation. Your specific responsibilities will include defining formal verification (FV) test plans as well as Cluster Test Environment (CTE) based test plans for dynamic simulation validation (DV). The goal is to help optimize a combined use of FV and CTE based validation techniques (DV) and contribute to an increasing use of formal methods at Intel. Based on the test plans you will write properties in formal language, and prove the properties using our model checkers and theorem proving tools. You will also write CTE based test cases and coverage plans. Your area of strength may currently lie within either FV or DV with strong skills rooted in software development. But through your skills and work, you will become an expert in both formal methods and validation technologies. You will interact very closely with design teams, and other validation teams, as well as with Intel's internal R&D groups that continue to improve and develop formal method and verification tools. You must be able to communicate effectively with various technical groups and coordinate activities amongst those groups.

1 0

CfP Workshop Haskell and Rewriting Techniques (Deadline: May 21)
by Johannes Waldmann 08 May '13

08 May '13

final call for papers (note: extended deadline) ================================================== Rewriting is the science of replacing equals by equals and thus a very powerful method for dealing with equations. There are strong connections between Haskell programming and rewriting. Therefore, we announce a new workshop, International Workshop on Haskell And Rewriting Techniques (HART 2013) http://www.imn.htwk-leipzig.de/HART2013/ to be held on June 27, in conjunction with RDP 2013, in Eindhoven. (RDP contains RTA, the main rewriting conference.) We plan a half day of discussions, in an informal setting, on how Haskell and rewriting techniques and theories can cross-fertilize each other. Topics of interest are, for example, equational reasoning and other rewriting techniques for program verification and analysis; lambda calculi and type systems for functional programs and higher order rewriting systems; rewriting of type expressions in the type checker; rewriting of programs by refactoring tools, optimizers, code generators; execution of programs as a form of graph rewriting; template Haskell, introducing a rewriting-like macro language into the compilation process. This list of topics is non-exclusive. If you have a contribution that connects Haskell and rewriting, then submit. When in doubt, contact a member of the PC. Program committee: Alcino Cunha (U Minho) Jürgen Giesl (RWTH Aachen) Andy Gill (U of Kansas) Johan Jeuring (U Utrecht) Keisuke Nakano (UEC Tokyo) Kristoffer H Rose (IBM Watson) (co-chair) Christian Sternagel (JAIST) Janis Voigtländer (U Bonn) Johannes Waldmann (HTWK Leipzig) (co-chair) Dates: May 21: deadline for submissions May 28: notification of acceptance June 27: workshop Submission and Proceedings: Two categories of submissions are invited: Extended abstracts. Presenting original research, and also preliminary reports of work in progress. Will be included in the proceedings. Presentation-only papers. Describing work recently published or submitted. Will not be included in the proceedings. Papers should be at most 5 pages in length, and should use the easychair.cls style. Submission is handled through the EasyChair HART2013 page, https://www.easychair.org/conferences/?conf=hart2013 In line with the informal style of the workshop, the reviewing of submissions will be light. When accepting and scheduling presentations, preference will be given to original research. Proceedings will be made available electronically at the workshop.

1 0