- Haskell - Haskell.org

Job Opportunity: PhD position at Utrecht University on analysis of functional languages
by Jurriaan Hage 22 Feb '12

22 Feb '12

Hello Haskellers, I have the following job opening for a PhD student. Maybe it is something for some of you. Please pass it on to anyone who might be interested. Apologies if you happen to receive this mail multiple times. best regards, Jurriaan Hage ============================================================== VACANCY : 1x Phd Student in type and effect systems for functional languages ============================================================== The research group of Software Technology at Utrecht University focuses its research on programming methodologies, compiler construction, and program analysis, validation, and verification. For more about us, see: http://www.cs.uu.nl/wiki/Center Financed by the Netherlands Organisation for Scientific Research (NWO), we currently have a job opening for: * 1x PhD researcher (Ph D student) Software Technology The topic of the project is to further investigate the notion of higher-ranked polyvariance within the context of type based static analysis of higher-order (functional) languages. Type and effect systems for functional languages employ the underlying type system of a language to implement various other analyses, e.g., dead-code analysis and strictness analysis. These are designed by annotating the underlying types with information concerning the analysis in question. Higher-ranked polyvariance is a level of precision for such annotations inspired by higher-ranked type systems. Full inference of the latter is known to be undecidable, but this is, surprisingly maybe, not the case for higher-ranked polyvariance. More details can be found in the following paper, published at ICFP 2010: http://www.cs.uu.nl/wiki/pub/Hage/PublicationList/holdermans10polyvariant.p… There remain many open questions about higher-ranked polyvariance. For example, can validating analyses such as Kennedy's dimension analysis be treated similarly? Can we show that adding higher-ranked types to a resource analysis yields a beneficial higher level of precision? (This work will be done in collaboration with others, including Kevin Hammond of St. Andrews.) Can we extend our work to a richer type language? Is it possible to selectively analyze programs higher-ranked polyvariantly? The candidate is expected to address these questions, communicate the results academically, to present the work at scientific conferences, to supervise Master students, and to assist in teaching courses at Bachelor or Master level. --------------------------------- What we are looking for --------------------------------- The candidate should have an MSc in Computer Science, be highly motivated, speak and write English very well, and be proficient in producing scientific reports. Knowledge of and experience with at least one of the following two areas is essential: * static program analysis, and type and effect systems in particular * functional programming, and Haskell in particular Furthermore, we expect the candidate to be able to reason formally. Experience in compiler construction, the practical use of theorem provers, and algorithmic complexity are expected to be useful in this project. --------------------------------- What we offer --------------------------------- The candidate is offered a full-time position for four years. The salary is supplemented with a holiday bonus of 8% and an end-of-year bonus of 8,3% per year. In addition we offer: a pension scheme, a partially paid parental leave, flexible employment conditions. Conditions are based on the Collective Labour Agreement Dutch Universities. The research group will provide the candidate with necessary support on all aspects of the project. More information is available on the website: http://www.uu.nl/EN/informationfor/jobseekers/Working-for-Utrecht-Universit… The gross salary is in the range between € 2,042 and € 2,612 gross per month. We aim to start September 1, 2012 at the latest, but preferably sooner. --------------------------------- In order to apply --------------------------------- To apply please attach a letter of motivation, a curriculum vitae, and (email) addresses of two referees. Make sure to also include a transcript of the courses you have followed (at bachelor and master level), with the grades you obtained, and to include a sample of your scientific writing, e.g., the pdf of your master thesis. It is possible to apply for this position if you are close to obtaining your Master's. In that case include a letter of your supervisor with an estimate of your progress, and do not forget to include at least a sample of your technical writing skills. Application closes on the 21st March 2012. Visit http://www.cs.uu.nl/vacatures/en/200946.html and from there follow the link to the official job application page. --------------- Contact person --------------- For further information you can direct your inquiries to: Dr. Jurriaan Hage Phone: (+31) 30 253 3283 e-mail: J.Hage(a)uu.nl. website: http://www.cs.uu.nl/wiki/Hage/WebHome

1 0

Six Prize PhD Studentships at the University of St Andrews
by Kevin Hammond 22 Feb '12

22 Feb '12

The School of Computer Science at the University of St Andrews has six prize PhD studentships available. These studentships are funded through the Scottish Informatics and Computer Science Alliance and provide both fees and maintenance (£13,500) per annum. They can be taken up by students of any nationality (including non-EU students). Good students who are interested in PhD study in functional programming should please contact me (kh(a)cs.st-andrews.ac.uk) urgently. Deadline: March 1st 2012. Full details of the scheme at: http://blogs.cs.st-andrews.ac.uk/csblog/2011/11/17/funded-research-students… Further information about my research at http://www.cs.st-andrews.ac.uk/~kh Best Wishes, Kevin -------- Kevin Hammond, Professor of Computer Science, University of St Andrews T: +44-1334 463241 F: +44-1334-463278 W: http://www.cs.st-andrews.ac.uk/~kh In accordance with University policy on electronic mail, this email reflects the opinions of the individual concerned, may contain confidential or copyright information that should not be copied or distributed without permission, may be of a private or personal nature unless explicitly indicated otherwise, and should not under any circumstances be taken as an official statement of University policy or procedure (see http://www.st-and.ac.uk) The University of St Andrews is a charity registered in Scotland : No SC013532

1 0

ANNOUNCE: netspec-0.2.0.0
by Dan Burton 22 Feb '12

22 Feb '12

The examples are currently written in a fairly brittle style (they assume no exceptions, uninterrupted connection, etc). Recommendations to beef up both the examples and the safety of the framework in general would be greatly appreciated. https://github.com/DanBurton/netspec/tree/master/examples -- Dan Burton danburton.email(a)gmail.com On Tue, Feb 21, 2012 at 7:11 PM, Dan Burton <danburton.email(a)gmail.com>wrote: > Haskellers, > > I'm pleased to announce the first public release of NetSpec, a little > Network library to simplify networking tasks that involve a fixed number of > connections, using Erlang-esque send and receive primitives. > > Check out the docs: http://hackage.haskell.org/package/netspec > And the repo on github (with examples): > https://github.com/DanBurton/netspec > > -- > Dan Burton > > _______________________________________________ > Haskell mailing list > Haskell(a)haskell.org > http://www.haskell.org/mailman/listinfo/haskell > >

1 0

(no subject)
by Dan Burton 22 Feb '12

22 Feb '12

Haskellers, I'm pleased to announce the first public release of NetSpec, a little Network library to simplify networking tasks that involve a fixed number of connections, using Erlang-esque send and receive primitives. Check out the docs: http://hackage.haskell.org/package/netspec And the repo on github (with examples): https://github.com/DanBurton/netspec -- Dan Burton

1 0

Second Monad.Reader #20 call for copy
by Edward Z. Yang 21 Feb '12

21 Feb '12

Second Call for Copy: The Monad.Reader - Issue 20 ------------------------------------------------- Whether you're an established academic or have only just started learning Haskell, if you have something to say, please consider writing an article for The Monad.Reader! The submission deadline for Issue 20 will be: **Monday, March 5** The Monad.Reader ~~~~~~~~~~~~~~~~ The Monad.Reader is a electronic magazine about all things Haskell. It is less formal than journal, but somehow more enduring than a wiki- page. There have been a wide variety of articles: exciting code fragments, intriguing puzzles, book reviews, tutorials, and even half-baked research ideas. Submission Details ~~~~~~~~~~~~~~~~~~ Get in touch with me if you intend to submit something -- the sooner you let me know what you're up to, the better. Please submit articles for the next issue to me by e-mail (ezyang(a)mit.edu) Articles should be written according to the guidelines available from http://themonadreader.wordpress.com/contributing/ Please submit your article in PDF, together with any source files you used. The sources will be released together with the magazine under a BSD license. If you would like to submit an article, but have trouble with LaTeX please let me know and we'll work something out.

1 0

CALL FOR WORSHOP PROPOSALS (ICSOC-2012: The 10th International Conference on Service-Oriented Computing)
by Huibiao Zhu 20 Feb '12

20 Feb '12

CALL FOR WORSHOP PROPOSALS ICSOC-2012: The 10th International Conference on Service-Oriented Computing Shanghai, China November 12-16, 2012 The 10th International Conference on Service Oriented Computing invites proposals for workshops to be held in conjunction with the main conference. The workshop program seeks to provide venues for specialist groups to meet, to generate focused discussion on specific sub-areas within Service Oriented Computing and to engage in community-building activities. Possible topics for workshops include (but are not limited to): * Service-oriented architectures * Services on the cloud * Service monitoring and adaptation * Social networks and services * Human-mediated services * Theoretical and Technical Service Foundations * Business Service Modeling and Business Process Modeling * Service Integration and Orchestration on the Cloud * Service Composition and Engineering * Service Operations and Management on the Cloud * Quality of Service for Cloud Services * Service Applications and Implementations * Service Design Methods * Service change management * Designing Outsourcing Interactions * Service Vocabularies and Ontologies * Testbeds for Service Concepts and Technologies * Business Intelligence and Analytics for Services * Pervasive and Mobile Services on the Cloud * Embedded and Real-time Services * Service Security, Privacy, and Trust New and emerging areas of interest, including novel application domains are particularly welcome. IMPORTANT DATES: Workshop Proposal Submission Deadline April 15, 2012 Workshop Acceptance Notification May 1, 2012 Paper Submission Deadline for Workshops July 31, 2012 Paper Acceptance Notification September 15, 2012 Camera Ready Paper & Copyright October 1, 2012 WORKSHOP ORGANIZATION Workshop organizers will be responsible for the following: * Constituting the workshop program committee * Advertising the workshop * Managing the paper review and selection process. * Ensuring that at least one author of each accepted paper attends to present the paper (this may require announcing regulations that stipulate this as a prerequisite for the publication of the paper in the workshop proceedings. * Ensuring that the workshop delivers useful scholarly/research value via active discussion/debate. Workshops may be full-day or half-day. It is likely that the proceedings of accepted workshops will be jointly produced as a Springer volume (in the form of a "post-proceedings"), but a formal proposal to Springer will only be made after the accepted workshops and their program committees are finalized. Working notes of the workshops (including papers to be eventually published in the joint workshop volume) will be locally printed for distribution on the workshop day. Workshop Proposal Submission Workshop proposals should include the following elements: * Workshop title. * Name, affiliation, postal and e-mail addresses of each (proposed) workshop chair. * A brief (1-page) CV of each (proposed) workshop chair, highlighting prior experience in organizing similar fora. * A brief description of the topic of the workshop and its relevance to the conference (not exceeding 500 words) * Proposed duration of the workshop (full-day or half-day). * A list of likely program committee members. * A description of the paper review and selection process (it is recommended that each paper is reviewed by 3 distinct members of the workshop program committee). ICSOC-2012 WORKSHOP CHAIRS Aditya Ghose University of Wollongong, Australia, EMAIL: aditya AT uow DOT edu DOT au Huibiao Zhu Eastern China Normal University, China, EMAIL: hbzhu AT sei DOT ecnu DOT edu DOT cn

1 0

Job Opportunity: Data Scientist at madvertise Mobile Advertising (Berlin)
by Adam Drake 17 Feb '12

17 Feb '12

Hello Haskellers, We are a start-up company (currently approximately 70 people) and are looking to grow our research and technology group by hiring a new Data Scientist. This person should have a strong quantitative background and Haskell experience is a plus. Bonus points if you have experience building sizable tool chains and applications or your Haskell experience has involved analysis and machine learning techniques on large data sets. For more information, please visit the job listing on our website. http://madvertise.com/en/2012/02/14/data-scientist-fm/ If you have any questions, feel free to contact me directly. You can also email questions to Julian Fichter in HR: julian [dot] fichter (at) madvertise (dot) com. -- Best Regards, Adam Drake

1 0

ANNOUNCE: system-filepath 0.4.5 and system-fileio 0.3.4
by John Millikin 16 Feb '12

16 Feb '12

Both packages now have much-improved support for non-UTF8 paths on POSIX systems. There are no significant changes to Windows support in this release. system-filepath 0.4.5: Hackage: http://hackage.haskell.org/package/system-filepath-0.4.5 API reference: https://john-millikin.com/software/haskell-filesystem/reference/system-file… system-fileio 0.3.4: Hackage: http://hackage.haskell.org/package/system-fileio-0.3.4 API reference: https://john-millikin.com/software/haskell-filesystem/reference/system-file… ----- In GHC 7.2 and later, file path handling in the platform libraries was changed to treat all paths as text (encoded according to locale). This does not work well on POSIX systems, because POSIX paths are byte sequences. There is no guarantee that any particular path will be valid in the user's locale encoding. system-filepath and system-fileio were modified to partially support this new behavior, but because the underlying libraries were unable to represent certain paths, they were still "broken" when built with GHC 7.2+. The changes in this release mean that they are now fully compatible (to the best of my knowledge) with GHC 7.2 and 7.4. Important changes: * system-filepath has been converted from GHC's escaping rules to its own, more compatible rules. This lets it support file paths that cannot be represented in GHC 7.2's escape format. * The POSIX layer of system-fileio has been completely rewritten to use the FFI, rather than System.Directory. This allows it to work with arbitrary POSIX paths, including those that GHC itself cannot handle. The Windows layer still uses System.Directory, since it seems to work properly. * The POSIX implementation of createTree will no longer recurse into directory symlinks that it does not have permission to remove. This is a change in behavior from the directory package's implementation. See http://www.haskell.org/pipermail/haskell-cafe/2012-January/098911.html for details and the reasoning behind the change. Since Windows does not support symlinks, I have not modified the Windows implementation (which uses removeDirectoryRecursive).

5 12

Haskell Weekly News: Issue 215
by Daniel Santa Cruz 16 Feb '12

16 Feb '12

Welcome to issue 215 of the HWN, a newsletter covering developments in the Haskell community. This release covers the week of February 5 to 11, 2012. You can find the HTML version of this issue at: http://contemplatecode.blogspot.com/2012/02/haskell-weekly-news-issue-215.h… Quotes of the Week * nand': haskell has a few advantages in the industry that few other languages can offer. these will become more obvious as time goes on and programming is forced into a functional direction in general. * seo: What i do not realize is actually how you are now not really much more well-liked than you might be right now. You are so intelligent. You realize thus significantly in terms of this subject, produced me in my view consider it from so many numerous angles. Its like men and women are not interested unless it‚s one thing to do with Woman gaga! Your personal stuffs excellent. Always care for it up! * monochrom: Schrodinger's Klein glass bottle: before you look, the cat is inside or outside; after you look, it is inside and outside :) * cmccann: Ruby is a fine language if you're secretly a lisp programmer but want to hide behing perl and smalltalk so nobody catches you * mlh: nice quote -- quick, someone register it for posterity * something: somebody never said, naturally. * irene-knapp: I was going to take a famous quote and put it in lambdabot as my own but I couldn't decide on one * shachaf: getLine :: IO String contains a String in the same way that /bin/ls contains a list of files * edwardk: [unsafePerformIO] sounds like a good idea, its tempting, it makes life easy, for the first 2 lines of code. then you go to write the third and everything goes to shit * cmccann: Idiom brackets are where you consume a mixture of alcohol and Conor McBride papers until your vision gets blurry enough that you can't actually see the Applicative operators anymore. * Philippa: incidentally, if you think about this you're probably starting to image control flow that looks like it's a glyph for summoning cthulhu - and then realising that it's 3d and consists of 'towers'. Make sense? * c_wraith: also, "actual" reals is a funny thing to call a set that consists mostly of things that cannot be described. * NihilistDandy: I feel like a hipster whenever I talk programming with people at my school. I always have to preface discussions with "you've probably never heard of it" :/ * ion: Three lefts make two wrongs * elliott: Explicit recursion should generally be avoided. Also, general recursion should be explicitly avoided! * CodeWeaverX: I expect that Weird Untraceable Suitcases Full Of Bad could result from the program assuming such an operation is pure when it clearly isn't. * elliott: cmccann: the instances list haddock generates is now a thing of majesty edwardk: elliott: welcome to my world * mzero: functional programming has a property that is often lacking in other languages... at dinner last night we were discussing it, and I dubbed it: "The Princess Bride" property --- which is, that a piece of code means what you think it means * sclv: You have a problem and think "I'll use a hash function." Now you have intermittantly colliding problems. * monochrom: data Ph a = Ph -- the phantom monad ksion: Is that a new Star Wars prequel? ;) * user1151874: i already declare hp as int with value 3 now my problem is when i put "hp--", it shows error [...] but if i put "--hp", the result print is 3 not 2. * edwardk: thats my secret. really i don't write anything. i just let others do the work and upload it to hackage behind their backs Top Reddit Stories * Haskell as most mainstream non-mainstream language? The RedMonk Programming Language Rankings: February 2012 Domain: redmonk.com, Score: 45, Comments: 25 On Reddit: [1] http://goo.gl/xWHB8 Original: [2] http://goo.gl/REBXN * The future is parallel, and the future of parallel is declarative (Simon Peyton Jones) [RE: Escape From the Ivory Tower] Domain: yow.eventer.com, Score: 41, Comments: 5 On Reddit: [3] http://goo.gl/PJSlh Original: [4] http://goo.gl/zUKT5 * How Prelude avoids overlapping instances in Show Domain: brandon.si, Score: 32, Comments: 18 On Reddit: [5] http://goo.gl/qGPZK Original: [6] http://goo.gl/rC6qr * InfoQ: Yesod Web Framework (Michael's QCon talk) Domain: infoq.com, Score: 32, Comments: 12 On Reddit: [7] http://goo.gl/93SFv Original: [8] http://goo.gl/Xao7S * Search tree that does not require that items be sorted. Domain: twanvl.nl, Score: 28, Comments: 3 On Reddit: [9] http://goo.gl/R2yLD Original: [10] http://goo.gl/WGfcV * Reverse engineering the ZeroMQ wire protocol for ZMQHS Domain: xrl.tureus.com, Score: 27, Comments: 0 On Reddit: [11] http://goo.gl/UKIun Original: [12] http://goo.gl/oVstA * Announcing Yesod 0.10 - conduits, persistent 0.8, improved Coffeescript integration Domain: yesodweb.com, Score: 25, Comments: 12 On Reddit: [13] http://goo.gl/1RRJH Original: [14] http://goo.gl/KftN5 * Real World Haskell book site -- is it known to be down? If so how long has it been down and will it come back? Domain: book.realworldhaskell.org, Score: 24, Comments: 15 On Reddit: [15] http://goo.gl/GV6z2 Original: [16] http://goo.gl/RCxnT * What do Haskellers think of Rust? It's got lambdas and ADTs with C-style notation. Domain: rust-lang.org, Score: 24, Comments: 40 On Reddit: [17] http://goo.gl/a9bCB Original: [18] http://goo.gl/xAKHx * r/darcs - for discussing darcs and patch theory Domain: reddit.com, Score: 24, Comments: 8 On Reddit: [19] http://goo.gl/37ArD Original: [20] http://goo.gl/qQiaD * Will Haskell be the Smalltalk of functional programming? Domain: self.haskell, Score: 22, Comments: 54 On Reddit: [21] http://goo.gl/ZxmBN Original: [22] http://goo.gl/ZxmBN Top StackOverflow Questions * Abusing the algebra of algebraic data types - why does this work? votes: 53, answers: 4 Read on SO: [23] http://goo.gl/MyQRO * Recommended reading/tutorials to understand reactive-banana FRP library votes: 13, answers: 3 Read on SO: [24] http://goo.gl/hTPv6 * Safe modelling of relational data in Haskell votes: 12, answers: 2 Read on SO: [25] http://goo.gl/4bEXX * What are the definitions for >>= and return for the IO monad? votes: 12, answers: 3 Read on SO: [26] http://goo.gl/9jH2x * Basic Structure of a Haskell Program votes: 11, answers: 1 Read on SO: [27] http://goo.gl/3OcKg * GHC API - How to dynamically load Haskell code from a compiled module using GHC 7.2? votes: 11, answers: 2 Read on SO: [28] http://goo.gl/aYKZz * Lifting a higher order function in Haskell votes: 9, answers: 1 Read on SO: [29] http://goo.gl/JhmjK * How do you check the type of a local variable? votes: 8, answers: 5 Read on SO: [30] http://goo.gl/Ynfgv * Tail optimization guarantee - loop encoding in Haskell votes: 7, answers: 2 Read on SO: [31] http://goo.gl/PKqfq * Writing in pointfree style f x = g x x votes: 7, answers: 1 Read on SO: [32] http://goo.gl/EIFBw Until next time, Daniel Santa Cruz References 1. http://redmonk.com/sogrady/2012/02/08/language-rankings-2-2012/ 2. http://www.reddit.com/r/haskell/comments/ph4uq/haskell_as_most_mainstream_n… 3. http://yow.eventer.com/events/1004/talks/1055 4. http://www.reddit.com/r/haskell/comments/phnd3/the_future_is_parallel_and_t… 5. http://brandon.si/code/how-the-haskell-prelude-avoids-overlapping-types-in-… 6. http://www.reddit.com/r/haskell/comments/pel34/how_prelude_avoids_overlappi… 7. http://www.infoq.com/presentations/Yesod 8. http://www.reddit.com/r/haskell/comments/pjqpr/infoq_yesod_web_framework_mi… 9. http://twanvl.nl/blog/haskell/SemilatticeSearchTree 10. http://www.reddit.com/r/haskell/comments/pj6n7/search_tree_that_does_not_re… 11. http://xrl.tureus.com/black-box-reverse-engineering-zmq 12. http://www.reddit.com/r/haskell/comments/pcojs/reverse_engineering_the_zero… 13. http://www.yesodweb.com/blog/2012/02/release-0-10 14. http://www.reddit.com/r/haskell/comments/phxjo/announcing_yesod_010_conduit… 15. http://book.realworldhaskell.org/read 16. http://www.reddit.com/r/haskell/comments/pd79r/real_world_haskell_book_site… 17. http://www.rust-lang.org/ 18. http://www.reddit.com/r/haskell/comments/pewtc/what_do_haskellers_think_of_… 19. http://reddit.com/r/darcs 20. http://www.reddit.com/r/haskell/comments/pkv8g/rdarcs_for_discussing_darcs_… 21. http://www.reddit.com/r/haskell/comments/pczyz/will_haskell_be_the_smalltal… 22. http://www.reddit.com/r/haskell/comments/pczyz/will_haskell_be_the_smalltal… 23. http://stackoverflow.com/questions/9190352/abusing-the-algebra-of-algebraic… 24. http://stackoverflow.com/questions/9210412/recommended-reading-tutorials-to… 25. http://stackoverflow.com/questions/9234205/safe-modelling-of-relational-dat… 26. http://stackoverflow.com/questions/9244538/what-are-the-definitions-for-and… 27. http://stackoverflow.com/questions/9153574/basic-structure-of-a-haskell-pro… 28. http://stackoverflow.com/questions/9198140/ghc-api-how-to-dynamically-load-… 29. http://stackoverflow.com/questions/9243215/lifting-a-higher-order-function-… 30. http://stackoverflow.com/questions/9210311/how-do-you-check-the-type-of-a-l… 31. http://stackoverflow.com/questions/9149183/tail-optimization-guarantee-loop… 32. http://stackoverflow.com/questions/9169046/writing-in-pointfree-style-f-x-g…

1 0

ANNOUNCE: acid-state-0.6
by Lemmih 15 Feb '12

15 Feb '12

Greetings, With acid-state-0.6, you can use regular Haskell data structures without worrying about data loss or durability. Your state will simply always be available to you even after software crashes or power outages. Important: acid-state-0.6 is not immediately backwards compatible with previous versions. To restore states from previous versions you first need to create a checkpoint and then modify your data structure to use the 'Prim' wrapper from safecopy-0.6 wherever built-in types are used. More information on this will be on the wiki soonish. I hope this slight inconvenience will be worth it in the long run. Acid-state-0.6 also includes a new Remote backend that enables concurrent access by multiple processes. For examples of how to use the library, see: http://mirror.seize.it/acid-state/examples/ Hackage page: http://hackage.haskell.org/package/acid-state Wiki site: http://acid-state.seize.it/ -- Cheers, Lemmih

2 1